A common formula to compute the efficient sets of a class of multiple objective linear programming problems

DOI10.1080/02331934.2014.926357MaRDI QIDQ3454856zbMATH OpenOpenAlexFDO

Authors Ta Van Tu

Publication date 27 November 2015

Published in Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/02331934.2014.926357

zbMATH Keywords

efficient basic setmaximal efficient facesmultiple objective programming

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Applications of mathematical programming (90C90)

Recommendations

• Determination of the efficient set in multiobjective linear programming
• A new method for determining all maximal efficient faces in multiple objective linear programming
• Optimization over the efficient set of a parametric multiple objective linear programming problem
• Constructing the set of efficient objective values in multiple objective linear programs
• Optimizing a linear function over an efficient set

Cites work

• A general method for determining the set of all efficient solutions to a linear vectormaximum problem
• A problem in enumerating extreme points, and an efficient algorithm for one class of polytopes
• A Survey and Comparison of Methods for Finding All Vertices of Convex Polyhedral Sets
• Algorithm for finding a general formula for the non-negative solutions of a system of linear inequalities
• An algorithm based on facial decomposition for finding the efficient set in multiple objective linear programming
• An algorithm for determining all extreme points of a convex polytope
• An Algorithm for Determining Irrelevant Constraints and all Vertices in Systems of Linear Inequalities
• An Algorithm for Finding All Vertices of Convex Polyhedral Sets
• Analysis of backtrack algorithms for listing all vertices and all faces of a convex polyhedron.
• Determination of the efficient set in multiobjective linear programming
• Determining maximal efficient faces in multiobjective linear programming problem
• Finding all maximal efficient faces in multiobjective linear programming
• Finding all vertices of a convex polyhedron
• Generating all maximal efficient faces for multiple objective linear programs
• Maximal descriptor set characterizations of efficient faces in multiple objective linear programming.
• Optimization over the efficient set of a parametric multiple objective linear programming 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
• Theorems on the dimensions of convex sets

Cited in

(7)

• A class of optimization problems over the efficient set of a multiple criteria nonlinear programming problem
• Minimal representations of a face of a convex polyhedron and some applications
• Bounding MOLP objective functions: effect on efficient set size
• On optimization over the efficient set of a multiple objective linear programming problem
• A new method for determining all maximal efficient faces in multiple objective linear programming
• A method to find all efficient solutions of an interval multiple objective linear programming problem
• Constructing the set of efficient objective values in multiple objective linear programs

This page was built for publication: A common formula to compute the efficient sets of a class of multiple objective linear programming problems

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