CHARACTERISING SOLUTION SET OF A NONCONVEX PROGRAMMING PROBLEM VIA ITS DUAL PROBLEMS
Keywords:Mixed type duality, Lagrange function, Solution set
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.
Volume and Issues
Copyright & License
Copyright (c) 2012 Do Sang Kim, Tạ Quang Sơn
This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.