• Journal of applied mathematics & informatics
• /
• v.18 no.1_2
• /
• pp.539-551
• /
• 2005

In this paper, sufficient optimality conditions and duality results for nonsmooth vector optimization problems are given under near invexity and infineness assumptions. Also, weak vector saddle-point theorems are obtained under near invexity-infineness assumptions.

• Communications of the Korean Mathematical Society
• /
• v.28 no.3
• /
• pp.597-602
• /
• 2013

In this paper, Mond-Weir type duality results for a uncertain multiobjective robust optimization problem are given under generalized invexity assumptions. Also, weak vector saddle-point theorems are obtained under convexity assumptions.

• Communications of the Korean Mathematical Society
• /
• v.20 no.4
• /
• pp.837-847
• /
• 2005

We consider multiobjective fractional programming problems with generalized invexity. An equivalent multiobjective programming problem is formulated by using a modification of the objective function due to Antczak. We give relations between a multiobjective fractional programming problem and an equivalent multiobjective fractional problem which has a modified objective function. And we present modified vector saddle point theorems.