Pages that link to "Item:Q1312760"
From MaRDI portal
The following pages link to Pivot rules for linear programming: A survey on recent theoretical developments (Q1312760):
Displaying 9 items.
- (Q5399132) (← links)
- Computational aspects of simplex and MBU-simplex algorithms using different anti-cycling pivot rules (Q5413871) (← links)
- Anstreicher–Terlaky type monotonic simplex algorithms for linear feasibility problems (Q5436927) (← links)
- Combined projected gradient algorithm for linear programming (Q5481683) (← links)
- On the Use of Duality and Pricing Criteria in the Generalized‐simplex Method (Q5689973) (← links)
- An interesting characteristic of phase-1 of dual–primal algorithm for linear programming (Q5746711) (← links)
- Pivot Rules for Circuit-Augmentation Algorithms in Linear Optimization (Q5867626) (← links)
- The Polyhedral Geometry of Pivot Rules and Monotone Paths (Q6075416) (← links)
- Revisiting degeneracy, strict feasibility, stability, in linear programming (Q6113350) (← links)