scientific article; zbMATH DE number 1424338
The paper is concerned with adoption of single-objective interior-point algorithm to Multiple Objective Linear Programming (MOLP) problem of the form: \[ \text{Maximize } C(x) \text{ subject to } Ax=b, \qquad x\geq{0},\tag{P} \] where \(C\) and \(A\) are a \(q\times{n}\) objective matrix and an \(m\times{n}\) constraints matrix, respectively. The paper presents a modest state-of-the-art of interior-point algorithms as they pertain to MOLP problems. Specifically, the author states basic and generic ideas associated with interior algorithms and develops some approaches for using these algorithms in an MOLP context. For the entire collection see [Zbl 0928.00019].
- A primal-dual infeasible-interior-point algorithm for multiple objective linear programming problems
- A primal-dual infeasible-interior-point algorithm for multiple objective linear programming problems
- scientific article; zbMATH DE number 721832
- scientific article; zbMATH DE number 597811
- scientific article; zbMATH DE number 721833
- A bookkeeping strategy for multiple objective linear programs
- On the modified interior point algorithm for solving multi-objective linear programming problems
- scientific article; zbMATH DE number 721833 (Why is no real title available?)
- An interior multiobjective linear programming algorithm using aspirations
- Inner approximation algorithm for solving linear multiobjective optimization problems
- An interior-point approach for solving MC\(^2\) linear programming problems
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4945552)
