Pivoting in an outcome polyhedron

DOI10.1023/A:1008364005245zbMATH Open1028.90023OpenAlexW60324237MaRDI QIDQ1583685FDOQ1583685

Authors: Harold P. Benson, Erjiang Sun 

Publication date: 27 January 2004

Published in: Journal of Global Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1008364005245

Recommendations

• Optimizing a linear function over an efficient set
• An outer approximation algorithm for generating all efficient extreme points in the outcome set of a multiple objective linear programming problem
• The generalized simplex method
• scientific article
• scientific article; zbMATH DE number 912372

zbMATH Keywords

linear programmingpivotingglobal optimizationnonlinear programmingextreme point mathematical programmingneighborhood problemoutcome polyhedron

Mathematics Subject Classification ID

Linear programming (90C05) Nonconvex programming, global optimization (90C26)

Cited In (3)

• A new semidefinite relaxation for \(L_{1}\)-constrained quadratic
• A weight set decomposition algorithm for finding all efficient extreme points in the outcome set of a multiple objective linear program
• Adjacency based method for generating maximal efficient faces in multiobjective linear programming

This page was built for publication: Pivoting in an outcome polyhedron

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