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...

Täydet tiedot

Tallennettuna:
Bibliografiset tiedot
Päätekijät: Đỗ, Sang Kim, Tạ, Quang Sơn
Aineistotyyppi: Artikkeli
Kieli:English
Julkaistu: Trường Đại học Đà Lạt 2014
Aiheet:
Linkit:https://scholar.dlu.edu.vn/thuvienso/handle/DLU123456789/37428
Tagit: Lisää tagi
Ei tageja, Lisää ensimmäinen tagi!
Thư viện lưu trữ: Thư viện Trường Đại học Đà Lạt