Approximating the noninferior set in multiobjective linear programming problems

DOI10.1016/0377-2217(93)90192-PMaRDI QIDQ1309915zbMATH OpenFDO

Authors 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

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

Recommendations

• Approximating the noninferior set in linear biobjective programs using multiparametric decomposition
• An approximation algorithm for convex multi-objective programming problems
• Approximation methods in multiobjective programming
• An outer approximation algorithm for generating all efficient extreme points in the outcome set of a multiple objective linear programming problem
• An approximation to the nondominated set of a multiobjective linear fractional programming problem

Cites work

• scientific article; zbMATH DE number 3833720 (Why is no real title available?)
• scientific article; zbMATH DE number 4085440 (Why is no real title available?)
• scientific article; zbMATH DE number 43279 (Why is no real title available?)
• A general method for determining the set of all efficient solutions to a linear vectormaximum problem
• A revised simplex method for linear multiple objective programs
• Algorithms for the vector maximization problem
• Approximating the noninferior set in linear biobjective programs using multiparametric decomposition
• Computational experience concerning payoff tables and minimum criterion values over the efficient set
• Generating all maximal efficient faces for multiple objective linear programs
• Multiobjective programming and planning
• Multiple Objective Linear Programming with Interval Criterion Weights
• Multiple-criteria decision making. Concepts, techniques, and extensions. With the assistance of Yoon-Ro Lee and Antonie Stam
• Proper efficiency and the theory of vector maximization
• Technical Note—Proper Efficiency and the Linear Vector Maximum Problem
• The Enumeration of the Set of All Efficient Solutions for a Linear Multiple Objective Program
• The set of all nondominated solutions in linear cases and a multicriteria simplex method
• Vektormaximumproblem und parametrische optimierung

Cited in

(12)

• Computation of ideal and Nadir values and implications for their use in MCDM methods.
• An extension of the non-inferior set estimation algorithm for many objectives
• Approximating the nondominated set of an MOLP by approximately solving its dual problem
• Bicriteria network location (BNL) problems with criteria dependent lengths and minisum objectives
• scientific article; zbMATH DE number 5630417 (Why is no real title available?)
• Multi-objective optimization of long-run average and total rewards
• An approximation to the nondominated set of a multiobjective linear fractional programming problem
• Approximating the noninferior set in linear biobjective programs using multiparametric decomposition
• Bounds on efficient outcomes for large-scale cardinality-constrained Markowitz problems
• Approximation methods in multiobjective programming
• Regional economic impacts of fish resources utilization from the Barents Sea: Trade-offs between economic rent, employment and income
• Solving biobjective combinatorial max-ordering problems by ranking methods and a two-phases approach

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1309915)