Biobjective programming in optimization of interval linear programming
From MaRDI portal
Recommendations
- Linear programming with interval arithmetic
- Linear programming with interval data: a two-level programming approach
- Multiple objective linear programming models with interval coefficients -- an illustrated overview
- Solving multiobjective linear programming problem using interval arithmetic
- An interactive method of tackling uncertainty in interval multiple objective linear programming
Cited in
(14)- Nonlinear biobjective optimization: improvements to interval branch \& bound algorithms
- Multiple objective linear programming models with interval coefficients -- an illustrated overview
- The interval task of linear programming
- Enhanced-interval linear programming
- An interactive method of tackling uncertainty in interval multiple objective linear programming
- Solving multiobjective linear programming problem using interval arithmetic
- An enumerative algorithm for computing all possibly optimal solutions to an interval LP
- Best and Worst Optimum for Linear Programs with Interval Right Hand Sides
- Nonlinear biobjective optimization: improving the upper envelope using feasible line segments
- Linear programming with interval data: a two-level programming approach
- Branch-and-Bound for Biobjective Mixed-Integer Linear Programming
- Linear programming with interval arithmetic
- An interactive approach for biobjective integer programs under quasiconvex preference functions
- A novel approach in uncertain programming. II: A class of constrained nonlinear programming problems with interval objective functions
This page was built for publication: Biobjective programming in optimization of interval linear programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3073824)
