ON DUALITY THEOREMS FOR CONVEXIFIABLE OPTIMIZATION PROBLEMS

  • Kim, Moon-Hee (Department of Multimedia Engineering, Tongmyong University)
  • Published : 2008.09.30

Abstract

In this paper, we consider of a convexifiable programming problem with bounds on variables. We obtain Mond-Weir type duality theorems for the convexifiable programming problems. Moreover, we give a numerical example to illustrate our duality.

Keywords