The Attainment of the Solution of the Dual Program in Vertices for Vectorial Linear Programs
From MaRDI portal
Publication:3649586
DOI10.1007/978-3-540-85646-7_2zbMath1176.90458OpenAlexW5295403MaRDI QIDQ3649586
Christiane Tammer, Andreas Löhne, Frank Heyde
Publication date: 4 December 2009
Published in: Multiobjective Programming and Goal Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-85646-7_2
Related Items (2)
Classical linear vector optimization duality revisited ⋮ Set-valued duality theory for multiple objective linear programs and application to mathematical finance
Cites Work
- On supremum of a set in a multidimensional space
- The set of all nondominated solutions in linear cases and a multicriteria simplex method
- Linear multiobjective programming
- A general method for determining the set of all efficient solutions to a linear vectormaximum problem
- Generating all maximal efficient faces for multiple objective linear programs
- Determination of the efficient set in multiobjective linear programming
- Primal-dual simplex method for multiobjective linear programming
- Supremal points and generalized duality
- The Enumeration of the Set of All Efficient Solutions for a Linear Multiple Objective Program
- Vector maximization at a degenerate vertex
- On some relations between a dual pair of multiple objective linear programs
- Finding all efficient extreme points for multiple objective linear programs
- Variational Analysis
- A revised simplex method for linear multiple objective programs
- Algorithms for the vector maximization problem
- Optimization with set relations: conjugate duality
- Convex Analysis
- A new approach to duality in vector optimization
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: The Attainment of the Solution of the Dual Program in Vertices for Vectorial Linear Programs
