A primal algorithm for interval linear-programming problems

DOI10.1016/0024-3795(77)90042-8MaRDI QIDQ1247801zbMATH OpenOpenAlexWikidataFDO

Authors A. Charnes, Daniel Granot, Frieda Granot

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)

Cites work

• scientific article; zbMATH DE number 3175708 (Why is no real title available?)
• scientific article; zbMATH DE number 3177183 (Why is no real title available?)
• scientific article; zbMATH DE number 3477343 (Why is no real title available?)
• scientific article; zbMATH DE number 3539001 (Why is no real title available?)
• scientific article; zbMATH DE number 3080072 (Why is no real title available?)
• A Decomposition Method for Interval Linear Programming
• 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
• An interval programming algorithm for discrete linear \(L_ 1\) approximation problems
• Decomposition Principle for Linear Programs
• On the Explicit Solution of a Special Class of Linear Economic Models
• Optimality and Degeneracy in Linear Programming

Cited in

(3)

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

This page was built for publication: A primal algorithm for interval linear-programming problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1247801)