- Research
- Open Access
- Published:
On ϵ-solutions for robust fractional optimization problems
Journal of Inequalities and Applications volume 2014, Article number: 501 (2014)
Abstract
We consider ϵ-solutions (approximate solutions) for a fractional optimization problem in the face of data uncertainty. Using robust optimization approach (worst-case approach), we establish optimality theorems and duality theorems for ϵ-solutions for the fractional optimization problem. Moreover, we give an example illustrating our duality theorems.
MSC:90C25, 90C32, 90C46.
1 Introduction
A robust fractional optimization problem is to optimize an objective fractional function over the constrained set defined by functions with data uncertainty.
To get the ϵ-solution (approximate solution), many authors have established ϵ-optimality conditions and ϵ-duality theorems for several kinds of optimization problems [1–7]. Especially, Lee and Lee [8] gave an ϵ-duality theorems for a convex semidefinite optimization problem with conic constraints. Also, they [9] established optimality theorems and duality theorems for ϵ-solutions for convex optimization problems with uncertainty data.
In [10–15], many authors have treated fractional programming problems in the absence of data uncertainty. Recently, many authors have studied robust optimization problems [9, 16–21]. Very recently, Jeyakumar and Li [22] established duality theorems for a fractional programming problem in the face of data uncertainty via robust optimization.
The purpose of the paper is to extend the ϵ-optimality theorems and ϵ-duality theorems in [9] to fractional optimization problems with uncertainty data.
Consider the following standard form of fractional programming problem with a geometric constraint set:
where , , are convex functions, C is a closed convex cone of , and is a concave function such that, for any , and .
The fractional programming problem (FP) in the face of data uncertainty in the constraints can be captured by the problem:
where , , and are convex, and , is concave, and , , and are uncertain parameters which belong to the convex and compact uncertainty sets , , and , , respectively.
We study ϵ-optimality theorems and ϵ-duality theorems for the uncertain fractional programming model problem (UFP) by examining its robust (worst-case) counterpart [18]:
Clearly, is a feasible set of (RFP).
Let . Then is called an ϵ-solution of (RFP) if, for any ,
Using the parametric approach, we transform the problem (RFP) into the robust non-fractional convex optimization problem with a parametric :
Let . Then is called an ϵ-solution of if, for any ,
In this paper, we consider ϵ-solutions for (RFP), and we establish optimality theorems and duality theorems for ϵ-solutions for the robust fractional optimization problem. Moreover, we give an example for our duality theorems.
2 Preliminaries
Let us first recall some notation and preliminary results which will be used throughout this paper. denotes the Euclidean space with dimension n. The nonnegative orthant of is denoted by and is defined by . We say the set A is convex whenever for all , . A function is said to be convex if, for all ,
for all . The function f is said to be concave whenever −f is convex. Let be a convex function. The subdifferential of g at is defined by
where is the inner product on and . Let . Then the ϵ-subdifferential of g at is defined by
The function f is said to be proper if for all . We say f is a lower semicontinuous function if for all . As usual, for any proper convex function g on , its conjugate function is defined, for any , by . The epigraph of a function , epig, is defined by . We denote the convex hull of a subset A of by coA, and denote the closure of the set A by clA. Let C be a closed convex set in and . Then the normal cone to C at x is defined by
and we let , then the ϵ-normal cone to C at x is defined by
When C is a closed convex cone in , we denote by and call it the negative dual cone of C.
Proposition 2.1 [23]
Let be a convex function and let be the indicator function with respect to a closed convex subset C of , that is, if , and if . Let . Then
If is a proper lower semicontinuous convex function and if , then
Proposition 2.3 [26]
Let be a convex function and be a proper lower semicontinuous convex function. Then
Moreover, if are proper lower semicontinuous convex functions, and if , then
Let , (where I is an arbitrary index set), be a proper lower semicontinuous convex function. Suppose that there exists such that . Then
Proposition 2.5 [23]
Let , , be proper lower semicontinuous convex functions. Let . If , where is the relative interior of , then for all ,
Proposition 2.6 [9]
Let , , be continuous functions such that, for all , is a convex function and let C be a closed convex cone of . Suppose that each , , is compact and convex, and there exists such that , for all , . Then
is closed.
Proposition 2.7 [9]
Let , , be continuous functions and let C be a closed convex cone of . Suppose that each , , is convex, for all , is a convex function, and, for each , is concave on . Then
is convex.
Now we give the following relation between the ϵ-solutions of (RFP) and .
Lemma 2.1 Let and let . If , then the following statements are equivalent:
-
(i)
is an ϵ-solution of (RFP);
-
(ii)
is an -solution of , where and .
Proof (⇒) Let be an ϵ-solution of (RFP). Then for any , . Put and . Then we have, for any , . Since , for any ,
Hence is an -solution of .
(⇐) Let be an -solution of . Then for any , . Since , for any , . So, we have . Since ,
Hence is an ϵ-solution of (RFP). □
3 ϵ-Optimality theorems
In this section, we establish ϵ-optimality theorems for ϵ-solutions for the robust fractional optimization problem.
Now we give the following lemma which is the robust version of Farkas lemma for non-fractional convex functions.
Lemma 3.1 Let and , , be functions such that, for any , and, for each , are convex functions, and, for any , is concave function. Let be a function such that, for any , is a concave function, and, for all , is a convex function. Let , , and , be convex and compact sets. Let and let C be a closed convex cone of . Assume that . Then the following statements are equivalent:
-
(i)
;
-
(ii)
there exist and such that
-
(iii)
-
(iv)
Proof Let . Then . We will prove that . For any ,
Thus, by Propositions 2.3 and 2.4, we have
[(i) ⇔ (iv)] Now we assume that the statement (iv) holds. Then, by Proposition 2.3, the statement (iv) is equivalent to
Equivalently, by definition of epigraph of ,
From the definition of a conjugate function, for any ,
It is equivalent to the statement that, for any ,
[(ii) ⇔ (iii)] Now we assume that the statement (iii) holds. Then the statement (iii) is equivalent to
It means that there exist and such that
It is equivalent to the statement that there exist and such that
From the definition of a conjugate function, there exist and such that, for any ,
It means that there exist and such that, for any ,
[(iii) ⇔ (iv)] To get the desired result, it suffices to show that
By Proposition 2.4, . Let and let . Then there exist such that and , that is, and . Using the definition of a conjugate function, we have, for all ,
Since, for all , is concave, we have , i.e.,
So, from (3) and (4), we have, for all ,
and so . Hence, we have
So, is convex.
Now we show that is closed. Let
with as . Then there exists such that . Since is compact, we may assume that as . So, for each ,
Since, for all , is concave, is continuous. Passing to the limit as , we get, for each , . Hence, we have
So, is closed. Thus, (1) holds.
Moreover, since, for all , is convex and , for all , is concave. So, similarly, we can prove that (2) holds. □
Remark 3.1 Using convex-concave minimax theorem (Corollary 37.3.2 in [27]), we can prove that the statement (i) in Lemma 3.1 is equivalent to the statement (ii) in Lemma 3.1.
Remark 3.2 From proving in Lemma 3.1 that the statement (i) is equivalent to the statement (iv), we see that we can prove the equivalent relation without the assumptions that, for all , , and are concave and convex, respectively.
From Lemmas 2.1 and 3.1, we can get the following theorem.
Theorem 3.1 Let and , , be functions such that, for any , , and, for each , are convex functions, and, for any , is concave function. Let be a function such that, for any , is a concave function, and, for all , is a convex function. Let , , and , . Let and let . Suppose that is closed and convex. Then the following statements are equivalent:
-
(i)
is an ϵ-solution of (RFP);
-
(ii)
There exist , , , and , such that, for any ,
Proof (⇒) Let be an ϵ-solution of (RFP). Then, by Lemma 2.1, equivalently, is an -solution of , where and , that is, for any , . Since , we have . Then, by Lemma 3.1, we have
Moreover, by assumption,
So, there exist , , , and , such that
Then there exist , , , , , , , , and such that
So, and . Hence, for any ,
Since , , , , and , from (5), for any ,
(⇐) Suppose that there exist , , , and , , such that, for any ,
Since , we have . So, from (6), we have, for any ,
Hence, for any , . It means that is an -solution of . Thus, by Lemma 2.1, is an ϵ-solution of (RFP). □
Using Remark 3.2 and Lemmas 2.1 and 3.1, we can obtain the following characterization of an ϵ-solution for (RFP).
Theorem 3.2 (ϵ-Optimality theorem)
Let and , , be functions such that, for any , , and, for each , are convex functions. Let be a function such that, for any , is a concave function. Let , , and , . Let and let . Let . If , then is an ϵ-solution of (RFP). If and
is closed and convex, then the following statements are equivalent:
-
(i)
is an ϵ-solution of (RFP);
-
(ii)
there exist and , , , , and , such that
(7)(8)(9)
Proof [(i) ⇒ (ii)] We assume that is an ϵ-solution of (RFP). Then, by Lemma 2.1, is an -solution of , where and , that is, for any , . Since , we have . By Lemma 3.1,
By assumption,
So, there exist and , , such that
By Proposition 2.2, we obtain
So, there exist , , , , , , , and such that
By Proposition 2.5, there exist , , , , , , , , and such that
Since ,
So, (8) holds, and so, from (10) and (11), we have
Thus the conditions (7) and (9) hold.
[(ii) ⇒ (i)] Taking account of the converse of the process for proving (i) ⇒ (ii), we can easily check that the statement (ii) ⇒ (i) holds. □
If for all , is concave, and, for all , is convex, then using Lemmas 2.1 and 3.1, we can obtain the following characterization of an ϵ-solution for (RFP).
Theorem 3.3 (ϵ-Optimality theorem)
Let and , , be functions such that, for any , , and, for each , are convex functions, and, for all , is concave function. Let be a function such that, for any , is a concave function, and, for all , is a convex function. Let , , and , . Let and let . Let . If , then is an ϵ-solution of (RFP). If and
is closed and convex, then the following statements are equivalent:
-
(i)
is an ϵ-solution of (RFP);
-
(ii)
there exist , , , , , , , and , such that
(12)(13)(14)
Proof [(i) ⇒ (ii)] Let be an ϵ-solution of (RFP). Then, by Lemma 2.1, is an -solution of , where and , that is, for any , . Since , we have . By Lemma 3.1,
By assumption,
Since , there exist , , , and , , such that
By Proposition 2.2, we obtain
So, there exist , , , , , , , and such that
By Proposition 2.5, there exist , , , , , , , , and such that
Since , we have . So, we have
So, the condition (13) holds. Also, from (15) and (16), we have
Consequently, the conditions (12) and (14) hold.
[(ii) ⇒ (i)] Taking account of the converse of the process for proving (i) ⇒ (ii), we can easily check that the statement (ii) ⇒ (i) holds. □
Remark 3.3 Assume that and are functions such that, for all , , and are concave and convex, respectively. Then we know that Theorem 3.2 is equivalent to Theorem 3.3 from Lemma 3.1, immediately.
4 ϵ-Duality theorems
Following the approach in [13], we formulate a dual problem (RFD) for (RFP) as follows:
Clearly,
is the feasible set of (RFD).
Let . Then is called an ϵ-solution of (RFD) if, for any , .
When , , , and , , (RFP) becomes (FP), and (RFD) collapses to the Mond-Weir type dual problem (FD) for (FP) as follows [28]:
Now, we prove ϵ-weak and ϵ-strong duality theorems which hold between (RFP) and (RFD).
Theorem 4.1 (ϵ-Weak duality theorem)
For any feasible x of (RFP) and any feasible of (RFD),
Proof Let x and be feasible solutions of (RFP) and (RFD), respectively. Then there exist , , , , , , , , and such that
Thus, we have
Hence, we have . □
Theorem 4.2 (ϵ-Strong duality theorem)
Suppose that
is closed. If is an ϵ-solution of (RFP) and , then there exist , , and such that is a 2ϵ-solution of (RFD).
Proof Let be an ϵ-solution of (RFP). Let . Then, by Theorem 3.2, there exist , , , , , , and such that
So, is a feasible solution of (RFD). For any feasible of (RFD), it follows from Theorem 4.1 (ϵ-weak duality theorem) that
Thus is a 2ϵ-solution of (RFD). □
Remark 4.1 Using the optimality conditions of Theorem 3.2, robust fractional dual problem (RFD) for a robust fractional problem (RFP) in the convex constraint functions with uncertainty is formulated. However, when we formulated the dual problem using optimality condition in Theorem 3.3, we could not know whether ϵ-weak duality theorem is established, or not. It is an open question.
Now we give an example illustrating our duality theorems.
Example 4.1 Consider the following fractional programming problem with uncertainty:
where and .
Now we transform the problem (RFP) into the robust non-fractional convex optimization problem with a parametric :
Let , , , and . Then is the set of all robust feasible solutions of (RFP) and is the set of all ϵ-solutions of (RFP). Let F := { ∈ + + + , , , , , , , , , }. Then we formulate a dual problem (RFD) for (RFP) as follows:
Then F is the set of all robust feasible solutions of (RFD).
Now we calculate the set .