An interior multiobjective linear programming algorithm

DOI10.1016/0305-0548(93)90059-RMaRDI QIDQ690014zbMATH OpenOpenAlexFDO

Authors 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

affine scaling primal algorithminterior point algorithmmultiobjective decision makingsimplex method

Mathematics Subject Classification ID

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

Review text

Current results in the area of multiobjective decision making are using the simplex method as the analytical tool for guiding the exploration of multicriteria and their inherent trade-offs. As problem size increases, methods based on the simplex algorithm and its vertex information may prolong the search for an acceptable multiobjective solution due to the large number of vertices. Also, a method based on vertex information may have difficulties identifying solutions that are located on a face of the polytope rather than its vertex. In this paper the author proposed a multiobjective linear programming algorithm that is based on one variant of Karmarkar's interior point algorithm known as the affine scaling primal algorithm. This interior point algorithm may dominate the simplex algorithm as problem size increases.

Recommendations

• Generating interior search directions for multiobjective linear programming
• scientific article; zbMATH DE number 721832
• An interior multiobjective linear programming algorithm
• Generating interior search directions for multiobjective linear programming using approximate gradients and efficient anchoring points
• 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
• scientific article; zbMATH DE number 2086188 (Why is no real title available?)
• scientific article; zbMATH DE number 3945836 (Why is no real title available?)
• scientific article; zbMATH DE number 4085440 (Why is no real title available?)
• scientific article; zbMATH DE number 194636 (Why is no real title available?)
• Representation of visual response to neural firing

Cited in

(15)

• An adaptation of PRIAM to multiobjective linear programming
• 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
• 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
• An interior multiobjective linear programming algorithm
• scientific article; zbMATH DE number 721832 (Why is no real title available?)
• scientific article; zbMATH DE number 1086961 (Why is no real title available?)
• scientific article; zbMATH DE number 1149789 (Why is no real title available?)
• Generating interior search directions for multiobjective linear programming
• Inner approximation algorithm for solving linear multiobjective optimization problems
• AN ALGORITHM FOR A MULTIOBJECTIVE, MULTILEVEL LINEAR PROGRAMMING
• An Efficient Interior-Point Method for Convex Multicriteria Optimization Problems
• Using objective values to start multiple objective linear programming algorithms
• Euclidean centers: Computation, properties and a MOLP application

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

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