• 検索結果がありません。

Nondifferentiable Multiobjective Fractional Programming Problems under Generalized Convexity(Nonlinear Analysis and Convex Analysis)

N/A
N/A
Protected

Academic year: 2021

シェア "Nondifferentiable Multiobjective Fractional Programming Problems under Generalized Convexity(Nonlinear Analysis and Convex Analysis)"

Copied!
10
0
0

読み込み中.... (全文を見る)

全文

(1)

Nondifferentiable Multiobjective Fractional

Programming

Problems

under

Generalized

Convexityl

D.

S.

Kinu2,

H.

S.

Kang3

and H.

S.

Jeung3

Abstract. In this paper, we consider a class ofnondifferentiable multiobjective fractional programs in which each component of the objective function contains a

term involving the support function of a compact convex set. We present

optimal-ity conditions and duality results for a weakly efficient solution of nondifferentiable

multiobjective fractional programming $\mathrm{p}\mathrm{r}\mathrm{o}\mathrm{b}\dot{\mathrm{l}}\mathrm{e}\mathrm{m}\mathrm{s}$

under generalized convexity.

1

Introduction and Preliminaries

The various concepts of generalized convexity and duality results for

a

frac-tional

programmingproblem

was introduced

by many authors $[1]-[14]$. Duality

and optimality for

nondifferentiable

multiobjective programming problems, in

which the objective function contains

a

support function

was

studied by Mond

and

Schechter

[15]. Bector et al. [1] , derived optimality conditions for

a

class

ofnondifferentiable

convex

multiobjectivefractionalprogramming problemsand

established

some

duality theorems. Recently, Kuk et al. [7] defined the

con-cept of $V-\rho-$-invexity for vector valued functions, which is generalization of the $V$-invex function $[4],[13]$, and they proved the generalized Karush-Kuhn-Tucker

sufficient optimality theorem, weak and strong duality for nonsmooth

multi-objective programs under the $V-\rho-$-invexity assumptions. Subsequently, Kuk $et$

al. [8] extend their results to nonsmooth multiobjective fractional programs

and Liang et al. [11] introduced $(F, \alpha, \rho, d)$-convexity and obtained

some

cor-responding optimality conditions and duality results for the single-objective

fractional problem. Also, Liang et al. [12] extend their results to the

multiob-jective fractional programs. Very recently, Kim et al. [6] proved Fritz John and

Kuhn-Tucker necessary andsufficient optimalityconditions fornondifferentiable multiobjective fractional programming problems and obtained

some

duality

re-sults for a weakly efficient solution under $V-\rho-$-invexity assumptions that

was

given by Kuk et al. [7].

In this paper, we consider a nondifferentiable multiobjective fractional

pro-grams in which each component of the objective function contains

a

term

in-volvingthesupport function of

a

compact

convex

set. We present necessary and

sufficient optimality conditions, which is given by Kim et al. [6] and formulate

1Thiswork wassupported by the Brain Korea 21 Projectin 2003.

2Professor, Department of Applied Mathematics, Pukyong National University, Pusan,

Korea.

3 Ph.$\mathrm{D}$ Student, Departmentof Applied Mathematics,Pukyong NationalUniversity,

(2)

ageneral dual problem. Also we establish dualitytheorems for weakly efficient

solutions of

nondifferentiable

multiobjective fractional programming problems

and introduce special

cases

of

our

duality results.

Now

we

consider the followingmultiobjective fractional programming

prob-lem,

(MFP) Minimize $( \frac{f_{1}(x)+s(x|C_{1})}{g_{1}(x)},$

$\ldots,$ $\frac{f_{p}(x)+s(x|C_{p})}{g_{\mathrm{p}}(x)})$

subject to $h(x)\leqq 0$, $x\in X_{0}$,

where $X_{0}$ is

an

open set of$\mathrm{R}^{n},$ $f:=(f_{1}, \ldots, f_{p})$ : $X_{0}arrow \mathrm{R}^{p},$ $g:=(g_{1}, \ldots, g_{p})$ :

