ON LINEAR VECTOR MAXIMIZATION PROBLEMS
From MaRDI portal
Publication:4149222
Cited in
(6)- An exact penalty on bilevel programs with linear vector optimization lower level
- An algorithm for optimizing over the weakly-efficient set
- Admissible points of a convex polyhedron
- A method for constructing the polar cone of a polyhedral cone, with applications to linear multicriteria decision problems
- Further analysis of an outcome set-based algorithm for multiple-objective linear programming
- Optimization of a linear function on the set of efficient solutions of a multicriterion convex quadratic problem
This page was built for publication: ON LINEAR VECTOR MAXIMIZATION PROBLEMS
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4149222)