The following pages link to (Q5828400):
Displaying 11 items.
- Investigation of the structure of binary variables (Q750057) (← links)
- A dual projective simplex method for linear programming (Q1129474) (← links)
- Newton's method for convex programming and Tschebyscheff approximation (Q1131571) (← links)
- The most-obtuse-angle row pivot rule for achieving dual feasibility: A computational study (Q1278948) (← links)
- New techniques for linear arithmetic: cubes and equalities (Q1688532) (← links)
- An exploratory computational analysis of dual degeneracy in mixed-integer programming (Q2219511) (← links)
- A suboptimization method for interval linear programming: A new method for linear programming (Q2545859) (← links)
- Lineare Programme (Q3238816) (← links)
- On stochastic linear inequalities (Q3274488) (← links)
- Ein lineares Programmierungsverfahren (Q3290209) (← links)
- A note on a modified primal‐dual algorithm to speed convergence in solving linear programs (Q5563764) (← links)
