An Algorithm for Solving Interval Linear Programming Problems
From MaRDI portal
Publication:4165154
DOI10.1287/opre.25.4.688zbMath0384.90081OpenAlexW2162246428MaRDI QIDQ4165154
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
Related Items (11)
The Karush-Kuhn-Tucker optimality conditions in multiobjective programming problems with interval-valued objective functions ⋮ KKT optimality conditions in interval valued multiobjective programming with generalized differentiable functions ⋮ An algorithm for a least absolute value regression problem with bounds on the parameters ⋮ On interval-valued optimization problems with generalized invex functions ⋮ Solving the interval-valued optimization problems based on the concept of null set ⋮ A primal algorithm for interval linear-programming problems ⋮ A new equivalent transformation for interval inequality constraints of interval linear programming ⋮ Complexity and computability of solutions to linear programming systems ⋮ Page cuts for integer interval linear programming ⋮ Optimality conditions for interval-valued univex programming ⋮ Goal programming problems with interval coefficients and target intervals
This page was built for publication: An Algorithm for Solving Interval Linear Programming Problems
