Pages that link to "Item:Q4006909"
From MaRDI portal
The following pages link to A Dual Simplex Implementation of a Constraint Selection Algorithm for Linear Programming (Q4006909):
Displaying 8 items.
- Calibrating cross-training to meet demand mix variation and employee absence (Q320699) (← links)
- Constraint optimal selection techniques (COSTs) for nonnegative linear programming problems (Q903045) (← links)
- A computational approach to pivot selection in the LP relaxation of set problems (Q955467) (← links)
- A constraint selection technique for a class of linear programs (Q1105487) (← links)
- A sequential dual simplex algorithm for the linear assignment problem (Q1108928) (← links)
- A computationally stable solution algorithm for linear programs (Q2372034) (← links)
- Technical Note—On the Weighted Selection Algorithm for Certain Linear Programs with Nested Constraint Coefficients (Q3755226) (← links)
- A Dual Simplex Algorithm for Piecewise-Linear Programming (Q4717146) (← links)