• Journal of applied mathematics & informatics
• /
• 제25권1_2호
• /
• pp.85-107
• /
• 2007

In this paper, we develop a fairly large number of sets of global semiparametric sufficient efficiency conditions under various generalized (${\theta},{\eta},{\rho}$)-V-invexity assumptions for a multiobjective fractional programming problem involving arbitrary norms.

• Journal of applied mathematics & informatics
• /
• 제31권1_2호
• /
• pp.189-197
• /
• 2013

In this paper, Karush-Kuhn-Tucker type sufficient optimality conditions are obtained for a feasible point of a nonsmooth multiobjective fractional programming problem to be an efficient or properly efficient by using generalized ($F,{\rho},{\sigma}$)-type I functions.

• 충청수학회지
• /
• 제13권1호
• /
• pp.13-20
• /
• 2000

The purpose of this paper is to give a new existence theorem of a generalized weight Nash equilibrium for generalized multiobjective games by using the quasi-variational inequality due to Yuan.

• Journal of applied mathematics & informatics
• /
• 제26권1_2호
• /
• pp.151-160
• /
• 2008

A pair of multiobjective fractional symmetric dual programs is formulated over arbitrary cones. Weak, strong and converse duality theorems are proved under pseudoinvexity assumptions. A self duality theorem is also discussed.

• Journal of applied mathematics & informatics
• /
• 제15권1_2호
• /
• pp.227-235
• /
• 2004

In this paper we consider the dual problems for multiobjective programming with generalized convex functions. We obtain the weak duality and the strong duality. At last, we give an equivalent relationship between saddle point and efficient solution in multiobjective programming.

• Journal of applied mathematics & informatics
• /
• 제5권2호
• /
• pp.475-488
• /
• 1998

Wolfe and Mond-Weir type duals for multiobjective con-trol problems are formulated. Under pseudo-invexity/quasi-invexity assumptions of the functions involved, weak and strong duality the-orems are proved to relate efficient solutions of the primal and dual problems.

• Journal of applied mathematics & informatics
• /
• 제5권3호
• /
• pp.797-804
• /
• 1998

A pair of multiobjective generalized symmetric dual non-linear programming problems and weak strong and converse dual-ity theorems for these problems are established under generalized $\rho-(\eta,0)$-invexity assumptions. Several known results are obtained as special cases.

• 대한수학회논문집
• /
• 제28권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.

• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• 제4권2호
• /
• pp.59-66
• /
• 2000

We consider a multiobjective fractional variational programming problem (P) involving vector valued functions. By using the concept of proper efficiency, a relationship between the primal problem and parametric multiobjective variational problem is indicated.

• Journal of applied mathematics & informatics
• /
• 제11권1_2호
• /
• pp.273-281
• /
• 2003

The purpose of this paper is to study the duality theorems in cone constrained multiobjective nonlinear programming for pseudo-invex objectives and quasi-invex constrains and the constraint cones are arbitrary closed convex ones and not necessarily the nonnegative orthants.