$X_{0}$ — $\mathrm{R}^{p}$, and $h:=(h_{1}, \ldots, h_{m})$

:

$X_{0}arrow \mathrm{R}^{m}$

are

continuously

differentiable

over

$x_{0;}C_{i}$, for each $i\in P=\{1,2, \ldots,p\}$, is a compact

convex

set of $\mathrm{R}^{n}$ and

$s(x|C_{i})= \max\{\langle x, y\rangle|y\in C_{i}\}$

.

Further let, $S=\{x\in X_{0} : h(x)\leqq 0\}$ be the

set of all feasible solutions and $I(x):=\{i : h_{i}(x)=0\}$ for any $x\in X_{0}$. Let

$k_{i}(x)=s(x|C_{i}),$ $i=1,$$\ldots$ ,$p$. Then $k_{i}$ is a

convex

function and $\partial k_{i}(x)=\{w\in$ $C_{i}|\langle w, x\rangle=s(x|C_{i})\}[15]$, where $\partial k_{i}$ isthe subdifferential of$k_{i}$

.

We assumethat

$f(x)\geqq 0$ for all $x\in X_{0}$ and $g(x)>0$ for all $x\in X_{0}$ whenever $g$ is not linear.

We introduce the following definition due to Kuk et $al[7]$.

Definition 1.1. A vector function $f$ : $X_{0}arrow \mathrm{R}^{p}$ is said to be (V,$\rho$)-invex

at $u\in X_{0}$ with respect to functions $\eta$ and

$\theta$ :

$X_{0}\cross X_{0}arrow \mathrm{R}^{n}$ if there exists

$\alpha_{i}$ : $X_{0}\mathrm{x}X_{0}arrow \mathbb{R}_{+}\backslash \{0\}$ and $\rho_{i}\in \mathbb{R},$ $i=1,$

$\ldots p$ such that for any $x\in X_{0}$, and

for

$i=1,2,$ $\ldots,p$,

$\alpha_{i}(x, u)[f_{i}(x)-f_{i}(u)]\geqq\nabla f_{i}(u)\eta(x, u)+\rho_{i}||\theta(x, u)||^{2}$.

The function $f$ is (V,$\rho$)-invex

on

$X_{0}$ if it is (V,$\rho$)-invex at every point in $X_{0}$.

We shall use the following theorem.

Theorem 1.1. [6]

Assume

that$f$ and $g$

are

vector-valued differentiable

func-tionsdefined

on

$X_{0}$ and$f(x)+\langle w, x\rangle\geqq 0,$ $g(x)>0$forall$x\in X_{0}$

.

If$f(\cdot)+\langle w, \cdot\rangle$ $\mathrm{a}\mathrm{n}\mathrm{d}-g(\cdot)$

are

