An interactive interior point algorithm for multiobjective linear programming problems
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3833720 (Why is no real title available?)
- scientific article; zbMATH DE number 51430 (Why is no real title available?)
- scientific article; zbMATH DE number 4197737 (Why is no real title available?)
- A Convergent Interactive Cutting-Plane Algorithm for Multiobjective Optimization
- A polynomial-time algorithm, based on Newton's method, for linear programming
- An Interactive Approach for Multi-Criterion Optimization, with an Application to the Operation of an Academic Department
- An algorithm for linear programming which requires \(O(((m+n)n^ 2+(m+n)^{1.5}n)L)\) arithmetic operations
- An interactive interior point algorithm for multiobjective linear programming problems
- An interactive method for multiple-objective mathematical programming problems
- An interior multiobjective primal-dual linear programming algorithm using approximated gradients and sequential generation of anchor points
- Anchoring Points and Cones of Opportunities in Interior Multiobjective Linear Programming
- Generating interior search directions for multiobjective linear programming
- Path-Following Methods for Linear Programming
- Using approximate gradients in developing an interactive interior primal-dual multiobjective linear programming algorithm
- Using aspiration levels in an interactive interior multiobjective linear programming algorithm
Cited in
(11)- A new interactive algorithm for multiobjective linear programming using maximally changeable dominance cone
- Solving scalarized multi-objective network flow problems using an interior point method
- Using Efficient Anchoring Points for Generating Search Directions in Interior Multiobjective Linear Programming
- An interactive interior point algorithm for multiobjective linear programming problems
- An interior multiobjective linear programming algorithm
- The compromise hypersphere for multiobjective linear programming
- Generating interior search directions for multiobjective linear programming
- An Efficient Interior-Point Method for Convex Multicriteria Optimization Problems
- A WIN-WIN approach to multiple objective linear programming problems
- scientific article; zbMATH DE number 1086961 (Why is no real title available?)
- An interactive satisficing method based on alternative tolerance for fuzzy multiple objective optimization
This page was built for publication: An interactive interior point algorithm for multiobjective linear programming problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1604044)
