Admissible points of a convex polyhedron
From MaRDI portal
Publication:1157772
DOI10.1007/BF00935343zbMath0472.49010MaRDI QIDQ1157772
Publication date: 1982
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
multiple objective decision makingconvex polyhedronefficient pointsvector maximizationadmissible pointslinear multiple-objective programs with nonnegative criteria matrices
Existence theories for free problems in two or more independent variables (49J10) Controllability, observability, and system structure (93B99) Polytopes and polyhedra (52Bxx)
Related Items
Unnamed Item, Outcome-based algorithm for optimizing over the efficient set of a bicriteria linear programming problem, Outcome space partition of the weight set in multiobjective linear programming
Cites Work
- Unnamed Item
- Unnamed Item
- An improved definition of proper efficiency for vector maximization with respect to cones
- The set of all nondominated solutions in linear cases and a multicriteria simplex method
- Linear multiobjective programming
- Existence of efficient solutions for vector maximization problems
- The structure of admissible points with respect to cone dominance
- Proper efficiency and the theory of vector maximization
- Cone convexity, cone extreme points, and nondominated solutions in decision problems with multiobjectives
- Linear Multiple Objective Problems with Interval Coefficients
- Efficiency in multiple objective optimization problems
- Proper Efficient Points for Maximizations with Respect to Cones
- ON LINEAR VECTOR MAXIMIZATION PROBLEMS
- On Cone-Efficiency, Cone-Convexity and Cone-Compactness
- Finding all efficient extreme points for multiple objective linear programs
- Generation of the Admissible Boundary of a Convex Polytope
- A revised simplex method for linear multiple objective programs
- Algorithms for the vector maximization problem
- Technical Note—Proper Efficiency and the Linear Vector Maximum Problem
- Solving Bicriterion Mathematical Programs
- Convex Analysis
