An interior multiobjective linear programming algorithm

DOI10.1016/0305-0548(93)90059-RzbMath0793.90061OpenAlexW2074889170MaRDI QIDQ690014

Ami Arbel

Publication date: 20 December 1993

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0305-0548(93)90059-r

zbMATH Keywords

simplex methodmultiobjective decision makinginterior point algorithmaffine scaling primal algorithm

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Linear programming (90C05) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Related Items (5)

An interior multiobjective primal-dual linear programming algorithm based on approximated gradients and efficient anchoring points ⋮ Solving scalarized multi-objective network flow problems using an interior point method ⋮ Euclidean centers: Computation, properties and a MOLP application ⋮ Using aspiration levels in an interactive interior multiobjective linear programming algorithm ⋮ Using approximate gradients in developing an interactive interior primal-dual multiobjective linear programming algorithm

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A modification of Karmarkar's linear programming algorithm
• A new polynomial-time algorithm for linear programming
• Representation of visual response to neural firing
• An implementation of Karmarkar's algorithm for linear programming

This page was built for publication: An interior multiobjective linear programming algorithm