Efficiency equivalent polyhedra for the feasible set of multiple objective linear programming

MaRDI QIDQ700265zbMATH OpenFDO

Authors Nguyen Thi Bach Kim

Publication date 23 November 2003

Published in Acta Mathematica Vietnamica (Search for Journal in Brave)

zbMATH Keywords

efficiency equivalentextreme efficient pointmultiobjective linear programmingouter approximation

Mathematics Subject Classification ID

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

Review text

The author studies a multiobjective programming problem in which the ordering cone induced by criteria functions is pointed and has a nonempty interior. An outer approximation algorithm is proposed for determining all extreme points and constructing efficiency equivalent polyhedron whose data size is, normally, smaller than that of the original set.

Recommendations

• A representation of an efficiency equivalent polyhedron for the objective set of a multiple objective linear program
• Publication:4205245
• Determination of the efficient set in multiobjective linear programming
• ON THE PROJECTION OF THE EFFICIENT SET AND POTENTIAL APPLICATIONS
• An approach for finding efficient points in multiobjective linear programming

Cited in

(5)

• A representation of an efficiency equivalent polyhedron for the objective set of a multiple objective linear program
• Complete efficiency and the initialization of algorithms for multiple objective programming
• Maximal descriptor set characterizations of efficient faces in multiple objective linear programming.
• ON THE PROJECTION OF THE EFFICIENT SET AND POTENTIAL APPLICATIONS
• scientific article; zbMATH DE number 4197737 (Why is no real title available?)

This page was built for publication: Efficiency equivalent polyhedra for the feasible set of multiple objective linear programming

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