Testing for complete efficiency in a vector maximization problem

DOI10.1007/BF01593795MaRDI QIDQ4136921zbMATH OpenFDO

Authors Mathilde Benveniste

Publication date 1977

Published in Mathematical Programming (Search for Journal in Brave)

Mathematics Subject Classification ID

Convex programming (90C25) Linear programming (90C05) Linear inequalities of matrices (15A39)

Cites work

• Algorithms for the vector maximization problem
• Finding all efficient extreme points for multiple objective linear programs
• The set of all nondominated solutions in linear cases and a multicriteria simplex method

Cited in

(6)

• On efficient sets in vector maximum problems - A brief survey
• Complete efficiency and the initialization of algorithms for multiple objective programming
• Optimization over the efficient set: Four special cases
• A geometrical analysis of the efficient outcome set in multiple objective convex programs with linear criterion functions
• A compromise procedure for the multiple objective linear fractional programming problem
• Complete efficiency and interdependencies between objective functions in vector optimization

This page was built for publication: Testing for complete efficiency in a vector maximization problem

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