Mathematical programming with vanishing constraints (MPVC) represents a challenging class of optimisation problems where certain constraints become inactive—or “vanish”—depending on specific ...

This is a preview. Log in through your library . Abstract The hyperbolic (or fractional) linear programming problem with only one aggregate constraint is solved by a simple and extremely efficient ...

Constraint Programming (CP) has been successful in a number of combinatorial search and discrete optimisation problems. Yet other more traditional approaches, such as Integer Programming (IP), can ...