DocumentCode :
2837347
Title :
Optimality conditions for a class Lipschitz multiobjective programming
Author :
Li, Zhongfan ; Wang, Cailing ; Sun, Wenjuan
Author_Institution :
Sch. of Math., Jilin Univ., Changchun, China
fYear :
2009
fDate :
17-19 June 2009
Firstpage :
2834
Lastpage :
2837
Abstract :
In this paper, a separation theorem is established firstly. Applying this theorem the relationships between the solutions of a series of inequality systems are discussed. Then a necessary optimality condition without distance function is obtained under a new constraint qualification for a multiobjective programming in which all the objective functions and constraint functions are Lipschitz. Finally, sufficient conditions are studied.
Keywords :
optimisation; set theory; class Lipschitz multiobjective programming; constraint functions; inequality systems; objective functions; optimality conditions; separation theorem; Convergence; Functional programming; Mathematics; Qualifications; Sufficient conditions; Optimality conditions; generalized gradient; separation theorem; weak Pareto-efficient solution;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Control and Decision Conference, 2009. CCDC '09. Chinese
Conference_Location :
Guilin
Print_ISBN :
978-1-4244-2722-2
Electronic_ISBN :
978-1-4244-2723-9
Type :
conf
DOI :
10.1109/CCDC.2009.5194836
Filename :
5194836
Link To Document :
بازگشت