A constraint shifting homotopy method for convex multi-objective programming (Q651890)
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 constraint shifting homotopy method for convex multi-objective programming |
scientific article; zbMATH DE number 5989499
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A constraint shifting homotopy method for convex multi-objective programming |
scientific article; zbMATH DE number 5989499 |
Statements
A constraint shifting homotopy method for convex multi-objective programming (English)
0 references
19 December 2011
0 references
A constraint shifting combined homotopy method for solving multi-objective programming problems with both equality and inequality constraints is presented. It does not need the starting point to be an interior or a feasible point and hence is convenient to use. Under some assumptions, the existence and convergence of a smooth path to an efficient solution are proven. Simple numerical results are given.
0 references
convex multi-objective programs
0 references
minimal efficient solutions
0 references
homotopy method
0 references
global convergence
0 references
numerical results
0 references
0.96765196
0 references
0.9531537
0 references
0.9184595
0 references
0.90856475
0 references
