Pages that link to "Item:Q2564166"
From MaRDI portal
The following pages link to Lagrangian duality of concave minimization subject to linear constraints and an additional facial reverse convex constraint (Q2564166):
Displayed 5 items.
- Penalty parameter for linearly constrained 0--1 quadratic programming (Q1411397) (← links)
- Branch-and-bound variant of an outcome-based algorithm for optimizing over the efficient set of a bicriteria linear programming problem (Q1579631) (← links)
- Technical efficiency and distance to a reverse convex set (Q1809835) (← links)
- Deriving the properties of linear bilevel programming via a penalty function approach (Q1962473) (← links)
- ON THE PROJECTION OF THE EFFICIENT SET AND POTENTIAL APPLICATIONS (Q4548050) (← links)