Pages that link to "Item:Q5585863"
From MaRDI portal
The following pages link to A Decomposition Method for Interval Linear Programming (Q5585863):
Displaying 14 items.
- On interval-valued invex mappings and optimality conditions for interval-valued optimization problems (Q264512) (← links)
- KKT optimality conditions in interval valued multiobjective programming with generalized differentiable functions (Q323282) (← links)
- Goal programming problems with interval coefficients and target intervals (Q811359) (← links)
- Enhanced-interval linear programming (Q1042144) (← links)
- An algorithm for solving a structured class of linear programming problems (Q1078069) (← links)
- A primal algorithm for interval linear-programming problems (Q1247801) (← links)
- Sufficiency and duality in non-smooth interval valued programming problems (Q2313756) (← links)
- The KKT optimality conditions in a class of generalized convex optimization problems with an interval-valued objective function (Q2448142) (← links)
- Explicit solvability of dual pairs of infinite linear programs. (Q2476435) (← links)
- An interval programming algorithm for discrete linear \(L_ 1\) approximation problems (Q2544339) (← links)
- A suboptimization method for interval linear programming: A new method for linear programming (Q2545859) (← links)
- A Decomposition Method for Interval Linear Fractional Programming (Q4086979) (← links)
- Duality for fractional interval-valued optimization problem via convexificator (Q6105961) (← links)
- On the partial calmness condition for an interval-valued bilevel optimization problem (Q6632163) (← links)
