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

DOI10.1016/0377-2217(93)E0247-UzbMATH Open0928.90080OpenAlexW2095537371MaRDI QIDQ1129976FDOQ1129976

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

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

zbMATH Keywords

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

Mathematics Subject Classification ID

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

Cites Work

• An analytical comparison of different formulations of the travelling salesman problem
• Title not available (Why is that?)
• Finding all efficient extreme points for multiple objective linear programs
• A revised simplex method for linear multiple objective programs
• Title not available (Why is that?)
• Title not available (Why is that?)
• The Enumeration of the Set of All Efficient Solutions for a Linear Multiple Objective Program
• Analysis of the objective space in multiple objective linear programming
• 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
• Determination of the efficient set in multiobjective linear programming
• A Survey and Comparison of Methods for Finding All Vertices of Convex Polyhedral Sets
• Constructing the set of efficient objective values in multiple objective linear programs
• Identifying Efficient Vectors: Some Theory and Computational Results
• Title not available (Why is that?)
• The Complexity of Vertex Enumeration Methods
• A characterisation of the feasible set of objective function vectors in linear multiple objective problems
• 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
• Polarities Given by Systems of Bilinear Inequalities
• Polyhedral polarity defined by a general bilinear inequality
• Computational results on an algorithm for finding all vertices of a polytope
• A new algorithm to find all vertices of a polytope
• Title not available (Why is that?)
• Blocking and Antiblocking Polyhedra

Cited In (14)

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

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)