An algorithm for bicriterion linear programming

DOI10.1016/0377-2217(82)90091-1zbMath0483.90076OpenAlexW1990545958MaRDI QIDQ1163481

Erkut Yucaoglu, Gülseren Kiziltan

Publication date: 1982

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

Full work available at URL: https://doi.org/10.1016/0377-2217(82)90091-1

zbMATH Keywords

algorithmall efficient pointsbicriterion linear programsmaximal efficient faces

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Sensitivity, stability, parametric optimization (90C31) Linear programming (90C05)

Related Items

Outcome-based algorithm for optimizing over the efficient set of a bicriteria linear programming problem ⋮ A note on solving bicriteria linear programming problems using single criteria software ⋮ Bicriteria bottleneck linear programming problem ⋮ A linear bilevel programming algorithm based on bicriteria programming ⋮ Branch-and-bound variant of an outcome-based algorithm for optimizing over the efficient set of a bicriteria linear programming problem ⋮ A parametric approach to solving bicriterion shortest path problems

Cites Work

• Linear multiobjective programming
• Vector maximization with two objective functions
• A general method for determining the set of all efficient solutions to a linear vectormaximum problem
• On the characterization of Pareto-optimal solutions in bicriterion optimization
• Multiple Objective Linear Programming with Interval Criterion Weights
• Bicriteria Transportation Problem
• An algorithm for bicriteria optimization based on the sensitivity function
• The Enumeration of the Set of All Efficient Solutions for a Linear Multiple Objective Program
• Finding all efficient extreme points for multiple objective linear programs
• Solving Bicriterion Mathematical Programs
• On a Bicriterion Formulation of the Problems of Integrated System Identification and System Optimization
• Technical Note—Parametric Solution of a Class of Nonconvex Programs