A constraint shifting homotopy method for convex multi-objective programming (Q651890): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.cam.2011.07.011 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2072426750 / rank | |||
Normal rank | |||
Revision as of 02:27, 20 March 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
