CHARACTERISING SOLUTION SET OF A NONCONVEX PROGRAMMING PROBLEM VIA ITS DUAL PROBLEMS

Authors

  • Do Sang Kim Department of Applied Mathematics, Pukyong National University, Korea,
  • Tạ Quang Sơn Department of Natural Sciences, Nhatrang College of Education, Viet Nam

DOI:

https://doi.org/10.37569/DalatUniversity.2.3.204(2012)

Keywords:

Mixed type duality, Lagrange function, Solution set

Abstract

Using duality theory, we propose a new approach to characterise solution set of a nonconvex optimisation problem. Several characterisations of solution set of the problem are established via it s dual problems. Characterisations of solution sets of some class of convex/nonconvex optimisation problems given in several papers before can be covered. Example is given.

Downloads

Download data is not yet available.

Published

30-09-2012

Volume and Issues

Volume 2, Issue 3 (2012) - [No 3b, Old version]

Section

Natural Sciences and Technology

Copyright & License

Copyright (c) 2012 Do Sang Kim, Tạ Quang Sơn

Creative Commons License

This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.

How to Cite

Kim, D. S., & Sơn, T. Q. (2012). CHARACTERISING SOLUTION SET OF A NONCONVEX PROGRAMMING PROBLEM VIA ITS DUAL PROBLEMS. Dalat University Journal of Science, 2(3), 14-22. https://doi.org/10.37569/DalatUniversity.2.3.204(2012)
Crossref
Scopus
Google Scholar
Europe PMC