Maximal descriptor set characterizations of efficient faces in multiple objective linear programming.

DOI10.1016/S0167-6377(02)00216-XzbMath1041.90051MaRDI QIDQ1413903

Jesús M. Jorge

Publication date: 17 November 2003

Published in: Operations Research Letters (Search for Journal in Brave)

zbMATH Keywords

Multiple objective linear programmingEfficient faceEfficient solutionMaximal descriptor setVector maximization

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08)

Related Items (7)

A common formula to compute the efficient sets of a class of multiple objective linear programming problems ⋮ A multiobjective based approach for mathematical programs with linear flexible constraints ⋮ Finding efficient surfaces in DEA-R models ⋮ Finding DEA-efficient hyperplanes using MOLP efficient faces ⋮ A new method for determining all maximal efficient faces in multiple objective linear programming ⋮ A bilinear algorithm for optimizing a linear function over the efficient set of a multiple objective linear programming problem ⋮ The maximal descriptor index set for a face of a convex polyhedral set and some applications

Cites Work

• Unnamed Item
• Unnamed Item
• The set of all nondominated solutions in linear cases and a multicriteria simplex method
• Generating all maximal efficient faces for multiple objective linear programs
• Finding all maximal efficient faces in multiobjective linear programming
• An algorithm based on facial decomposition for finding the efficient set in multiple objective linear programming
• Faces of a polyhedron
• The Enumeration of the Set of All Efficient Solutions for a Linear Multiple Objective Program
• A revised simplex method for linear multiple objective programs
• Equivalence in nonlinear programming

This page was built for publication: Maximal descriptor set characterizations of efficient faces in multiple objective linear programming.