Approximating the noninferior set in multiobjective linear programming problems

DOI10.1016/0377-2217(93)90192-PzbMath0782.90084MaRDI QIDQ1309915

Rajendra S. Solanki, Perry A. Appino, Jared L. Cohon

Publication date: 20 December 1993

Published in: European Journal of Operational Research (Search for Journal in Brave)

zbMATH Keywords

multiobjective linear programmingconvex hull of the extreme pointsgeometrical approximation

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Linear programming (90C05)

Related Items (8)

Solving biobjective combinatorial max-ordering problems by ranking methods and a two-phases approach ⋮ Bicriteria network location (BNL) problems with criteria dependent lengths and minisum objectives ⋮ Computation of ideal and Nadir values and implications for their use in MCDM methods. ⋮ Regional economic impacts of fish resources utilization from the Barents Sea: Trade-offs between economic rent, employment and income ⋮ Multi-objective optimization of long-run average and total rewards ⋮ Bounds on efficient outcomes for large-scale cardinality-constrained Markowitz problems ⋮ An extension of the non-inferior set estimation algorithm for many objectives ⋮ Approximation methods in multiobjective programming

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Computational experience concerning payoff tables and minimum criterion values over the efficient set
• Multiple-criteria decision making. Concepts, techniques, and extensions. With the assistance of Yoon-Ro Lee and Antonie Stam
• Multiobjective programming and planning
• 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
• Approximating the noninferior set in linear biobjective programs using multiparametric decomposition
• Proper efficiency and the theory of vector maximization
• Multiple Objective Linear Programming with Interval Criterion Weights
• The Enumeration of the Set of All Efficient Solutions for a Linear Multiple Objective Program
• Vektormaximumproblem und parametrische optimierung
• 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

This page was built for publication: Approximating the noninferior set in multiobjective linear programming problems