A bisection-extreme point search algorithm for optimizing over the efficient set in the linear dependence case (Q1207046)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A bisection-extreme point search algorithm for optimizing over the efficient set in the linear dependence case |
scientific article; zbMATH DE number 151889
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A bisection-extreme point search algorithm for optimizing over the efficient set in the linear dependence case |
scientific article; zbMATH DE number 151889 |
Statements
A bisection-extreme point search algorithm for optimizing over the efficient set in the linear dependence case (English)
0 references
4 May 1993
0 references
The problem of maximizing a linear function on the set of efficient points of a linear vector maximization problem is investigated. It is assumed that the objective function of this problem is a linear combination of the objective functions on the linear vector maximization problem. A so-called bisection-extreme point search algorithm is presented for the solution of this problem. It is proved that this method finds a solution in a finite number of iterations.
0 references
linear vector maximization
0 references
bisection-extreme point search algorithm
0 references
0 references
0 references
0 references
