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

DOI10.1080/02331934.2014.926357zbMath1327.90293OpenAlexW2022063620MaRDI QIDQ3454856

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

multiple objective programmingmaximal efficient facesefficient basic set

Mathematics Subject Classification ID

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

Related Items (2)

Minimal representations of a face of a convex polyhedron and some applications ⋮ A new method for determining all maximal efficient faces in multiple objective linear programming

Cites Work

• Determining maximal efficient faces in multiobjective linear programming problem
• A problem in enumerating extreme points, and an efficient algorithm for one class of polytopes
• The set of all nondominated solutions in linear cases and a multicriteria simplex method
• Theorems on the dimensions of convex sets
• 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
• Finding all maximal efficient faces in multiobjective linear programming
• Determination of the efficient set in multiobjective linear programming
• 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
• Analysis of backtrack algorithms for listing all vertices and all faces of a convex polyhedron.
• Finding all vertices of a convex polyhedron
• An algorithm based on facial decomposition for finding the efficient set in multiple objective linear programming
• An Algorithm for Finding All Vertices of Convex Polyhedral Sets
• A Survey and Comparison of Methods for Finding All Vertices of Convex Polyhedral Sets
• The Enumeration of the Set of All Efficient Solutions for a Linear Multiple Objective Program
• An algorithm for determining all extreme points of a convex polytope
• Algorithm for finding a general formula for the non-negative solutions of a system of linear inequalities
• An Algorithm for Determining Irrelevant Constraints and all Vertices in Systems of Linear Inequalities

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