A general method for determining the set of all efficient solutions to a linear vectormaximum problem

DOI10.1016/0377-2217(77)90063-7zbMath0374.90044OpenAlexW1972695578MaRDI QIDQ1245073

Tomas Gal

Publication date: 1977

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

Full work available at URL: https://doi.org/10.1016/0377-2217(77)90063-7

Mathematics Subject Classification ID

Linear programming (90C05)

Related Items (65)

Multiobjective mathematical programming via the MULTIPLEX model and algorithm ⋮ An algorithm for optimizing over the weakly-efficient set ⋮ Random problem genertion and the computation of efficient extreme points in multiple objective linear programming ⋮ Interactive scheme for a MOLP problem given two partial orders: One on variables and one on objectives ⋮ Computational experience concerning payoff tables and minimum criterion values over the efficient set ⋮ A common formula to compute the efficient sets of a class of multiple objective linear programming problems ⋮ ON THE PROJECTION OF THE EFFICIENT SET AND POTENTIAL APPLICATIONS ⋮ Adjacency based method for generating maximal efficient faces in multiobjective linear programming ⋮ SOLVING A SPECIAL CLASS OF MULTIPLE OBJECTIVE LINEAR FRACTIONAL PROGRAMMING PROBLEMS ⋮ A binary integer linear program with multi-criteria and multi-constraint levels ⋮ A method for finding well-dispersed subsets of non-dominated vectors for multiple objective mixed integer linear programs ⋮ Distributional efficiency in multiobjective stochastic linear programming ⋮ A representation of an efficiency equivalent polyhedron for the objective set of a multiple objective linear program ⋮ Strukturierung von Entscheidungsprozessen bei mehrfacher Zielsetzung ⋮ Linear programming with partial information ⋮ Zielgewichtungskompromisse für lineare Programme mit mehrfacher Zielsetzung ⋮ Bicriteria linear fractional programming ⋮ Relaxation analysis in linear vectorvalued maximization ⋮ An algorithm for bicriterion linear programming ⋮ Bicriteria network flow problems: Continuous case ⋮ Applications of the parametric programming procedure ⋮ A simplified MOLP algorithm: The MOLP-S procedure ⋮ Optimization over the efficient set ⋮ Solving discrete multiobjective optimization problems based on approximation. ⋮ A new method for determining all maximal efficient faces in multiple objective linear programming ⋮ A new interactive algorithm for multiobjective linear programming using maximally changeable dominance cone ⋮ Efficient solutions for the bicriteria network flow problem ⋮ Uniform convergence and Pareto optimality ⋮ The range of the efficient frontier in multiple objective linear programming ⋮ A regression study of the number of efficient extreme points in multiple objective linear programming ⋮ Multiple objective programming with piecewise linear functions ⋮ An approach for finding efficient points in multiobjective linear programming ⋮ A transportation model with multiple criteria and multiple constraint levels ⋮ An exact penalty on bilevel programs with linear vector optimization lower level ⋮ On the convergence of multiobjective evolutionary algorithms ⋮ Multi-objective modeling for engineering applications: DIDASN++ system ⋮ Further analysis of an outcome set-based algorithm for multiple-objective linear programming ⋮ Hybrid approach for solving multiple-objective linear programs in outcome space ⋮ A combined constraint-space, objective-space approach for determining high-dimensional maximal efficient faces of multiple objective linear programs ⋮ A Method for Generating a Well-Distributed Pareto Set in Multiple Objective Mixed Integer Linear Programs Based on the Decision Maker’s Initial Aspiration Level ⋮ Approaches to sensitivity analysis in linear programming ⋮ A compromise procedure for the multiple objective linear fractional programming problem ⋮ A reduction algorithm for integer multiple objective linear programs ⋮ The Attainment of the Solution of the Dual Program in Vertices for Vectorial Linear Programs ⋮ Discussion and modification of the Fandel-method solving linear vector maximum problems ⋮ Optimization over the efficient set of a parametric multiple objective linear programming problem ⋮ On the computation of all supported efficient solutions in multi-objective integer network flow problems ⋮ Vector linear programming in zero-sum multicriteria matrix games ⋮ An algorithm based on facial decomposition for finding the efficient set in multiple objective linear programming ⋮ Outcome space partition of the weight set in multiobjective linear programming ⋮ Optimization of a linear function on the set of efficient solutions of a multicriterion convex quadratic problem ⋮ A graphical subroutine for multiobjective linear programming ⋮ On the structure of the set bases of a degenerate point ⋮ New closedness results for efficient sets in multiple objective mathematical programming ⋮ Approximating the noninferior set in multiobjective linear programming problems ⋮ The maximal descriptor index set for a face of a convex polyhedral set and some applications ⋮ Selected bibliography on degeneracy ⋮ On degeneracy and collapsing in the construction of the set of objective values in a multiple objective linear program ⋮ Finding all maximal efficient faces in multiobjective linear programming ⋮ On efficient sets in vector maximum problems - A brief survey ⋮ Fuzzy potential solutions in multi-criteria and multi-constraint level linear programming problems ⋮ Determination of the efficient set in multiobjective linear programming ⋮ An algorithm for systems welfare interactive goal programming modelling ⋮ Stability in vector maximization - a survey ⋮ Analysis of multicriteria decision aid in Europe

Cites Work

• Unnamed Item
• Relaxation analysis in linear vectorvalued maximization
• Linear multiobjective programming
• Generating all maximal efficient faces for multiple objective linear programs
• Proper efficiency and the theory of vector maximization
• Zur Identifikation redundanter Nebenbedingungen in linearen Programmen
• 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
• Vektormaximumproblem und parametrische optimierung
• A revised simplex method for linear multiple objective programs
• Algorithms for the vector maximization problem
• Techniques for Removing Nonbinding Constraints and Extraneous Variables from Linear Programming Problems
• Sensitivitätsanalysen und parametrische Programmierung
• Multiparametric Linear Programming
• Homogene mehrparametrische lineare Programmierung

This page was built for publication: A general method for determining the set of all efficient solutions to a linear vectormaximum problem