Normal cones to a polyhedral convex set and generating efficient faces in linear multiobjective programming
From MaRDI portal
Publication:1577616
zbMath0959.90042MaRDI QIDQ1577616
Dinh The Luc, Nguyen Thi Bach Kim
Publication date: 6 May 2001
Published in: Acta Mathematica Vietnamica (Search for Journal in Brave)
Related Items (11)
Local convergence properties of Douglas-Rachford and alternating direction method of multipliers ⋮ A new duality approach to solving concave vector maximization problems ⋮ Generating efficient outcome points for convex multiobjective programming problems and its application to convex multiplicative programming ⋮ Generating the weakly efficient set of nonconvex multiobjective problems ⋮ A new method for determining all maximal efficient faces in multiple objective linear programming ⋮ On duality in multiple objective linear programming ⋮ Constructing efficient solutions structure of multiobjective linear programming ⋮ Inverse eigenvalue problems for linear complementarity systems ⋮ The maximal descriptor index set for a face of a convex polyhedral set and some applications ⋮ Complementarity problems with respect to Loewnerian cones ⋮ Robust aspects of solutions in deterministic multiple objective linear programming
This page was built for publication: Normal cones to a polyhedral convex set and generating efficient faces in linear multiobjective programming
