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...
Uloženo v:
| Hlavní autoři: | , |
|---|---|
| Médium: | Článek |
| Jazyk: | English |
| Vydáno: |
Trường Đại học Đà Lạt
2014
|
| Témata: | |
| On-line přístup: | https://scholar.dlu.edu.vn/thuvienso/handle/DLU123456789/37428 |
| Tagy: |
Přidat tag
Žádné tagy, Buďte první, kdo otaguje tento záznam!
|
| Thư viện lưu trữ: | Thư viện Trường Đại học Đà Lạt |
|---|
Buďte první, kdo okomentuje tento záznam!