A correction to the connectedness of the evans-steuer algorithm of multiple objective linear programming

MaRDI QIDQ3070904zbMATH OpenFDO

Authors Murray Schechter, Ralph E. Steuer

Publication date 28 January 2011

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 4114407
• Further analysis of an outcome set-based algorithm for multiple-objective linear programming
• Finding all maximal efficient faces in multiobjective linear programming
• Solving multiple objective linear programs in objective space
• An outer approximation algorithm for generating all efficient extreme points in the outcome set of a multiple objective linear programming problem

Cited in

(5)

• GoNDEF: an exact method to generate all non-dominated points of multi-objective mixed-integer linear programs
• A new exact method for linear bilevel problems with multiple objective functions at the lower level
• On finding representative non-dominated points for bi-objective integer network flow problems
• Finding non-dominated solutions in bi-objective integer network flow problems
• A parametric simplex algorithm for linear vector optimization problems

Describes a project that uses

Uses Software

• ADBASE

This page was built for publication: A correction to the connectedness of the evans-steuer algorithm of multiple objective linear programming

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