Pivoting in an outcome polyhedron
From MaRDI portal
Publication:1583685
DOI10.1023/A:1008364005245zbMath1028.90023OpenAlexW60324237MaRDI QIDQ1583685
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
global optimizationlinear programmingnonlinear programmingpivotingextreme point mathematical programmingneighborhood problemoutcome polyhedron
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