Relaxation schemes for mathematical programmes with switching constraints
Sign Up to like & getrecommendations! Published in 2019 at "Optimization Methods and Software"
DOI: 10.1080/10556788.2019.1663425
Abstract: Switching-constrained optimization problems form a difficult class of mathematical programs since their feasible set is almost disconnected while standard constraint qualifications are likely to fail at several feasible points. That is why the application of… read more here.
Keywords: relaxation; mathematical programs; switching constraints; switching constrained ... See more keywords