Algorithm for discovering the set of all the solutions of a linear programming problem
From MaRDI portal
Publication:5623505
DOI10.1016/0041-5553(68)90115-8zbMath0218.90030OpenAlexW2144494996MaRDI QIDQ5623505
Publication date: 1971
Published in: USSR Computational Mathematics and Mathematical Physics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0041-5553(68)90115-8
Related Items (18)
Algorithmic determination of immobile indices in convex SIP problems with polyhedral index sets ⋮ Efficient constraint/generator removal from double description of polyhedra ⋮ On the efficiency of convex polyhedra ⋮ Verification of Hybrid Systems ⋮ Some ways to reduce the space dimension in polyhedra computations ⋮ Convex hull of planarh-polyhedra ⋮ Automatic synthesis of switching controllers for linear hybrid systems: safety control ⋮ Symbolic analysis of linear hybrid automata -- 25 years later ⋮ Efficient Elimination of Redundancies in Polyhedra by Raytracing ⋮ Inferring Min and Max Invariants Using Max-Plus Polyhedra ⋮ PPLite: zero-overhead encoding of NNC polyhedra ⋮ The two variable per inequality abstract domain ⋮ Quantifier elimination in automatic loop parallelization ⋮ Convex SIP problems with finitely representable compact index sets: immobile indices and the properties of the auxiliary NLP problem ⋮ On a constructive approach to optimality conditions for convex SIP problems with polyhedral index sets ⋮ Exact join detection for convex polyhedra and other numerical abstractions ⋮ Which Symmetric Homogeneous Polynomials Can Be Proved Positive Semi-definite by Difference Substitution Method? ⋮ Applications of polyhedral computations to the analysis and verification of hardware and software systems
This page was built for publication: Algorithm for discovering the set of all the solutions of a linear programming problem
