The dual simplex algorithm for bounded variables
- 1 September 1958
- journal article
- research article
- Published by Wiley in Naval Research Logistics Quarterly
- Vol. 5 (3) , 257-261
- https://doi.org/10.1002/nav.3800050306
Abstract
No abstract availableThis publication has 10 references indexed in Scilit:
- A Comparison of the Original and Revised Simplex MethodsOperations Research, 1957
- A Linear Programming Solution to Dynamic Leontief type ModelsManagement Science, 1957
- On the Solution of Discrete Programming ProblemsEconometrica, 1957
- Nonlinear Power of Adjacent Extreme Point Methods in Linear ProgrammingEconometrica, 1957
- A Two-Phase Method for the Simplex TableauOperations Research, 1956
- Recent Advances in Linear ProgrammingManagement Science, 1956
- Cycling in the dual simplex algorithmNaval Research Logistics Quarterly, 1955
- Upper Bounds, Secondary Constraints, and Block Triangularity in Linear ProgrammingEconometrica, 1955
- Minimization of non‐linear separable convex functionalsNaval Research Logistics Quarterly, 1954
- The dual method of solving the linear programming problemNaval Research Logistics Quarterly, 1954