An approximation method for the efficiency set of multiobjective programming problems (Q3211123): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| (One intermediate revision by one other user not shown) | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1080/02331939008843621 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2089595094 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Proper efficiency and the theory of vector maximization / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: \(\epsilon\)-solutions in vector minimization problems / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Efficiency in multiple objective optimization problems / rank | |||
Normal rank | |||
Latest revision as of 14:09, 21 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An approximation method for the efficiency set of multiobjective programming problems |
scientific article |
Statements
An approximation method for the efficiency set of multiobjective programming problems (English)
0 references
1990
0 references
dual simplex method
0 references
\(\epsilon \) -approximation
0 references
efficiency set
0 references
vector minimization
0 references
