A constraint shifting homotopy method for convex multi-objective programming (Q651890): Difference between revisions
From MaRDI portal
Normalize DOI. |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1016/J.CAM.2011.07.011 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1016/J.CAM.2011.07.011 / rank | |||
Normal rank | |||
Latest revision as of 23:49, 9 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A constraint shifting homotopy method for convex multi-objective programming |
scientific article |
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
