CHARACTERISING SOLUTION SET OF A NONCONVEX PROGRAMMING PROBLEM VIA ITS DUAL PROBLEMS

Do Sang Kim, Tạ Quang Sơn

Abstract


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.


Keywords


Mixed type duality; Lagrange function; Solution set



DOI: http://dx.doi.org/10.37569/DalatUniversity.2.3.204(2012)

Refbacks

  • There are currently no refbacks.


Copyright (c) 2012 Do Sang Kim, Tạ Quang Sơn

Creative Commons License
This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.
Editorial Office of DLU Journal of Science
Room.15, A25 Building, 01 Phu Dong Thien Vuong Street, Dalat, Lamdong
Email: tapchikhoahoc@dlu.edu.vn - Phone: (+84) 263 3 555 131

Creative Commons License
Based on Open Journal Systems
Developed by Information Technology Department