An affine scaling algorithm for biobjective linear programming

DOI10.1007/S40305-023-00486-0MaRDI QIDQ7034107zbMATH OpenFDO

Authors Marco Antonio Figueiredo Menezes, Nelson Maculan

Publication date 31 January 2025

Published in Journal of the Operations Research Society of China (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/S40305-023-00486-0

zbMATH Keywords

affine scaling algorithmbiobjective linear programmingmulti-objective linear programmingoptimization

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Linear programming (90C05) Multi-objective and goal programming (90C29)

Cites work

• A steepest descent method for vector optimization
• A survey and annotated bibliography of multiobjective combinatorial optimization
• A variation on Karmarkar’s algorithm for solving linear programming problems
• An interactive interior point algorithm for multiobjective linear programming problems
• Biobjective Simulation Optimization on Integer Lattices Using the Epsilon-Constraint Method in a Retrospective Approximation Framework
• Bound sets for biobjective combinatorial optimization problems
• Constraint propagation using dominance in interval branch \& bound for nonlinear biobjective optimization
• Generating interior search directions for multiobjective linear programming
• scientific article; zbMATH DE number 439380 (Why is no real title available?)
• scientific article; zbMATH DE number 3625108 (Why is no real title available?)
• scientific article; zbMATH DE number 3441850 (Why is no real title available?)
• scientific article; zbMATH DE number 830380 (Why is no real title available?)
• scientific article; zbMATH DE number 3301975 (Why is no real title available?)
• Multiobjective combinatorial optimization problems with a cost and several bottleneck objective functions: an algorithm with reoptimization
• Obtaining an outer approximation of the efficient set of nonlinear biobjective problems
• On scalarizing functions in multiobjective optimization
• Path-Following Methods for Linear Programming
• Primal-dual simplex method for multiobjective linear programming
• Quasi-Fejérian analysis of some optimization algorithms
• Solving scalarized multi-objective network flow problems using an interior point method
• Using approximate gradients in developing an interactive interior primal-dual multiobjective linear programming algorithm

This page was built for publication: An affine scaling algorithm for biobjective linear programming

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