The following pages link to (Q4716334):
Displaying 6 items.
- The complex interior-boundary method for linear and nonlinear programming with linear constraints (Q979276) (← links)
- A lower bound on the average number of pivot-steps for solving linear programs. Valid for all variants of the simplex-algorithm (Q1974584) (← links)
- An Improved Version of the Random-Facet Pivoting Rule for the Simplex Algorithm (Q2941509) (← links)
- A Family of Simplex Variants Solving an <i>m</i> × <i>d</i> Linear Program in Expected Number of Pivot Steps Depending on <i>d</i> Only (Q3755232) (← links)
- (Q4836276) (← links)
- A Sharp Upper Bound for the Expected Number of Shadow Vertices in LP-Polyhedra Under Orthogonal Projection on Two-Dimensional Planes (Q4951039) (← links)
