Pages that link to "Item:Q3979523"
From MaRDI portal
The following pages link to A simplex-like method with bisection for linear programming<sup>1</sup> (Q3979523):
Displaying 13 items.
- A regularized simplex method (Q302140) (← links)
- Constraint optimal selection techniques (COSTs) for nonnegative linear programming problems (Q903045) (← links)
- A dual projective simplex method for linear programming (Q1129474) (← links)
- A phase-1 approach for the generalized simplex algorithm (Q1612514) (← links)
- A basis-defiency-allowing variation of the simplex method for linear programming (Q1806578) (← links)
- A note on two direct methods in linear programming (Q1827666) (← links)
- A projective simplex algorithm using LU decomposition (Q1975340) (← links)
- A variant of the dual face algorithm using Gauss-Jordan elimination for linear programming (Q2014048) (← links)
- An affine-scaling pivot algorithm for linear programming (Q2841137) (← links)
- Markov decision processes for infinite horizon problems solved with the cosine simplex method (Q3165917) (← links)
- A Variant of the Dual Pivoting Rule in Linear Programming (Q4321114) (← links)
- A comprehensive simplex-like algorithm for network optimization and perturbation analysis (Q4764598) (← links)
- (Q4888222) (← links)