A constraint shifting homotopy method for convex multi-objective programming☆
Under an Elsevier user license
open archive
Keywords
Convex multi-objective programs
Minimal efficient solutions
Homotopy method
Global convergence
Cited by (0)
- ☆
This research was supported by the National Natural Science Foundation of China (10671029), the Research Fund for the Doctoral Programme of Higher Education (20060141029) and the Fundamental Research Funds for the Central Universities.
Copyright © 2011 Elsevier B.V. All rights reserved.