An interactive interior point algorithm for multiobjective linear programming problems
From MaRDI portal
Publication:1604044
DOI10.1016/S0167-6377(01)00089-XzbMath0993.90081MaRDI QIDQ1604044
T. Ouaderhman, Brahim Aghezzaf
Publication date: 3 July 2002
Published in: Operations Research Letters (Search for Journal in Brave)
Related Items (3)
Solving scalarized multi-objective network flow problems using an interior point method ⋮ An interactive satisficing method based on alternative tolerance for fuzzy multiple objective optimization ⋮ An interactive interior point algorithm for multiobjective linear programming problems
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An interactive method for multiple-objective mathematical programming problems
- An algorithm for linear programming which requires \(O(((m+n)n^ 2+(m+n)^{1.5}n)L)\) arithmetic operations
- A polynomial-time algorithm, based on Newton's method, for linear programming
- Using aspiration levels in an interactive interior multiobjective linear programming algorithm
- Using approximate gradients in developing an interactive interior primal-dual multiobjective linear programming algorithm
- An interactive interior point algorithm for multiobjective linear programming problems
- A Convergent Interactive Cutting-Plane Algorithm for Multiobjective Optimization
- Path-Following Methods for Linear Programming
- Anchoring Points and Cones of Opportunities in Interior Multiobjective Linear Programming
- An interior multiobjective primal-dual linear programming algorithm using approximated gradients and sequential generation of anchor points
- Generating interior search directions for multiobjective linear programming
- An Interactive Approach for Multi-Criterion Optimization, with an Application to the Operation of an Academic Department
This page was built for publication: An interactive interior point algorithm for multiobjective linear programming problems
