Using approximate gradients in developing an interactive interior primal-dual multiobjective linear programming algorithm

DOI10.1016/S0377-2217(96)90078-8zbMath0908.90221MaRDI QIDQ1266672

Shmuel S. Oren, Ami Arbel

Publication date: 7 October 1998

Published in: European Journal of Operational Research (Search for Journal in Brave)

zbMATH Keywords

Karmarkar's algorithminteractive multiobjective linear programmingpath-following primal-dual algorithm

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Linear programming (90C05) Management decision making, including multiple objectives (90B50)

Related Items (5)

Strictly feasible solutions and strict complementarity in multiple objective linear optimization ⋮ Solving scalarized multi-objective network flow problems using an interior point method ⋮ A utility theory based interactive approach to robustness in linear optimization ⋮ Linearly constrained global optimization: a general solution algorithm with applications. ⋮ An interactive interior point algorithm for multiobjective linear programming problems

Cites Work

• A modification of Karmarkar's linear programming algorithm
• An interior multiobjective linear programming algorithm
• A new polynomial-time algorithm for linear programming
• An Implementation of a Primal-Dual Interior Point Method for Linear Programming
• Anchoring Points and Cones of Opportunities in Interior Multiobjective Linear Programming
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Using approximate gradients in developing an interactive interior primal-dual multiobjective linear programming algorithm