A representation of an efficiency equivalent polyhedron for the objective set of a multiple objective linear program

DOI10.1016/0377-2217(93)E0247-UMaRDI QIDQ1129976zbMATHOpenAlexFDO

Authors Richard J. Gallagher, O. A. Saleh

Publication date 9 January 2000

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

Full work available at URL https://doi.org/10.1016/0377-2217(93)e0247-u

zbMATH Keywords

multiple objective linear programminglinear \(k\)-objective minimizationobjective space analysis

Mathematics Subject Classification ID

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

Recommendations

• Efficiency equivalent polyhedra for the feasible set of multiple objective linear programming
• Constructing the set of efficient objective values in multiple objective linear programs
• A representation of the set of feasible objectives in multiple objective linear programs
• Constructing the set of efficient objective values in linear multiple objective transportation problems

Cites work

• scientific article; zbMATH DE number 3524900 (Why is no real title available?)
• scientific article; zbMATH DE number 3261280 (Why is no real title available?)
• scientific article; zbMATH DE number 3308846 (Why is no real title available?)
• scientific article; zbMATH DE number 3323651 (Why is no real title available?)
• scientific article; zbMATH DE number 3345048 (Why is no real title available?)
• A Survey and Comparison of Methods for Finding All Vertices of Convex Polyhedral Sets
• A characterisation of the feasible set of objective function vectors in linear multiple objective problems
• A general method for determining the set of all efficient solutions to a linear vectormaximum problem
• A new algorithm to find all vertices of a polytope
• A representation of the set of feasible objectives in multiple objective linear programs
• A revised simplex method for linear multiple objective programs
• An analytical comparison of different formulations of the travelling salesman problem
• Analysis of the objective space in multiple objective linear programming
• Blocking and Antiblocking Polyhedra
• Computational results on an algorithm for finding all vertices of a polytope
• Constructing the set of efficient objective values in linear multiple objective transportation problems
• Constructing the set of efficient objective values in multiple objective linear programs
• Determination of the efficient set in multiobjective linear programming
• Finding all efficient extreme points for multiple objective linear programs
• Generating all maximal efficient faces for multiple objective linear programs
• Identifying Efficient Vectors: Some Theory and Computational Results
• Polarities Given by Systems of Bilinear Inequalities
• Polyhedral polarity defined by a general bilinear inequality
• The Complexity of Vertex Enumeration Methods
• 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

Cited in

(14)

• Outcome-based algorithm for optimizing over the efficient set of a bicriteria linear programming problem
• Analysis of the objective space in multiple objective linear programming
• Half-open polyblock for the representation of the search region in multiobjective optimization problems: its application and computational aspects
• Outcome space partition of the weight set in multiobjective linear programming
• ON THE PROJECTION OF THE EFFICIENT SET AND POTENTIAL APPLICATIONS
• Branch-and-bound variant of an outcome-based algorithm for optimizing over the efficient set of a bicriteria linear programming problem
• scientific article; zbMATH DE number 7312765 (Why is no real title available?)
• On degeneracy and collapsing in the construction of the set of objective values in a multiple objective linear program
• A combined constraint-space, objective-space approach for determining high-dimensional maximal efficient faces of multiple objective linear programs
• Hybrid approach for solving multiple-objective linear programs in outcome space
• Efficient solution generation for multiple objective linear programming based on extreme ray generation method
• Constructing efficient solutions structure of multiobjective linear programming
• Efficiency equivalent polyhedra for the feasible set of multiple objective linear programming
• A representation of the set of feasible objectives in multiple objective linear programs

Describes a project that uses

Uses Software

• ADBASE
• EFFACET

This page was built for publication: A representation of an efficiency equivalent polyhedron for the objective set of a multiple objective linear program

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