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...
שמור ב:
| Những tác giả chính: | , |
|---|---|
| פורמט: | Bài viết |
| שפה: | English |
| יצא לאור: |
Trường Đại học Đà Lạt
2014
|
| נושאים: | |
| גישה מקוונת: | https://scholar.dlu.edu.vn/thuvienso/handle/DLU123456789/37428 |
| תגים: |
הוספת תג
אין תגיות, היה/י הראשונ/ה לתייג את הרשומה!
|
| Thư viện lưu trữ: | Thư viện Trường Đại học Đà Lạt |
|---|
| סיכום: | 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 optimization problems given in several papers before can be covered. Example is given. Mathematics Subject Classification. 90C46, 49N15. |
|---|