Pages that link to "Item:Q1577616"
From MaRDI portal
The following pages link to Normal cones to a polyhedral convex set and generating efficient faces in linear multiobjective programming (Q1577616):
Displaying 14 items.
- A new method for determining all maximal efficient faces in multiple objective linear programming (Q514052) (← links)
- On duality in multiple objective linear programming (Q531426) (← links)
- Constructing efficient solutions structure of multiobjective linear programming (Q557002) (← links)
- Generating efficient outcome points for convex multiobjective programming problems and its application to convex multiplicative programming (Q642767) (← links)
- Inverse eigenvalue problems for linear complementarity systems (Q716414) (← links)
- Normal fans of polyhedral convex sets (Q931419) (← links)
- Generating the weakly efficient set of nonconvex multiobjective problems (Q934803) (← links)
- Normal conical algorithm for concave minimization over polytopes (Q1177231) (← links)
- The maximal descriptor index set for a face of a convex polyhedral set and some applications (Q2345491) (← links)
- Complementarity problems with respect to Loewnerian cones (Q2349522) (← links)
- Robust aspects of solutions in deterministic multiple objective linear programming (Q2355799) (← links)
- Local convergence properties of Douglas-Rachford and alternating direction method of multipliers (Q2397468) (← links)
- A new duality approach to solving concave vector maximization problems (Q2433928) (← links)
- The point-based robustness gap for uncertain multiobjective optimization (Q6548325) (← links)
