CHARACTERISING SOLUTION SET OF A NONCONVEX PROGRAMMING PROBLEM VIA ITS DUAL PROBLEMS
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 problem...
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Dalat University
2012-09-01
|
| Series: | Tạp chí Khoa học Đại học Đà Lạt |
| Subjects: | |
| Online Access: | https://tckh.dlu.edu.vn/index.php/tckhdhdl/article/view/204 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1832573954880962560 |
|---|---|
| author | Do Sang Kim Tạ Quang Sơn |
| author_facet | Do Sang Kim Tạ Quang Sơn |
| author_sort | Do Sang Kim |
| collection | DOAJ |
| description | 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. |
| format | Article |
| id | doaj-art-2a13ce1a92564eeab28c4da22272e389 |
| institution | Kabale University |
| issn | 0866-787X |
| language | English |
| publishDate | 2012-09-01 |
| publisher | Dalat University |
| record_format | Article |
| series | Tạp chí Khoa học Đại học Đà Lạt |
| spelling | doaj-art-2a13ce1a92564eeab28c4da22272e3892025-02-02T01:37:31ZengDalat UniversityTạp chí Khoa học Đại học Đà Lạt0866-787X2012-09-012310.37569/DalatUniversity.2.3.204(2012)CHARACTERISING SOLUTION SET OF A NONCONVEX PROGRAMMING PROBLEM VIA ITS DUAL PROBLEMSDo Sang Kim0Tạ Quang Sơn1Department of Applied Mathematics, Pukyong National University, KoreaDepartment of Natural Sciences, Nhatrang College of EducationUsing 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.https://tckh.dlu.edu.vn/index.php/tckhdhdl/article/view/204Mixed type dualityLagrange functionSolution set |
| spellingShingle | Do Sang Kim Tạ Quang Sơn CHARACTERISING SOLUTION SET OF A NONCONVEX PROGRAMMING PROBLEM VIA ITS DUAL PROBLEMS Tạp chí Khoa học Đại học Đà Lạt Mixed type duality Lagrange function Solution set |
| title | CHARACTERISING SOLUTION SET OF A NONCONVEX PROGRAMMING PROBLEM VIA ITS DUAL PROBLEMS |
| title_full | CHARACTERISING SOLUTION SET OF A NONCONVEX PROGRAMMING PROBLEM VIA ITS DUAL PROBLEMS |
| title_fullStr | CHARACTERISING SOLUTION SET OF A NONCONVEX PROGRAMMING PROBLEM VIA ITS DUAL PROBLEMS |
| title_full_unstemmed | CHARACTERISING SOLUTION SET OF A NONCONVEX PROGRAMMING PROBLEM VIA ITS DUAL PROBLEMS |
| title_short | CHARACTERISING SOLUTION SET OF A NONCONVEX PROGRAMMING PROBLEM VIA ITS DUAL PROBLEMS |
| title_sort | characterising solution set of a nonconvex programming problem via its dual problems |
| topic | Mixed type duality Lagrange function Solution set |
| url | https://tckh.dlu.edu.vn/index.php/tckhdhdl/article/view/204 |
| work_keys_str_mv | AT dosangkim characterisingsolutionsetofanonconvexprogrammingproblemviaitsdualproblems AT taquangson characterisingsolutionsetofanonconvexprogrammingproblemviaitsdualproblems |