A new approach to characterize the solution set of a pseudoconvex programming problem

JOURNAL OF COMPUTATIONAL AND APPLIED MATHEMATICS

卷:261

Article

Son, T. Q.¹  Kim, D. S.² 

[1] Saigon Univ, HCMC, Fac Math & Applicat, Ho Chi Minh City, Vietnam

[2] Pukyong Natl Univ, Dept Appl Math, Pusan, South Korea

关键词: Mixed type duality;    Lagrange function;    Solution set;   

DOI  :  10.1016/j.cam.2013.11.004

来源: Elsevier

【 摘 要 】

A new approach to characterize the solution set of a nonconvex optimization problem via its dual problem is proposed. Some properties of the Lagrange function associated to the problem are investigated. Then characterizations of the solution set of the problem are established. (C) 2013 Elsevier B.V. All rights reserved.

【 授权许可】

Free