Complexity and computability of solutions to linear programming systems
- 1 December 1980
- journal article
- Published by Springer Nature in International Journal of Parallel Programming
- Vol. 9 (6), 483-506
- https://doi.org/10.1007/bf01417939
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- Representation of Convex SetsPublished by Springer Nature ,1980
- Page cuts for integer interval linear programmingDiscrete Applied Mathematics, 1979
- An Algorithm for Solving Interval Linear Programming ProblemsOperations Research, 1977
- A primal algorithm for interval linear-programming problemsLinear Algebra and its Applications, 1977
- Past, present and future of large scale transshipment computer codes and applicationsComputers & Operations Research, 1975
- Trivial integer programs unsolvable by branch-and-boundMathematical Programming, 1974
- An Explicit Solution of a Special Class of Linear Programming ProblemsOperations Research, 1968
- A Primal Method for the Assignment and Transportation ProblemsManagement Science, 1964
- Some Properties of Redundant Constraints and Extraneous Variables in Direct and Dual Linear Programming ProblemsOperations Research, 1962
- Optimality and Degeneracy in Linear ProgrammingEconometrica, 1952