A suboptimization method for interval linear programming: A new method for linear programming

DOI10.1016/0024-3795(70)90008-XzbMath0215.58806WikidataQ114852134 ScholiaQ114852134MaRDI QIDQ2545859

Adi Ben-Israel, P. D. Robers

Publication date: 1970

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

Mathematics Subject Classification ID

Linear programming (90C05)

Related Items (13)

An iterative row-action method for interval convex programming ⋮ A comparison of interval linear programming with the simplex method ⋮ A Decomposition Method for Interval Linear Fractional Programming ⋮ Explicit solvability of dual pairs of infinite linear programs. ⋮ Solving constrained matrix games with payoffs of triangular fuzzy numbers ⋮ Existence and representation of Diophantine and mixed Diophantine solutions to linear equations and inequalities ⋮ A primal algorithm for interval linear-programming problems ⋮ Complexity and computability of solutions to linear programming systems ⋮ Page cuts for integer interval linear programming ⋮ On explicit solutions of interval programs ⋮ An interval programming algorithm for discrete linear \(L_ 1\) approximation problems ⋮ Techniques of linear programming based on the theory of convex cones ⋮ A new LAD curve-fitting algorithm: Slightly overdetermined equation systems in \(L_ 1\)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Generalized upper bounding techniques
• Virtual work, linear programming and plastic limit analysis
• An Explicit Solution of a Special Class of Linear Programming Problems
• A Decomposition Method for Interval Linear Programming
• Technical Note—Explicit Solutions of Interval Linear Programs
• Optimality and Degeneracy in Linear Programming
• Upper Bounds, Secondary Constraints, and Block Triangularity in Linear Programming

This page was built for publication: A suboptimization method for interval linear programming: A new method for linear programming