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...
Gorde:
| Egile Nagusiak: | , |
|---|---|
| Formatua: | Artikulua |
| Hizkuntza: | English |
| Argitaratua: |
Trường Đại học Đà Lạt
2014
|
| Gaiak: | |
| Sarrera elektronikoa: | https://scholar.dlu.edu.vn/thuvienso/handle/DLU123456789/37428 |
| Etiketak: |
Etiketa erantsi
Etiketarik gabe, Izan zaitez lehena erregistro honi etiketa jartzen!
|
| Thư viện lưu trữ: | Thư viện Trường Đại học Đà Lạt |
|---|
Izan zaitez lehena ohar bat uzten!