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...
Kaydedildi:
| Asıl Yazarlar: | , |
|---|---|
| Materyal Türü: | Makale |
| Dil: | English |
| Baskı/Yayın Bilgisi: |
Trường Đại học Đà Lạt
2014
|
| Konular: | |
| Online Erişim: | https://scholar.dlu.edu.vn/thuvienso/handle/DLU123456789/37428 |
| Etiketler: |
Etiketle
Etiket eklenmemiş, İlk siz ekleyin!
|
| Thư viện lưu trữ: | Thư viện Trường Đại học Đà Lạt |
|---|
İlk yorumlayan siz olun!