A primal algorithm for interval linear-programming problems

DOI10.1016/0024-3795(77)90042-8zbMath0382.90055OpenAlexW2018958070WikidataQ114852123 ScholiaQ114852123MaRDI QIDQ1247801

Daniel Granot, Frieda Granot, A. Charnes

Publication date: 1977

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0024-3795(77)90042-8

Mathematics Subject Classification ID

Linear programming (90C05)

Related Items

A comparison of interval linear programming with the simplex method ⋮ Explicit solvability of dual pairs of infinite linear programs. ⋮ Complexity and computability of solutions to linear programming systems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• An interval programming algorithm for discrete linear \(L_ 1\) approximation problems
• A suboptimization method for interval linear programming: A new method for linear programming
• Decomposition Principle for Linear Programs
• An Algorithm for Solving Interval Linear Programming Problems
• An Explicit Solution of a Special Class of Linear Programming Problems
• A Decomposition Method for Interval Linear Programming
• On the Explicit Solution of a Special Class of Linear Economic Models
• Optimality and Degeneracy in Linear Programming