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...
Сохранить в:
| Главные авторы: | , |
|---|---|
| Формат: | Статья |
| Язык: | English |
| Опубликовано: |
Trường Đại học Đà Lạt
2014
|
| Предметы: | |
| Online-ссылка: | https://scholar.dlu.edu.vn/thuvienso/handle/DLU123456789/37428 |
| Метки: |
Добавить метку
Нет меток, Требуется 1-ая метка записи!
|
| Thư viện lưu trữ: | Thư viện Trường Đại học Đà Lạt |
|---|