Determination of satisfying and efficient solutions in convex multi-objective programming (Q5689833): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Q3895197 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3998364 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Theory of multiobjective optimization / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: More test examples for nonlinear programming codes / rank | |||
Normal rank | |||
Latest revision as of 10:08, 27 May 2024
scientific article; zbMATH DE number 961998
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Determination of satisfying and efficient solutions in convex multi-objective programming |
scientific article; zbMATH DE number 961998 |
Statements
Determination of satisfying and efficient solutions in convex multi-objective programming (English)
0 references
20 July 1997
0 references
multiple objective programming
0 references
efficient solutions
0 references
nonlinear convex goal programming
0 references
