The following pages link to Pivoting in an outcome polyhedron (Q1583685):
Displaying 3 items.
- Adjacency based method for generating maximal efficient faces in multiobjective linear programming (Q345543) (← links)
- A weight set decomposition algorithm for finding all efficient extreme points in the outcome set of a multiple objective linear program (Q1600950) (← links)
- A new semidefinite relaxation for \(L_{1}\)-constrained quadratic (Q2353474) (← links)