CHARACTERISING SOLUTION SET OF A NONCONVEX PROGRAMMING PROBLEM VIA ITS DUAL PROBLEMS
Tóm tắt
Using duality theory, we propose a new approach to characterise solution set of a nonconvex optimisation problem. Several characterisations of solution set of the problem are established via it s dual problems. Characterisations of solution sets of some class of convex/nonconvex optimisation problems given in several papers before can be covered. Example is given.
Từ khóa
Mixed type duality; Lagrange function; Solution set
DOI: http://dx.doi.org/10.37569/DalatUniversity.2.3.204(2012)
Các bài báo tham chiếu
- Hiện tại không có bài báo tham chiếu.
Copyright (c) 2012 Do Sang Kim, Tạ Quang Sơn

Công trình này được cấp phép theo Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.