A Decomposition Method for Interval Linear Programming
From MaRDI portal
Publication:5585863
Cited in
(14)- On interval-valued invex mappings and optimality conditions for interval-valued optimization problems
- An interval programming algorithm for discrete linear \(L_ 1\) approximation problems
- Enhanced-interval linear programming
- Sufficiency and duality in non-smooth interval valued programming problems
- An algorithm for solving a structured class of linear programming problems
- Duality for fractional interval-valued optimization problem via convexificator
- 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
- A suboptimization method for interval linear programming: A new method for linear programming
- The KKT optimality conditions in a class of generalized convex optimization problems with an interval-valued objective function
- On the partial calmness condition for an interval-valued bilevel optimization problem
- Explicit solvability of dual pairs of infinite linear programs.
- A Decomposition Method for Interval Linear Fractional Programming
This page was built for publication: A Decomposition Method for Interval Linear Programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5585863)
