• Journal of applied mathematics & informatics
• /
• v.26 no.5_6
• /
• pp.1257-1261
• /
• 2008

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.