Pivoting in an outcome polyhedron

DOI10.1023/A:1008364005245zbMath1028.90023OpenAlexW60324237MaRDI QIDQ1583685

Erjiang Sun, Harold P. Benson

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

zbMATH Keywords

global optimizationlinear programmingnonlinear programmingpivotingextreme point mathematical programmingneighborhood problemoutcome polyhedron

Mathematics Subject Classification ID

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

Related Items

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