Solving scalarized multi-objective network flow problems using an interior point method
From MaRDI portal
Publication:3002548
DOI10.1111/j.1475-3995.2010.00761.xzbMath1213.90074OpenAlexW2038326020MaRDI QIDQ3002548
Margarida Fonseca, José Rui Figueira, Mauricio G. C. Resende
Publication date: 20 May 2011
Published in: International Transactions in Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1111/j.1475-3995.2010.00761.x
Multi-objective and goal programming (90C29) Interior-point methods (90C51) Deterministic network models in operations research (90B10)
Related Items
Finding extreme supported solutions of biobjective network flow problems: an enhanced parametric programming approach, A criterion space search algorithm for mixed integer linear maximum multiplicative programs: a multiobjective optimization approach
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An interior multiobjective linear programming algorithm
- A visual interactive method for solving the multiple criteria problem
- On the completeness and constructiveness of parametric characterizations to vector optimization problems
- Interior path following primal-dual algorithms. I: 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
- A primal-dual infeasible-interior-point algorithm for linear programming
- A multiobjective interior primal-dual linear programming algorithm
- A QMR-based interior-point algorithm for solving linear programs
- An interior multiobjective primal-dual linear programming algorithm based on approximated gradients and efficient anchoring points
- Global and polynomial-time convergence of an infeasible-interior-point algorithm using inexact computation.
- An interactive interior point algorithm for multiobjective linear programming problems
- Multiple criteria decision analysis. State of the art surveys
- Convergence Analysis of Inexact Infeasible-Interior-Point Algorithms for Solving Linear Programming Problems
- Convergence of a Class of Inexact Interior-Point Algorithms for Linear Programs
- An Implementation of the Dual Affine Scaling Algorithm for Minimum-Cost Flow on Bipartite Uncapacitated Networks
- Generating interior search directions for multiobjective linear programming using approximate gradients and efficient anchoring points
- An Implementation of a Primal-Dual Interior Point Method for Linear Programming
- Anchoring Points and Cones of Opportunities in Interior Multiobjective Linear Programming
- An Interior Multiple Objective Primal-dual Linear Programming Algorithm Using Efficient Anchoring Points
- An Investigation of Interior-Point Algorithms for the Linear Transportation Problem
- Fortran subroutines for network flow optimization using an interior point algorithm
- Using objective values to start multiple objective linear programming algorithms
