Complexity and computability of solutions to linear programming systems

DOI10.1007/BF01417939zbMath0451.68036MaRDI QIDQ3898028

S. O. Duffuaa, Moshe Kress, A. Charnes, William W. Cooper

Publication date: 1980

Published in: International Journal of Computer & Information Sciences (Search for Journal in Brave)

zbMATH Keywords

computabilityinterval programmingnondifferentiable convex programmingellipsoidal algorithmsconstraint contraction algorithmslinear programming systems

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Convex programming (90C25) Linear programming (90C05)

Related Items (4)

On constraint sets of infinite linear programs over ordered fields ⋮ Karmarkar's projective algorithm: A null space variant for multi- commodity generalized networks ⋮ On extreme points of bounded sets of generalized finite sequence spaces ⋮ Contributions of Professor William W. Cooper in operations research and management science

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Page cuts for integer interval linear programming
• A primal algorithm for interval linear-programming problems
• A suboptimization method for interval linear programming: A new method for linear programming
• An Algorithm for Solving Interval Linear Programming Problems
• Trivial integer programs unsolvable by branch-and-bound
• An Explicit Solution of a Special Class of Linear Programming Problems
• Some Properties of Redundant Constraints and Extraneous Variables in Direct and Dual Linear Programming Problems
• Optimality and Degeneracy in Linear Programming

This page was built for publication: Complexity and computability of solutions to linear programming systems