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!
|