Anchoring Points and Cones of Opportunities in Interior Multiobjective Linear Programming
From MaRDI portal
Publication:4287628
DOI10.1057/JORS.1994.9zbMATH Open0798.90121OpenAlexW2062260081MaRDI QIDQ4287628FDOQ4287628
Authors: Ami Arbel 
Publication date: 1 November 1994
Published in: The Journal of the Operational Research Society (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1057/jors.1994.9
Recommendations
- Using Efficient Anchoring Points for Generating Search Directions in Interior Multiobjective Linear Programming
- Generating interior search directions for multiobjective linear programming using approximate gradients and efficient anchoring points
- An Interior Multiple Objective Primal-dual Linear Programming Algorithm Using Efficient Anchoring Points
- Using aspiration levels in an interactive interior multiobjective linear programming algorithm
- Generating interior search directions for multiobjective linear programming
multiobjective linear programmingmulticriteria decision makingaffine-scaling primal algorithminterior-point linear programming
Cited In (13)
- Using aspiration levels in an interactive interior multiobjective linear programming algorithm
- Generating interior search directions for multiobjective linear programming using approximate gradients and efficient anchoring points
- An Interior Multiple Objective Primal-dual Linear Programming Algorithm Using Efficient Anchoring Points
- 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
- Using approximate gradients in developing an interactive interior primal-dual multiobjective linear programming algorithm
- An interactive interior point algorithm for multiobjective linear programming problems
- Title not available (Why is that?)
- An interior multiobjective primal-dual linear programming algorithm using approximated gradients and sequential generation of anchor points
- An interior-point approach for solving MC\(^2\) linear programming problems
- Primal-dual simplex method for multiobjective linear programming
- An interior multiobjective primal-dual linear programming algorithm based on approximated gradients and efficient anchoring points
- A weighted-gradient approach to multi-objective linear programming problems using the analytic hierarchy process
This page was built for publication: Anchoring Points and Cones of Opportunities in Interior Multiobjective Linear Programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4287628)
