• 대한수학회보
• /
• 제30권1호
• /
• pp.1-7
• /
• 1993

Vector optimization problems consist of two or more objective functions and constraints. Optimization entails obtaining efficient solutions. Geoffrion [3] introduced the definition of the properly efficient solution in order to eliminate efficient solutions causing unbounded trade-offs between objective functions. In 1974, Isermann [7] obtained a necessary and sufficient condition for an efficient solution of a linear vector optimization problem with linear constraints and showed that every efficient solution is a properly efficient solution. Since then, many authors [1, 2, 4, 5, 6] have extended the Isermann's results. In particular, Gulati and Islam [4] derived a necessary and sufficient condition for an efficient solution of a linear vector optimization problem with nonlinear constraints, under certain assumptions. In this paper, we consider the following nonlinear vector optimization problem (NVOP): (Fig.) where for each i, f$_{i}$ is a differentiable function from R$^{n}$ into R and g is a differentiable function from R$^{n}$ into R$^{m}$ .

• Journal of applied mathematics & informatics
• /
• 제22권1_2호
• /
• pp.181-191
• /
• 2006

In this paper, multiobjective generalized fractional programming problems with set functions are considered, in which objective functions are maximum of finite fractional set functions. At first, optimality conditions are established. Then, saddle existence theorem is proved.