An interactive interior point algorithm for multiobjective linear programming problems
type: Item
instance of: scholarly article
title: An interactive interior point algorithm for multiobjective linear programming problems
zbMATH Open document ID: 0993.90081
DOI: 10.1016/S0167-6377(01)00089-X
author: T. Ouaderhman
author: Brahim Aghezzaf
published in: Operations Research Letters
publication date: 2002-07-03T00:00:00Z
Mathematics Subject Classification ID: 90C29
Mathematics Subject Classification ID: 90C51
zbMATH DE Number: 1762703
zbMATH Keywords: interactive interior point method
zbMATH Keywords: compromise solution
zbMATH Keywords: multiple objective linear programming
MaRDI profile type: Publication
cites work: An interior multiobjective primal-dual linear programming algorithm using approximated gradients and sequential generation of anchor points
cites work: Anchoring Points and Cones of Opportunities in Interior Multiobjective Linear Programming
cites work: Using aspiration levels in an interactive interior multiobjective linear programming algorithm
cites work: Generating interior search directions for multiobjective linear programming
cites work: Using approximate gradients in developing an interactive interior primal-dual multiobjective linear programming algorithm
cites work: Q3039055
cites work: An Interactive Approach for Multi-Criterion Optimization, with an Application to the Operation of an Academic Department
cites work: Path-Following Methods for Linear Programming
cites work: A polynomial-time algorithm, based on Newton's method, for linear programming
cites work: A Convergent Interactive Cutting-Plane Algorithm for Multiobjective Optimization
cites work: An interactive method for multiple-objective mathematical programming problems
cites work: Q4001824
cites work: Q5202836
cites work: An algorithm for linear programming which requires \(O(((m+n)n^ 2+(m+n)^{1.5}n)L)\) arithmetic operations
description: scientific article; zbMATH DE number 1762703