Indexed by:期刊论文

Date of Publication:2011-10-01

Journal:7th International Conference on Scientific Computing and Applications

Included Journals:SCIE、EI、CPCI-S、Scopus

Volume:236

Issue:5,SI

Page Number:640-646

ISSN No.:0377-0427

Key Words:Convex multi-objective programs; Minimal efficient solutions; Homotopy method; Global convergence

Abstract: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. (C) 2011 Elsevier B.V. All rights reserved.