Complexity and computability of solutions to linear programming systems
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 3175708 (Why is no real title available?)
- scientific article; zbMATH DE number 3619622 (Why is no real title available?)
- scientific article; zbMATH DE number 3248677 (Why is no real title available?)
- 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
- An Explicit Solution of a Special Class of Linear Programming Problems
- Optimality and Degeneracy in Linear Programming
- Page cuts for integer interval linear programming
- Some Properties of Redundant Constraints and Extraneous Variables in Direct and Dual Linear Programming Problems
- Trivial integer programs unsolvable by branch-and-bound
Cited in
(4)- Karmarkar's projective algorithm: A null space variant for multi- commodity generalized networks
- Contributions of Professor William W. Cooper in operations research and management science
- On extreme points of bounded sets of generalized finite sequence spaces
- On constraint sets of infinite linear programs over ordered fields
This page was built for publication: Complexity and computability of solutions to linear programming systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3898028)
