An Algorithm for Solving Interval Linear Programming Problems
From MaRDI portal
Cited in
(13)- An algorithm for a least absolute value regression problem with bounds on the parameters
- A primal algorithm for interval linear-programming problems
- Solving the interval-valued optimization problems based on the concept of null set
- A new equivalent transformation for interval inequality constraints of interval linear programming
- Optimality conditions for interval-valued univex programming
- The Karush-Kuhn-Tucker optimality conditions in multiobjective programming problems with interval-valued objective functions
- On interval-valued optimization problems with generalized invex functions
- KKT optimality conditions in interval valued multiobjective programming with generalized differentiable functions
- Complexity and computability of solutions to linear programming systems
- On optimal control problems with generalized invariant convex interval-valued functionals
- A new approach for solving multi-objective interval-valued variational problems and its applications
- Page cuts for integer interval linear programming
- Goal programming problems with interval coefficients and target intervals
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)
