No label defined (Q4945552)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1424338
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | No label defined |
scientific article; zbMATH DE number 1424338 |
Statements
5 December 2000
0 references
affine-scaling primal algorithm
0 references
interior algorithm
0 references
multiobjective programming problem
0 references
0.8539140224456787
0 references
0.8522769212722778
0 references
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].
0 references
