Pages that link to "Item:Q2368075"
From MaRDI portal
The following pages link to Combining phase I and phase II in a potential reduction algorithm for linear programming (Q2368075):
Displaying 6 items.
- A little theorem of the big \({\mathcal M}\) in interior point algorithms (Q687037) (← links)
- Average case complexity results for a centering algorithm for linear programming problems under Gaussian distributions (Q1002052) (← links)
- On interior algorithms for linear programming with no regularity assumptions (Q1197904) (← links)
- Potential-reduction methods in mathematical programming (Q1361104) (← links)
- An infeasible-start algorithm for linear programming whose complexity depends on the distance from the starting point to the optimal solution (Q1915904) (← links)
- A two-phase linear programming approach for redundancy allocation problems (Q4435045) (← links)
