Multiple-objective programming with polynomial objectives and constraints (Q1197675)
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: Multiple-objective programming with polynomial objectives and constraints |
scientific article; zbMATH DE number 91835
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Multiple-objective programming with polynomial objectives and constraints |
scientific article; zbMATH DE number 91835 |
Statements
Multiple-objective programming with polynomial objectives and constraints (English)
0 references
16 January 1993
0 references
The authors describe a method for the numerical solution of polynomial multi-objective optimization problems. With the aid of a known scalarization result and by relaxation of constraints a solution is determined by using a homotopy approach. Examples with two objectives and one inequality constraint are discussed.
0 references
polynomial multi-objective optimization
0 references
homotopy approach
0 references
0 references
0.8242687582969666
0 references
0.8225421905517578
0 references
0.8187573552131653
0 references
