Optimization over the efficient set of a parametric multiple objective linear programming problem
From MaRDI portal
Publication:1577111
DOI10.1016/S0377-2217(99)00095-8zbMath0961.90105MaRDI QIDQ1577111
Publication date: 30 August 2000
Published in: European Journal of Operational Research (Search for Journal in Brave)
Multi-objective and goal programming (90C29) Sensitivity, stability, parametric optimization (90C31) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08)
Related Items (9)
A common formula to compute the efficient sets of a class of multiple objective linear programming problems ⋮ A multiobjective based approach for mathematical programs with linear flexible constraints ⋮ Minimal representations of a face of a convex polyhedron and some applications ⋮ Efficient curve fitting: an application of multiobjective programming ⋮ Optimal and strongly optimal solutions for linear programming models with variable parameters ⋮ A new method for determining all maximal efficient faces in multiple objective linear programming ⋮ Determining maximal efficient faces in multiobjective linear programming problem ⋮ Bilevel Optimization: Theory, Algorithms, Applications and a Bibliography ⋮ The maximal descriptor index set for a face of a convex polyhedral set and some applications
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Minimization of a quasi-concave function over an efficient set
- Careful usage of pessimistic values is needed in multiple objectives optimization
- An algorithm for optimizing over the weakly-efficient set
- Computational experience concerning payoff tables and minimum criterion values over the efficient set
- An all-linear programming relaxation algorithm for optimizing over the efficient set
- The set of all nondominated solutions in linear cases and a multicriteria simplex method
- 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
- The maximization of a function over the efficient set via a penalty function approach
- A finite, nonadjacent extreme-point search algorithm for optimization over the efficient set
- Optimization over the efficient set: Four special cases
- Utility function programs and optimization over the efficient set in multiple-objective decision making
- Outcome-based algorithm for optimizing over the efficient set of a bicriteria linear programming problem
- Finding all vertices of a convex polyhedron
- Optimization over the efficient set using an active constraint approach
- A Survey and Comparison of Methods for Finding All Vertices of Convex Polyhedral Sets
- Finding an Initial Efficient Extreme Point for a Linear Multiple Objective Program
- The Enumeration of the Set of All Efficient Solutions for a Linear Multiple Objective Program
- On Computing an Initial Efficient Extreme Point
- Finding all efficient extreme points for multiple objective linear programs
- A revised simplex method for linear multiple objective programs
- Algorithms for the vector maximization problem
- Optimization over the efficient set
- Optimization over the efficient set
This page was built for publication: Optimization over the efficient set of a parametric multiple objective linear programming problem
