Generating interior search directions for multiobjective linear programming using approximate gradients and efficient anchoring points

DOI10.1080/02331939308843910zbMath0818.90096OpenAlexW1964351802MaRDI QIDQ3835629

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/02331939308843910

zbMATH Keywords

multicriteria decision makinginterior point methodsmultiobjective linear programmingKarmarkar's algorithmaffine-scaling primal algorithm

Mathematics Subject Classification ID

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

Related Items (2)

Solving scalarized multi-objective network flow problems using an interior point method ⋮ A multiobjective interior primal-dual linear programming algorithm

Cites Work

• A modification of Karmarkar's linear programming algorithm
• A new polynomial-time algorithm for linear programming
• An implementation of Karmarkar's algorithm for linear programming
• A variation on Karmarkar’s algorithm for solving linear programming problems
• A new variant of the primal affine scaling algorithm for linear programs
• Power Series Variants of Karmarkar-Type Algorithms
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Generating interior search directions for multiobjective linear programming using approximate gradients and efficient anchoring points