A constraint shifting homotopy method for convex multi-objective programming
2011
In this paper, 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 point 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.
Keywords:
- Correction
- Source
- Cite
- Save
- Machine Reading By IdeaReader
14
References
4
Citations
NaN
KQI