A Decomposition Method for Interval Linear Programming

DOI10.1287/mnsc.16.5.374zbMath0191.48001OpenAlexW2074758924MaRDI QIDQ5585863

Adi Ben-Israel, P. D. Robers

Publication date: 1970

Published in: Management Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/mnsc.16.5.374

zbMATH Keywords

operations research

Related Items (13)

On interval-valued invex mappings and optimality conditions for interval-valued optimization problems ⋮ An algorithm for solving a structured class of linear programming problems ⋮ KKT optimality conditions in interval valued multiobjective programming with generalized differentiable functions ⋮ Duality for fractional interval-valued optimization problem via convexificator ⋮ The KKT optimality conditions in a class of generalized convex optimization problems with an interval-valued objective function ⋮ A Decomposition Method for Interval Linear Fractional Programming ⋮ Explicit solvability of dual pairs of infinite linear programs. ⋮ A primal algorithm for interval linear-programming problems ⋮ An interval programming algorithm for discrete linear \(L_ 1\) approximation problems ⋮ A suboptimization method for interval linear programming: A new method for linear programming ⋮ Sufficiency and duality in non-smooth interval valued programming problems ⋮ Enhanced-interval linear programming ⋮ Goal programming problems with interval coefficients and target intervals

This page was built for publication: A Decomposition Method for Interval Linear Programming