Characterizing solution set of a nonconvex programming problem via its dual problems
Using duality theory, we propose a new approach to charact erize solution set of a nonconvex optimization problem. Several characterizations of solution set of the problem are established via it s dual problems. Charact eriza tions of solution sets of some class of convexj'nonconvex optimizatio...
Sparad:
| Huvudupphovsmän: | , |
|---|---|
| Materialtyp: | Artikel |
| Språk: | English |
| Publicerad: |
Trường Đại học Đà Lạt
2014
|
| Ämnen: | |
| Länkar: | https://scholar.dlu.edu.vn/thuvienso/handle/DLU123456789/37428 |
| Taggar: |
Lägg till en tagg
Inga taggar, Lägg till första taggen!
|
| Thư viện lưu trữ: | Thư viện Trường Đại học Đà Lạt |
|---|