An interior multiobjective primal-dual linear programming algorithm using approximated gradients and sequential generation of anchor points

DOI10.1080/02331939408843979zbMATH Open0818.90097OpenAlexW2065120047MaRDI QIDQ4764862FDOQ4764862

Authors: Ami Arbel 

Publication date: 20 April 1995

Published in: Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/02331939408843979

Recommendations

• An interior multiobjective primal-dual linear programming algorithm based on approximated gradients and efficient anchoring points
• 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
• Anchoring Points and Cones of Opportunities in Interior Multiobjective Linear Programming
• Generating interior search directions for multiobjective linear programming

zbMATH Keywords

multiple objective linear programmingpath-following primal-dual algorithm

Mathematics Subject Classification ID

Linear programming (90C05) Multi-objective and goal programming (90C29) Numerical computation of matrix norms, conditioning, scaling (65F35)

Cites Work

• A new polynomial-time algorithm for linear programming
• Title not available (Why is that?)
• Title not available (Why is that?)
• An Interactive Approach for Multi-Criterion Optimization, with an Application to the Operation of an Academic Department
• A modification of Karmarkar's linear programming algorithm
• Title not available (Why is that?)
• How to handle dependence with the analytic hierarchy process

Cited In (7)

• 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 Efficient Anchoring Points for Generating Search Directions in Interior Multiobjective Linear Programming
• An interactive interior point algorithm for multiobjective linear programming problems
• Title not available (Why is that?)
• Title not available (Why is that?)
• A weighted-gradient approach to multi-objective linear programming problems using the analytic hierarchy process

This page was built for publication: An interior multiobjective primal-dual linear programming algorithm using approximated gradients and sequential generation of anchor points

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4764862)