An Algorithm for Solving Interval Linear Programming Problems

DOI10.1287/OPRE.25.4.688MaRDI QIDQ4165154zbMATH OpenOpenAlexFDO

Authors A. Charnes, Frieda Granot, Fred Y. Phillips

Publication date 1977

Published in Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1287/opre.25.4.688

Mathematics Subject Classification ID

Linear programming (90C05)

Cited in

(12)

• Complexity and computability of solutions to linear programming systems
• A new equivalent transformation for interval inequality constraints of interval linear programming
• On optimal control problems with generalized invariant convex interval-valued functionals
• An algorithm for a least absolute value regression problem with bounds on the parameters
• Goal programming problems with interval coefficients and target intervals
• KKT optimality conditions in interval valued multiobjective programming with generalized differentiable functions
• A primal algorithm for interval linear-programming problems
• The Karush-Kuhn-Tucker optimality conditions in multiobjective programming problems with interval-valued objective functions
• Page cuts for integer interval linear programming
• On interval-valued optimization problems with generalized invex functions
• Optimality conditions for interval-valued univex programming
• Solving the interval-valued optimization problems based on the concept of null set

This page was built for publication: An Algorithm for Solving Interval Linear Programming Problems

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