Testing for complete efficiency in a vector maximization problem

DOI10.1007/BF01593795zbMath0362.90057MaRDI QIDQ4136921

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)

Related Items (6)

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

Cites Work

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

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