(V,

$\rho$)-invex at$x_{0}\in X_{0}$, then $\frac{j(\cdot)+(w,\cdot\rangle}{g(\cdot)}$ is (V,

$\rho$)-invexat$x_{0}$,where

(3)

2

Optimality Conditions

We present Fritz John and Kuhn-Tucker necessary and sufficient conditions,

that

were

proved by Kim

et

al. [6] for weakly

efficient

solutions of (MFP).

Theorem 2.1. Fritz John Necessary Optimality

Conditions

If $x_{0}\in S$ is

a

weakly

efficient solution

of (MFP), then there exists $\lambda_{i},$$i=$ $1,$$\ldots,p,$ $\mu_{j},$ $j=1,$

$\ldots,$$m$ such that

$\sum_{i=1}^{p}\lambda_{i}\nabla(\frac{f_{i}(x_{0})+\langle w_{t},x_{0}\rangle}{g_{i}(x_{0})})+\sum_{j=1}^{m}\mu_{j}\nabla h_{j}(x_{0})=0$,

$\langle w_{i}, x_{0}\rangle=s(x_{0}|C_{i}),$ $w_{i}\in C_{i},$ $i=1,$ $\ldots,p$,

$\sum_{j=1}^{m}\mu_{j}h_{j}(x_{0})=0$

,

$(\lambda_{1},\ldots,\lambda_{p},\mu_{1}, \ldots,\mu_{m})\geqq 0,$ $(\lambda_{1}, \ldots,\lambda_{p},\mu_{1},\ldots,\mu_{m})\neq 0$.

Theorem 2.2. Kuhn-Tucker Necessary Optimality Conditions

Let $x_{0}\in S$ is a weakly efficient solution of (MFP) and

assume

that there

exists $z^{*}\in \mathrm{R}^{n}$ such that $\langle\nabla h_{j}(x\mathrm{o}), z^{*}\rangle>0,$ $j\in I(x\mathrm{o})$. Then there exist

$\lambda_{i}\geqq 0,$ $i=1,$

$\ldots,p,$ $\mu_{\mathrm{j}}\geqq 0,$$j=1,$

$\ldots,$$m$ and $w_{i}\in C_{i},$$i=1,$ $\ldots,p$ such that

$\sum_{i=1}^{p}\lambda_{i}\nabla(\frac{f_{i}(x_{0})+\langle w_{i},x_{0}\rangle}{g_{i}(x_{0})})+\sum_{j=1}^{m}\mu_{j}\nabla h_{j}(x\mathrm{o})=0$,

$\langle w_{i}, x_{0}\rangle=s(x0|C_{i}),$ $w_{i}\in C_{i},$ $i=1,$$\ldots,p$,

$\sum_{j=1}^{m}\mu_{j}h_{\mathrm{j}}(x_{0})=0$,

(4)

Theorem 2.3. Kuhn-Tucker Sufficient Optimality Conditions

Let $x_{0}$ be

a

feasible solution of(MFP). Supposethatthereexists $\lambda=(\lambda_{1}, \ldots, \lambda_{\mathrm{p}})\in$

$\mathrm{R}_{+}^{p},$ $\lambda>0,$ $\sum_{i=1}^{p}\lambda_{i}=1$ and $\mu=$ $(\mu_{1}, \ldots , \mu_{m})\in \mathrm{R}_{+}^{m}$ such that

$\sum_{i=1}^{p}\lambda_{i}\nabla(\frac{f_{i}(x_{0})+\langle w_{i},x_{0}\rangle}{g_{i}(x_{0})})+\sum_{j=1}^{m}\mu_{j}\nabla h_{j}(x_{0})=0$,

$\langle w_{i}, x_{0}\rangle=s(x_{0}|C_{i}),$ $w_{i}\in C_{i},$ $i=1,$$\ldots,p$,

$\sum_{j=1}^{m}\mu_{j}h_{j}(x_{0})=0$

.

If$f(\cdot)+\langle w, \cdot\rangle$ and $-g(\cdot)$

are

(V,$\rho$)-invex at $x_{0}$ and $h$ is (V,$\sigma$)-invex at $x_{0}$ with

respect to the

same

$\eta$ with $\sum_{i=1}^{p}\lambda_{i}\rho_{i}\geqq 0$and $\sum_{j=1}^{m}\sigma_{j}\geqq 0,\mathrm{t}\mathrm{h}\mathrm{e}\mathrm{n}x_{0}$is a weakly

efficient solution of (MFP).

3

Duality

Theorems

We consider the following general dual problem to primal problem (MFP).

$(\mathrm{M}\mathrm{F}\mathrm{D})_{G}$ Maximize $( \frac{f_{1}(u)+\langle w_{1},u\rangle}{g_{1}(u)}+\mu_{I}h_{I}(u),$

$\ldots$ ,

$\frac{f_{p}(u)+\langle w_{p},u\rangle}{g_{p}(u)}+\mu_{I}h_{I}(u))$

subject to $\sum_{i=1}^{p}\lambda_{i}\nabla(\frac{f_{i}(u)+\langle w_{i},u\rangle}{g_{i}(u)})+\sum_{j=1}^{m}\mu_{j}\nabla h_{j}(u)=0,$$(1)$

$\mu_{J}h_{J}(u)\geqq 0$,

$w_{i}\in C_{i}i=1,$ $\ldots,p$,

$(\mu_{1}, \ldots, \mu_{m})\geqq 0,$ $\lambda=(\lambda_{1}, \ldots, \lambda_{p})\in\Lambda^{-\vdash}$,

where $I\cup J=\{1, \cdots, m\}=M$ and $I\cap J=\emptyset$

.

Let $\Lambda^{+}=\{\lambda\in \mathrm{R}^{p}$ : $\lambda\geqq 0,$ $\lambda^{T}e=$

$1,$$e=(1, \ldots, 1)\in \mathrm{R}^{p}\}$

.

Theorem 3.1. Weak Duality Let $x\in S$ be

a

feasible for (MFP)

(5)

$\langle w, \cdot\rangle_{\mathrm{g}}-g(\cdot)$ and $h$

are

(V,

$\rho$)-invex

functions

over

$S$ with respect to the

same

$\eta$

with $\sum_{i=1}^{p}\lambda_{i}\rho_{i}\geqq 0$.

Then the following cannot hold;

$\frac{f(x)+s(x|C)}{g(x)}<\frac{f(u)+\langle w,u\rangle}{g(u)}+\sum_{j\in I}\mu_{j}h_{j}(u)e$.

Proof. Assume that the result does not hold. Since $\langle w_{i}, x\rangle\leqq s(x|C_{i})$,

we

have for all $i\in\{1, \ldots,p\}$

$\frac{f_{i}(x)+\langle w_{i},x\rangle}{g_{i}(x)}$ $\leqq$ $\frac{f_{i}(x)+s(x|C_{i})}{g_{i}(x)}$

$<$ $\frac{f_{i}(u)+\langle w_{i},u\rangle}{g_{i}(u)}+\sum_{j\in I}\mu_{j}h_{j}(u)$.

Since $\sum_{j\in J}\mu_{j}h_{j}(x)\leqq 0$ and $\sum_{j\in j}\mu_{j}h_{j}(u)\geqq 0$, for $i=1,$$\ldots,p$,

$\frac{f_{i}(x)+\langle w_{i},x\rangle}{g_{i}(x)}+$$\sum_{-,j-- 1}^{m}\mu_{j}h_{j}(x)<\frac{f_{i}(u)+\langle w_{i},u\rangle}{g_{i}(u)}+\sum_{j=1}^{m}\mu_{j}h_{j}(u)$ .

By using (V,$\rho$)-invexity of$h$ at $u$ and Theorem 1.1, it follows that

$\overline{\alpha}_{i}(x, u)[\frac{f_{i}(x)+\langle w_{i},x\rangle}{g_{i}(x)}+\sum_{j=1}^{m}\mu_{j}h_{j}(u)-\frac{f_{i}(u)+\langle w_{i},u\rangle}{g_{i}(u)}-\sum_{j=1}^{m}\mu_{j}h_{j}(u)]$

$\geqq[\nabla(\frac{f_{i}(u)+\langle w_{i},u\rangle}{g_{i}(u)})+\sum_{j=1}^{m}\mu_{j}\nabla h_{j}(u)]\eta(x, u)+\rho_{i}||\overline{\theta}_{i}(x, u)||^{2}$.

Since $\lambda\in\Lambda^{+}$,

we

have

(6)

Since

$\sum_{i=1}^{p}\lambda_{i}\rho_{i}||\overline{\theta}_{i}(x, u)||^{2}\geqq 0$, it follows from (2) that

$[ \sum_{i=1}^{p}\lambda_{i}\nabla(\frac{f_{i}(u)+\langle w_{i},u\rangle}{g_{i}(u)})+\sum_{j=1}^{m}\mu_{j}\nabla h_{j}(u)]\eta(x, u)<0$,

which contradicts (1). $\square$

Remark. If we replace $\lambda\in\Lambda^{+}$ in $(\mathrm{M}\mathrm{F}\mathrm{D})_{G}$ by $\lambda>0$, then above weak

duality theorem holds in the

sense

ofefficient solutions.

Theorem3.2. StrongDuality If$\overline{x}$is

a

weakly

efficient solution

of(MFP),

and

assume

that there exists $z^{*}\in \mathrm{R}^{n}$ such that $\langle\nabla h_{j}(\overline{x}), z^{*}\rangle>0,$ $j\in I(\overline{x})$,

then there exists $\overline{\lambda}\in \mathrm{R}^{p},\overline{\mu}\in \mathrm{R}^{m}$ and $\overline{w}\in C$ such that $(\overline{x},\overline{\lambda},\overline{w},\overline{\mu})$ is feasible

for $(\mathrm{M}\mathrm{F}\mathrm{D})_{G}$ and $\langle\overline{w},\overline{x}\rangle=s(\overline{x}|C)$. Moreover, if the weak duality holds, then

$(\overline{x},\overline{\lambda},\overline{w},\overline{\mu})$ is a weakly

efficient

solution of $(\mathrm{M}\mathrm{F}\mathrm{D})c$.

Proof. Since $\overline{x}$ is

a

weakly efficient solution of (MFP) and there exists

$z^{*}\in \mathrm{R}^{n}$ such that $\langle\nabla h_{j}(\overline{x}), z^{*}\rangle>0,$ $j\in I(\overline{x})$, there exists $\overline{\lambda}\in \mathrm{R}^{p},\overline{\mu}\in \mathrm{R}^{m}$ and

$w_{i}\in C_{i},$ $i=1,$$\ldots,p$ such that $\sum_{i=1}^{\mathrm{p}}\overline{\lambda}_{i}\nabla(\frac{f_{j}(\overline{x})+\langle w_{j},\overline{x}\rangle}{g_{j}(\overline{x})})+\sum_{j=1}^{m}\overline{\mu}_{j}\nabla h_{j}(\overline{x})=$

$0$, $\langle\overline{w}_{i},\overline{x}\rangle=s(\overline{x}|C_{i}),\overline{w}_{i}\in C_{i},$ $i=1,$ $\ldots,p$ and $\sum_{j=1}^{m}\overline{\mu}_{j}h_{j}(\overline{x})=0$

.

Since

$\sum_{j\in I}\overline{\mu}_{j}h_{j}(\overline{x})+\sum_{j\in J}\overline{\mu}_{j}h_{j}(\overline{x})=0$and $\overline{x}$ is

a

weaklyefficient solution of(MFP),

we

can

obtain $\sum_{j\in j}\overline{\mu}_{j}h_{j}(\overline{x})\geqq 0$. Thus $(\overline{x},\overline{\lambda},\overline{w},\overline{\mu})$ is a feasible for $(\mathrm{M}\mathrm{F}\mathrm{D})_{G}$, $\langle\overline{w}_{i},\overline{x}\rangle=s(\overline{x}|C_{i}),$ $i=1,$$\ldots,p$. Since $\overline{x}$ is feasible for (MFP), it follows from

weak duality that $\frac{f(\overline{x})+s(\overline{x}|C)}{g(\overline{x})}\not\leq\frac{f(u)+(w,u\rangle}{g(u)}+\sum_{j\in I}\mu_{j}h_{j}(u)e$ for any $(\mathrm{M}\mathrm{F}\mathrm{D})_{G}$

feasible solution $(u, \lambda, w, \mu)$. Hence $(\overline{x},\overline{\lambda},\overline{w},\overline{\mu})$ is aweakly efficient solution

$\mathrm{o}\mathrm{f}\square$

$(\mathrm{M}\mathrm{F}\mathrm{D})_{G}$.

4

Special

Cases

(7)

If $I=M$ and $J=\emptyset$, then $(\mathrm{M}\mathrm{F}\mathrm{D})_{G}$ is reduced to the following Mond-Weir

type

dual

problem

for

(MFP):

$(\mathrm{M}\mathrm{F}\mathrm{D})_{M}$ Maximize $( \frac{f_{1}(u)+\langle w_{1},u\rangle}{g_{1}(u)},$

$\ldots,$ $\frac{f_{p}(u)+(w_{p)}u\rangle}{g_{p}(u)})$

subject to $\sum_{i=1}^{\mathrm{p}}\lambda_{i}\nabla(\frac{f_{i}(u)+\langle w_{i},u\rangle}{g_{i}(u)})+\sum_{j=1}^{m}\mu_{j}\nabla h_{j}(u)=0$,

$\sum_{j=1}^{m}\mu_{j}h_{j}(u)\geqq 0$,

$w_{i}\in C_{i},$ $i=1,$ $\ldots,p$,

$(\mu_{1}, \ldots, \mu_{m})\geqq 0,$ $\lambda=(\lambda_{1}, \ldots, \lambda_{p})\in\Lambda^{+}$,

where $\Lambda^{+}=\{\lambda\in \mathrm{R}^{p} : \lambda\geqq 0, \lambda^{T}e=1, e=(1, \ldots, 1)\in \mathrm{R}^{p}\}$.

Theorem 4.1. Weak Duality Let $x\in S$ be

a

feasible for (MFP)

and $(u, \lambda, w, \mu)$ be

a

feasible for $(\mathrm{M}\mathrm{F}\mathrm{D})_{M}$. Assume that the functions $f(\cdot)+$ $\langle w, \cdot\rangle,$$-g(\cdot)$

are

(V,$\rho$)-invex functions

over

$S$ and $h$ is (V,$\sigma$)-invex at $u$ with

respect to the

same

$\eta$ with$\sum_{i=1}^{p}\lambda_{i}\rho_{i}\geqq 0$ and $\sum_{j-- 1}^{m}-\sigma_{j}\geqq 0$

.

Then the following

cannot

hold,

$\frac{f(x)+s(x|C)}{g(x)}<\frac{f(u)+\langle w,u\rangle}{g(u)}$

.

Theorem 4.2. StrongDuality If$\overline{x}$isaweaklyefficient solutionof(MFP),

and

assume

that there exists $z^{*}\in \mathrm{R}^{n}$ such that $\langle\nabla h_{j}(\overline{x}), z^{*}\rangle>0,$ $j\in I(\overline{x})$,

then there exists $\overline{\lambda}\in \mathrm{R}^{p},\overline{\mu}\in \mathrm{R}^{m}$ and $\overline{w}\in C$ such that $(\overline{x},\overline{\lambda},\overline{w},\overline{\mu})$ is feasible

for $(\mathrm{M}\mathrm{F}\mathrm{D})_{M}$ and $\langle\overline{w},\overline{x}\rangle=s(\overline{x}|C)$. Moreover, if the weak duality holds, then $(\overline{x},\overline{\lambda},\overline{w},\overline{\mu})$ is

a

weakly efficient solution of $(\mathrm{M}\mathrm{F}\mathrm{D})_{M}$.

If $I=\emptyset$ and $J=M$,

then

$(\mathrm{M}\mathrm{F}\mathrm{D})c$ is

reduced

to the following Wolfe type

(8)

$(\mathrm{M}\mathrm{F}\mathrm{D})_{W}$ Maximize $( \frac{f_{1}(u)+\langle w_{1},u\rangle}{g_{1}(u)}+\sum_{j=1}^{m}\mu_{j}l\iota_{j}(u)$ ,

.

. .,

$\frac{f_{p}(u)+\langle w_{p},u\rangle}{g_{p}(u)}+\sum_{j=1}^{m}\mu_{j}h_{j}(u))$

subject to $\sum_{i=1}^{p}\lambda_{i}\nabla(\frac{f_{i}(u)+\langle w_{i},u\rangle}{g_{i}(u)})+\sum_{j=1}^{m}\mu_{j}\nabla h_{j}(u)=0$,

$w_{i}\in C_{i}i=1,$ $\ldots,p$,

$(\mu_{1}, \ldots, \mu_{m})\geqq 0$, $\lambda=(\lambda_{1}, \ldots, \lambda_{p})\in\Lambda^{+}$,

where $\Lambda^{+}=\{\lambda\in \mathrm{R}^{p} : \lambda\geqq 0, \lambda^{T}e=1, e= (1, \ldots , 1)\in \mathrm{R}^{p}\}$.

Theorem 4.3. Weak Duality Let $x\in S$ be a feasible for (MFP)

and $(u, \lambda, w, \mu)$ be

a

feasible for $(\mathrm{M}\mathrm{F}\mathrm{D})_{W}$. Assume that the functions $f(\cdot)+$ $\langle w, \cdot\rangle,$$-g(\cdot)$ and $h(\cdot)$

are

(V,$\rho$)-invex functions

over

$S$ with respect to the

same

$\eta$ with $\sum_{i=1}^{\mathrm{p}}\lambda_{i}\rho_{i}\geqq 0$

.

Then the following cannot hold;

$\frac{f(x)+s(x|C)}{g(x)}<\frac{f(u)+\langle w,u\rangle}{g(u)}+\sum_{j=1}^{m}\mu_{j}h_{j}(u)e$.

Theorem 4.4. StrongDuality If$\overline{x}$is

a

weaklyefficient

so

lutionof(MFP),

and

assume

that there exists $z^{*}\in \mathrm{R}^{n}$ such that $\langle\nabla h_{j}(\overline{x}), z^{*}\rangle>0,$ $j\in I(\overline{x})$,

then there exists $\overline{\lambda}\in \mathrm{R}^{p},\overline{\mu}\in \mathrm{R}^{m}$ and $\overline{w}\in C$ such that $(\overline{x},\overline{\lambda},\overline{w},\overline{\mu})$ is feasible

for $(\mathrm{M}\mathrm{F}\mathrm{D})_{W}$ and $\langle\overline{w},\overline{x}\rangle=s(\overline{x}|C)$. Moreover, if the weak duality holds, then $(\overline{x},\overline{\lambda},\overline{w},\overline{\mu})$ is

a

weakly efficient solution of

$(\mathrm{M}\mathrm{F}\mathrm{D})_{W}$.

5

Conclusions

We introduce

a

class of nondifferentiable multiobjective fractional

program-ming problem (MFP) with $(\mathrm{V},\rho)$-invexity. We present the concept of $(\mathrm{V},\rho)-$

invexity for vector valued functions and give Fritz John and Kuhn-Tucker

nec-essary,

sufficient

optimality conditions forweakly efficientsolutionsof

our

prob-lem, in which eachcomponentofthe obj ectivefunctioncontains

a

terminvolving

(9)

Also we

formulate

a

general dual problern $(\mathrm{M}\mathrm{F}\mathrm{D})_{G}$ to the prinlal problem

(MFP) and prove the weak and strong duality theorems. Furthermore,

we

obtain

some

special

cases

of

our

duality results.

Our

results may serve as a framework for further reserch in this growing

area

of multiobjective fractional

programming problems.

References

1. BECTOR, C.R., CHANDRA, S., and HUSAIN, I., Optimaliiy

Conditions

and

Subdifferentiable

Multiobjective $F\succ actional$ Programming, Journal of

Optimization Theory and Applications, Vol. 79, pp. 105-125,

1993.

2. HANSON, M.A.,

On

Sufficiency

of

the Kuhn-Tucker Conditions, Journal

of Mathematical Analysis and Applications, Vol. 80, pp. 544-550, 1981.

3 JEYAKUMAR, V., Equivalence

of

Saddle-Points and Optima, and Duality

for

a Class

of

Nonsmooth Non-convex Problems, Journal ofMathematical

Analysis and Applications, Vol. 130, pp. 334-343,

1988.

4. JEYAKUMAR, V., and MOND, B.,

On Generalized Convex

Mathematical

Programming, Journal of the Australian Mathematical Society, Vol. $34\mathrm{B}$,

pp. 43-53, 1992.

5. KHAN, ZULFIQAR A., and HANSON, MORGAN A.,

On

Ratio Invexity in

Mathematical Programming, Journal of Mathematical Analysis and

Ap-plications, Vol. 205, pp. 330-336,

1997.

6.

KIM, D. S., KIM, S. J., and KIM, M. H., Optimality and duality

for

a

class

of nondifferentiable

multiobjective programmingproblems, To appear

in Journal of Optimization Theory and Applications.

7. KUK, H., LEE, G.M., and KIM, D.S., Nonsmooth Multiobjective

Pro-grams

with $(V_{f}\rho)$-Invexity, Indian Journal of Pure and Applied

Mathe-matics, Vol. 29, pp. 405-412, 1998.

8.

KUK, H., LEE, G.M., and TANINO, T., Optimality and Duality

for

Non-smooth Multiobjective Fractional Programming with

Generalized

Invexity,

Journal of Mathematical Analysis and Applications, Vol. 262, pp.

365-375,

2001.

9. LIU, J.C., Optimality and Duality

for

Multiobjective Fractional

Program-ming Involving NonsmoothPseudoinvex Functions, Optimization, Vol. 37, pp. 27-39, (1996).

10.

LIU, J.C., Optimality and Duality

for

Multiobjective Fkactional Program-ming InvolvingNonsmoothFunctions, Optimization, Vol. 36, pp. 333-346,

(10)

11. LIANG, Z., HUANG, H., and PARDALOS, P.M., Optimality Conditions

and Duality

for

a Class

of

Nonlinear Fractional Programming Problems,

Journal of OptimizationTheory and Applications, Vol. 110, pp. 611-619,

2001.

12. LIANG, Z., HUANG, H., and PARDALOS, P.M., Efficiency

Conditions

and

Duality

for

a

Class

of

Multiobjective

Fractional

Programming Problems,

Journal

ofGlobal Optimization, Vol. 27, pp. 444-471,

2003.

13.

MISHRA, S.K., and MUKHERJEE, R.N.,

On

Generalized Convex

Multi-objective Nonsmooth Programming,

Journal

of the Australian

Mathemat-ical Society, Vol. $38\mathrm{B}$, pp. 140-148,

1996.

14. VENKATESWARA REDDY L., and MUKHERJEE, R.N., Some Results

on

Mathematical Programming with Generalized Ratio Invenity, Journal of

Mathematical Analysis and Applications, Vol. 240, pp. 299-310, 1999.

15. MOND, B., and SCHECHTER, M.,

Nondifferentiable

Symmetric Duality,

Bulletin of the Australian Mathematical Society, Vol. 53, pp. 177-187,

参照

関連したドキュメント

Note that most of works on MVIs are traditionally de- voted to the case where G possesses certain strict (strong) monotonicity properties, which enable one to present various

Restricting the input to n-vertex cubic graphs of girth at least 5, we apply a modified algorithm that is based on selecting vertices of minimum degree, using operations that remove

theorems, the author showed the existence of positive solutions for a class of singular four-point coupled boundary value problem of nonlinear semipositone Hadamard

In the further part, using the generalized Dirac matrices we have demonstrated how we can, from the roots of the d’Alembertian operator, generate a class of relativistic

In the further part, using the generalized Dirac matrices we have demonstrated how we can, from the roots of the d’Alembertian operator, generate a class of relativistic

Wu, “Positive solutions of two-point boundary value problems for systems of nonlinear second-order singular and impulsive differential equations,” Nonlinear Analysis: Theory,

Owa, “Extensions of sufficient conditions for starlikeness and convexity of

Zembayashi, “Strong and weak convergence theorems for equilibrium problems and relatively nonexpansive mappings in Banach spaces,” Nonlinear Analysis: Theory, Methods