Abstract
In this paper, we construct six generalized second-order parameter-free duality models, and prove several weak, strong, and strict converse duality theorems for a discrete minmax fractional programming problem using two partitioning schemes and various types of generalized second-order \((\mathcal {F},\beta ,\phi ,\rho ,\theta ,m)\)-univexity (more compactly, ’second-order univexity’ is referred to as ’sounivexity’) assumptions. The obtained results are new and generalize most of results on discrete minmax fractional programming involving the second-order invexity as well as on second-order univexity in the literature.
Similar content being viewed by others
Avoid common mistakes on your manuscript.
Introduction and preliminaries
Based on a close observation on second-order necessary and sufficient optimality conditions for minmax fractional programming problems, which have not received much attention in the literature of mathematical programming, that is in sharp contrast to the case of minmax programming problems, numerous second-order necessary and sufficient optimality conditions for various classes of nonlinear programming problems with single and multiple objective functions have been investigated in the literature, including [1, 8–11, 13, 15, 19–21]. However, none of the sufficient optimality conditions discussed in these publications involve developing any kind of second-order duality theory for any type of optimization problems. The notion of duality for generalized linear fractional programming was initially considered by von Neumann [14] to the context of an economic equilibrium problem. However, a significant number of optimality criteria, duality results, and computational algorithms for several classes of generalized linear and nonlinear fractional programming problems have appeared in the related literature, for example in the publications [2–7, 12, 14, 16–18, 22–25]. Verma and Zalmai [10] dealt with some details on discrete minmax fractional programming, a fairly extensive list of currently available publications dealing with various second-order necessary and sufficient optimality conditions for several types of optimization problems, some modifications of the concepts of second-order invexity, pseudoinvexity, and quasiinvexity originally defined by Hanson [3], a set of second-order necessary optimality conditions, and making use of the new classes of generalized second-order invex functions, a fairly large number of sets of second-order sufficient optimality criteria. The sufficient optimality conditions established in [10] are further generalized in [12] using various generalized second-order \((\phi ,\eta ,\rho ,\theta ,m)\)-invexity assumptions. For more details on generalized linear and nonlinear fractional programming problems, we refer the reader [1–25].
In this paper, it is our intention to lay the theoretical foundation which will enable us to fully investigate the second-order optimality and duality aspects of our following principal problem (P) as well as its semiinfinite counterpart in a series of papers. We begin our investigation here by establishing a set of second-order parametric necessary optimality conditions and several sets of sufficient optimality conditions for principal problem (P). Furthermore, we utilize two partitioning schemes due to Mond and Weir [7] and Yang [18], in conjunction with the generalized versions of the new classes of second-order invex functions introduced in (Verma and Zalmai [10]) to formulate six generalized parameter-free duality models for principal problem (P) and prove appropriate duality theorems. The duality models and the related duality theory established in this paper generalize most of results available in the literature, including those results published in [2–7, 12, 16, 18, 22–25].
To the best of our knowledge, all of these duality results established in this paper are new in the area of discrete minmax fractional programming. In fact, it seems that results of this type, which are based on second-order necessary and sufficient optimality conditions, have not yet appeared in any shape or form for any type of mathematical programming problems in the literature.
Now, we formulate six generalized second-order parameter-free duality models and prove a variety of weak, strong, and strict converse duality theorems for the following discrete minmax fractional programming problem:
subject to \(G_{j}(x) \le 0, j \in \underline{q}, H_{k}(x) = 0, k \in \underline{r}, x \in X\),
where x is an open convex subset of \(\mathbb {R}^{n}\) (n-dimensional Euclidean space), \( f_{i}, g_{i}, i \in \underline{p}\equiv \{1,2,\dots ,p\},\) \( G_{j}, j \in \underline{q}\), and \(H_{k}, k \in \underline{r}\), are real-valued functions defined on X, and for each \(i \in \underline{p}, g_{i}(x) > 0\) for all x satisfying the constraints of (P).
Evidently, all the duality results established in this paper can be modified and restated for each one of the following three classes of nonlinear programming problems, which are special cases of (P):
where \(\mathbb {F}\) (assumed to be nonempty) is the feasible set of (P), that is,
Since, in most cases, these results can easily be altered and rephrased for each one of the above three problems, we shall not state them explicitly.
The rest of this paper is organized as follows: In Sect. 1, we present the historical development and introduce/recall a few basic definitions and auxiliary results that will be used in the sequel. In Sect. 2, we utilize a partitioning scheme due to Mond and Weir [7], and formulate two general second-order parameter-free duality models for (P) and prove weak, strong, and strict converse duality theorems using various generalized \((\mathcal {F},\beta ,\phi ,\rho ,\theta ,m)\)-sounivexity assumptions. We continue our discussion of duality in Sects. 3 and 4 where we construct four additional general second-order parameter-free duality models with different constraint structures and prove several second-order duality results under a variety of generalized \((\mathcal {F},\beta ,\phi ,\rho ,\theta ,m)\)-sounivexity conditions. Finally, in Sect. 5, we summarize our main results and also point out some research opportunities arising from certain modifications of the principal minmax model investigated in this study.
We next introduce the new classes of ‘second-order univex’ functions (referred to as “sounivex” functions). The notion of ‘sounivexity’ generalizes the notion of ‘second-order invexity,’ which is referred to as “sonvexity” in the literature. Let \(f: X \rightarrow \mathbb {R}\) be a twice differentiable function.
Definition 1.1
The function f is said to be (strictly) \((\mathcal {F},\beta ,\phi ,\rho ,\theta ,m)\) -sounivex at \(x^{*}\) if there exist functions \(\beta : X\times X \rightarrow \mathbb {R}_{+} \equiv (0,\infty ), \phi : \mathbb {R} \rightarrow \mathbb {R}, \rho : X \times X \rightarrow \mathbb {R}, \theta : X \times X \rightarrow \mathbb {R}^{n}\), a sublinear function \(\mathcal {F}(x,x^{*};\cdot ) : \mathbb {R}^{n} \rightarrow \mathbb {R}\), and a positive integer m, such that for each \(x \in X (x \ne x^{*})\) and \(z \in \mathbb {R}^{n}\),
where \(\Vert \cdot \Vert \) is a norm on \(\mathbb {R}^{n}\) and \(\langle a,b\rangle \) is the inner product of the vectors a and b.
The function f is said to be (strictly) \((\mathcal {F},\beta ,\phi ,\rho ,\theta ,m)\) -sounivex on X if it is (strictly) \((\mathcal {F},\beta ,\phi ,\rho ,\theta ,m)\) -sounivex at each \(x^{*} \in X\).
Definition 1.2
The function f is said to be (strictly) \((\mathcal {F},\beta ,\phi ,\rho ,\theta ,m)\) -pseudosounivex at \(x^{*}\) if there exist functions \(\beta : X\times X \rightarrow \mathbb {R}_{+}, \phi : \mathbb {R} \rightarrow \mathbb {R}, \rho : X \times X \rightarrow \mathbb {R}, \theta : X \times X \rightarrow \mathbb {R}^{n}\), a sublinear function \(\mathcal {F}(x,x^{*};\cdot ) : \mathbb {R}^{n} \rightarrow \mathbb {R}\), and a positive integer m, such that for each \(x \in X (x \ne x^{*})\) and \(z \in \mathbb {R}^{n}\),
The function f is said to be (strictly) \((\mathcal {F},\beta ,\phi ,\rho ,\theta ,m)\) -pseudosounivex on X if it is (strictly) \((\mathcal {F},\beta ,\phi ,\rho ,\theta ,m)\) -pseudosounivex at each \(x^{*} \in X\).
Definition 1.3
The function f is said to be (prestrictly) \((\mathcal {F},\beta ,\phi ,\rho ,\theta ,m)\) -quasisounivex at \(x^{*}\) if there exist functions \(\beta : X\times X \rightarrow \mathbb {R}_{+}, \phi : \mathbb {R} \rightarrow \mathbb {R}, \rho : X \times X \rightarrow \mathbb {R}, \theta : X \times X \rightarrow \mathbb {R}^{n}\), a sublinear function \(\mathcal {F}(x,x^{*};\cdot ) : \mathbb {R}^{n} \rightarrow \mathbb {R}\), and a positive integer m, such that for each \(x \in X\) and \(z \in \mathbb {R}^{n}\),
The function f is said to be (prestrictly) \((\mathcal {F},\beta ,\phi ,\rho ,\theta ,m)\) -quasisounivex on X if it is (prestrictly) \((\mathcal {F},\beta ,\phi ,\rho ,\theta ,m)\) -quasisounivex at each \(x^{*} \in X\).
From the above definitions, it is clear that if f is \((\mathcal {F},\beta ,\phi ,\rho ,\theta ,m)\)-sounivex at \(x^{*}\), then it is both \((\mathcal {F},\beta ,\phi ,\rho ,\theta ,m)\)-pseudosounivex and \((\mathcal {F},\beta ,\phi ,\rho ,\theta ,m)\)-quasisounivex at \(x^{*}\), if f is \((\mathcal {F},\beta ,\phi ,\rho ,\theta ,m)\)-quasisounivex at \(x^{*}\), then it is prestrictly \((\mathcal {F},\beta ,\phi ,\rho ,\theta ,m)\)-quasisounivex at \(x^{*}\), and if f is strictly \((\mathcal {F},\beta ,\phi ,\rho ,\theta ,m)\)-pseudosounivex at \(x^{*}\), then it is \((\mathcal {F},\beta ,\phi ,\rho ,\theta ,m)\)-quasisounivex at \(x^{*}\).
In the proofs of the duality theorems, sometimes, it may be more convenient to use certain alternative but equivalent forms of the above definitions. These are obtained by considering the contrapositive statements. For example, \((\mathcal {F},\beta ,\phi ,\rho ,\theta ,m)\)-quasisounivexity can be defined in the following equivalent way:
The function f is said to be \((\mathcal {F},\beta ,\phi ,\rho ,\theta ,m)\)-quasisounivex at \(x^{*}\) if there exist functions \(\beta : X\times X \rightarrow \mathbb {R}_{+}, \phi : \mathbb {R} \rightarrow \mathbb {R}, \rho : X \times X \rightarrow \mathbb {R}, \theta : X \times X \rightarrow \mathbb {R}^{n}\), a sublinear function \(\mathcal {F}(x,x^{*};\cdot ) : \mathbb {R}^{n} \rightarrow \mathbb {R}\), and a positive integer m, such that for each \(x \in X\) and \(z \in \mathbb {R}^{n}\),
Needless to say that the new classes of generalized convex functions specified in Definitions 1.1–1.3 contain a variety of special cases that can easily be identified by appropriate choices of \(\mathcal {F}, \beta , \phi , \rho , \theta \), and m. For example, if let \(\mathcal {F}\big (x,x^{*};\nabla f(x^{*})\big ) = \langle \nabla f(x^{*}),\eta (x,x^{*})\rangle \) and \(\beta (x,x^{*}) \equiv 1\), then we obtain the definitions of (strictly) \((\phi ,\eta ,\rho ,\theta ,m)\)-sonvex, (strictly) \((\phi ,\eta ,\rho ,\theta ,m)\)-pseudosonvex, and (prestrictly) \((\phi ,\eta ,\rho ,\theta ,m)\)-quasisonvex functions introduced recently in [10], where the “second-order invexity” is compactly abbreviated as “sonvexity.” The notion of the sonvexity/generalized sonvexity has been applied in developing a new optimality-duality theory in nonlinear programming based on second-order necessary and sufficient optimality conditions [1, 8–10, 12, 22].
Definition 1.4
The function f is said to be (strictly) \((\phi ,\eta ,\rho ,\theta ,m)\) -sonvex at \(x^{*}\) if there exist functions \(\phi : \mathbb {R} \rightarrow \mathbb {R}, \eta : X\times X \rightarrow \mathbb {R}^{n}, \rho : X \times X \rightarrow \mathbb {R}\), and \(\theta : X \times X \rightarrow \mathbb {R}^{n}\), and a positive integer m, such that for each \(x \in X (x \ne x^{*})\) and \(z \in \mathbb {R}^{n}\),
The function f is said to be (strictly) \((\phi ,\eta ,\rho ,\theta ,m)\)-sonvex on X if it is (strictly) \((\phi ,\eta ,\rho ,\theta ,m)\)-sonvex at each \(x^{*} \in X\).
Definition 1.5
The function f is said to be (strictly) \((\phi ,\eta ,\rho ,\theta ,m)\) -pseudosonvex at \(x^{*}\) if there exist functions \(\phi : \mathbb {R} \rightarrow \mathbb {R}, \eta : X\times X \rightarrow \mathbb {R}^{n}, \rho : X \times X \rightarrow \mathbb {R}\), and \(\theta : X \times X \rightarrow \mathbb {R}^{n}\), and a positive integer m, such that for each \(x \in X (x \ne x^{*})\) and \(z \in \mathbb {R}^{n}\),
equivalently,
The function f is said to be (strictly) \((\phi ,\eta ,\rho ,\theta ,m)\)-pseudosonvex on X if it is (strictly) \((\phi ,\eta ,\rho ,\theta ,m)\)-pseudosonvex at each \(x^{*} \in X\).
Definition 1.6
The function f is said to be (prestrictly) \((\phi ,\eta ,\rho ,\theta ,m)\) -quasisonvex at \(x^{*}\) if there exist functions \(\phi : \mathbb {R} \rightarrow \mathbb {R}, \eta : X\times X \rightarrow \mathbb {R}^{n}, \rho : X \times X \rightarrow \mathbb {R}\), and \(\theta : X \times X \rightarrow \mathbb {R}^{n}\), and a positive integer m, such that for each \(x \in X\) and \(z \in \mathbb {R}^{n}\),
equivalently
The function f is said to be (prestrictly) \((\phi ,\eta ,\rho ,\theta ,m)\)-quasisonvex on X if it is (prestrictly) \((\phi ,\eta ,\rho ,\theta ,m)\)-quasisonvex at each \(x^{*} \in X\).
Duality model I and duality theorems
We begin this section by recalling a set of second-order parameter-free necessary optimality conditions for (P). This result, which is obtained from Theorem 3.1 of [10] by eliminating the parameter \(\lambda ^{*}\) and redefining the Lagrange multipliers, will be needed for proving strong and strict converse duality theorems.
Theorem 2.1
[10] Let \(x^{*}\) be a normal optimal solution of (P) and assume that the functions \(f_{i},\, g_{i}, i \in \underline{p}, G_{j},\, j \in \underline{q}\) , and \(H_{k}, \, k \in \underline{r}\), are twice continuously differentiable at \(x^{*}\). Then, for each \(z^{*} \in C(x^{*})\) , there exist \(u^{*} \in U \equiv \{u \in \mathbb {R}^{p} : u \ge 0, \sum _{i=1}^{p}u_{i} = 1 \}, v^{*} \in \mathbb {R}^{q}_{+} \equiv \{v \in \mathbb {R}^{q} : v \ge 0 \}\) , and \(w^{*} \in \mathbb {R}^{r}\) , such that
where \(C(x^{*})\) is the set of all critical directions of (P) at \(x^{*}\) , that is
In the above theorem, a normal optimal solution refers to an optimal solution at which an appropriate second-order constraint qualification is satisfied.
In the remainder of this paper, we shall assume that the functions \(f_{i},\, g_{i},\, i \in \underline{p},\, G_{j},\, j \in \underline{q}\), and \(H_{k},\, k \in \underline{r}\), are twice continuously differentiable on the open set X. Moreover, we shall assume, without loss of generality, that for each \(i \in \underline{p}, f_{i}(x) \ge 0\) and \(g_{i}(x) > 0\) for all \(x \in X\).
Duality model I
In this section, we discuss several families of duality results under various generalized \((\mathcal {F},\beta ,\phi ,\rho ,\theta ,m)\)-sounivexity hypotheses imposed on certain combinations of the problem functions. This is accomplished by employing a certain partitioning scheme which was originally proposed in [7] for the purpose of constructing generalized dual problems for nonlinear programming problems. For this, we need some additional notation.
Let \(\{J_{0}, J_{1}, \ldots , J_{M}\}\) and \(\{K_{0}, K_{1}, \ldots , K_{M}\}\) be partitions of the index sets \(\underline{q}\) and \(\underline{r}\), respectively; thus, \(J_{\mu }\subseteq \underline{q}\) for each \(\mu \in \underline{M} \cup \{0\}, J_{\mu }\cap J_{\nu } = \emptyset \) for each \(\mu , \nu \in \underline{M}\cup \{0\}\) with \(\mu \ne \nu \), and \(\cup _{\mu = 0}^{M}J_{\mu } =\underline{ q}\). Obviously, similar properties hold for \(\{K_{0}, K_{1}, \ldots , K_{M}\}\). Moreover, if \(m_{1}\) and \(m_{2}\) are the numbers of the partitioning sets of \(\underline{q}\) and \(\underline{r}\), respectively, then \( M = \max \{m_{1}, m_{2}\}\) and \(J_{\mu } = \emptyset \) or \(K_{\mu } = \emptyset \) for \(\mu > \min \{m_{1}, m_{2}\}\).
In addition, we use the real-valued functions \(\xi \rightarrow \Phi (\xi ,u,v,w,\lambda )\), and \(\xi \rightarrow \Lambda _{t}(\xi ,v,w)\) defined, for fixed \(\lambda ,u, v\), and w, on X as follows:
Making use of the sets and functions defined above, we can now formulate our first pair of second-order parameter-free duality models for (P).
Consider the following two problems:
(DI) Maximize \(\dfrac{\sum _{i=1}^{p}u_{i}f_{i}(y) + \sum _{j \in J_{0}}v_{j}G_{j}(y) + \sum _{k \in K_{0}}w_{k}H_{k}(y)}{\sum _{i=1}^{p}u_{i}g_{i}(y)}\)
subject to
\((\tilde{D}I)\) Maximize \(\dfrac{\sum _{i=1}^{p}u_{i}f_{i}(y) + \sum _{j \in J_{0}}v_{j}G_{j}(y) + \sum _{k \in K_{0}}w_{k}H_{k}(y)}{\sum _{i=1}^{p}u_{i}g_{i}(y)}\)
where \(\mathcal {F}(x,y;\cdot )\) is a sublinear function from \(\mathbb {R}^{n}\) to \(\mathbb {R}\).
Comparing (DI) and \((\tilde{D}I)\), we see that \((\tilde{D}I)\) is relatively more general than (DI) in the sense that any feasible solution of (DI) is also feasible for \((\tilde{D}I)\), but the converse is not necessarily true. Furthermore, we observe that (2.1) is a system of n equations, whereas (2.5) is a single inequality. Clearly, from a computational point of view, (DI) is preferable to \((\tilde{D}I)\) because of the dependence of (2.5) on the feasible set of (P).
Despite these apparent differences, it turns out that the statements and proofs of all the duality theorems for \((P) - (DI)\) and \((P) - (\tilde{D}I)\) are almost identical and, therefore, we shall consider only the pair \((P) - (DI)\).
In the proofs of our duality theorems, we shall make frequent use of the following auxiliary result which provides an alternative expression for the objective function of (P).
Lemma 2.1
[8] For each \(x \in X\),
The next two theorems show that (DI) is a dual problem for (P).
Theorem 2.2
(Weak duality) Let x and \(\mathcal {S} \equiv (y,z,u,v,w)\) be arbitrary feasible solutions of (P) and (DI), respectively, and assume that any one of the following four sets of hypotheses is satisfied:
-
1.
-
(a)
\(\xi \rightarrow \Phi (\xi ,y,u,v,w)\) is \((\mathcal {F},\beta ,\bar{\phi },\bar{\rho },\theta ,m)\)-pseudosounivex at y and \(\bar{\phi }(a) \ge 0 \Rightarrow a \ge 0\);
-
(b)
For each \(t \in \underline{M}, \xi \rightarrow \Lambda _{t}(z,v,w)\) is \((\mathcal {F},\beta ,\tilde{\phi }_{t},\tilde{\rho }_{t},\theta ,m)\)-quasisounivex at y, \(\tilde{\phi }_{t}\) is increasing, and \(\tilde{\phi }_{t}(0) = 0\);
-
(c)
\(\bar{\rho }(x,y) + \sum _{t =1}^{M}\tilde{\rho }_{t}(x,y) \ge 0\);
-
(a)
-
2.
-
(a)
\(\xi \rightarrow \Phi (\xi ,y,u,v,w)\) is prestrictly \((\mathcal {F},\beta ,\bar{\phi },\bar{\rho },\theta ,m)\)-quasisounivex at y and \(\bar{\phi }(a) \ge 0 \Rightarrow a \ge 0\);
-
(b)
for each \(t \in \underline{M}, \xi \rightarrow \Lambda _{t}(\xi ,v,w)\) is \((\mathcal {F},\beta ,\tilde{\rho }_{t},\rho _{t},\theta ,m)\)-quasisounivex at y, \(\tilde{\phi }_{t}\) is increasing, and \(\tilde{\phi }_{t}(0) = 0\);
-
(c)
\(\bar{\rho }(x,y) + \sum _{t =1}^{M}\tilde{\rho }_{t}(x,y) > 0\);
-
(a)
-
3.
-
(a)
\(\xi \rightarrow \Phi (\xi ,y,u,v,w)\) is prestrictly \((\mathcal {F},\beta ,\bar{\phi },\bar{\rho },\theta ,m)\) -quasisounivex at \(y, \bar{\phi }\) is strictly increasing, and \(\bar{\phi }(0) = 0\);
-
(b)
For each \(t \in \underline{M}, \xi \rightarrow \Lambda _{t}(\xi ,v,w)\) is strictly \((\mathcal {F},\beta ,\tilde{\phi }_{t},\tilde{\rho }_{t},\theta ,m)\)-pseudosounivex at y, \(\tilde{\phi }_{t}\) is increasing, and \(\tilde{\phi }_{t}(0) = 0\);
-
(c)
\(\bar{\rho }(x,y) + \sum _{t =1}^{M}\tilde{\rho }_{t}(x,y) \ge 0\);
-
(a)
-
4.
-
(a)
\(\xi \rightarrow \Phi (\xi ,y,u,v,w)\) is prestrictly \((\mathcal {F},\beta ,\bar{\phi },\bar{\rho },\theta ,m)\)-quasisounivex at \(y, \bar{\phi }\) is strictly increasing, and \(\bar{\phi }(0) = 0\);
-
(b)
For each \( t \in \underline{M_{1}}, \xi \rightarrow \Lambda _{t}(\xi ,v,w)\) is \((\mathcal {F},\beta ,\tilde{\phi }_{t},\tilde{\rho }_{t},\theta ,m)\)-quasisounivex at y , for each \(t \in \underline{M_{2}}\ne \emptyset , \xi \rightarrow \Lambda _{t}(\xi ,v,w)\) is strictly \((\mathcal {F},\beta ,\tilde{\phi }_{t},\tilde{\rho }_{t},\theta ,m)\)-pseudosounivex at y , and for each \(t \in \underline{M}, \tilde{\phi }_{t}\) is increasing and \(\tilde{\phi }_{t}(0) = 0\) , where \(\{\underline{M_{1}}, \underline{M_{2}}\}\) is a partition of \(\underline{M}\);
-
(c)
\(\bar{\rho }(x,y) + \sum _{t =1}^{M}\tilde{\rho }_{t}(x,y) \ge 0\).
-
(a)
Then, \(\varphi (x) \ge \psi _{I}(y,u,v,w)\) , where \(\psi _{I}\) is the objective function of (DI).
Proof
(a) : Since \(\mathcal {F}(x,y;\cdot )\) is sublinear and \(\beta (x,y) > 0\), it is clear that (2.1) and (2.2) can be expressed as follows:
Since for each \(t \in \underline{M}\),
and hence, \(\tilde{\phi }_{t}(\Lambda _{t}(x,v,w) - \Lambda _{t}(y,v,w)) \le 0\), it follows from (ii) that
Summing over \(t \in \underline{M}\) and using the sublinearity of \(\mathcal {F}(x,y;\cdot )\), we obtain
Combining (2.6)–(2.8) and using (iii), we get
which by virtue of (i) implies that
However, \(\bar{\phi }(a) \ge 0 \Rightarrow a \ge 0\), and hence, we get
where the equality follows from the definitions of D(y, u), N(y, u), and \(\Lambda _{0}(y,v,w)\). Since \(x \in \mathbb {F}\), the above inequality reduces to
Now, using (2.10) and Lemma 2.1, we obtain the weak duality inequality as follows:
-
(b)
The proof is similar to that of part (a).
-
(c)
Suppose to the contrary that \(\varphi (x) < \psi _{I}(y,z,u,v,w)\). This implies that for each \(i \in \underline{p}\),
Using these inequalities, we see that
and hence, \(\bar{\phi }(\Phi (x,y,u,v,w) - \Phi (y,y,u,v,w)) < 0\) which by virtue of (i) implies that
Proceeding as in the proof of part (a), we obtain \(\tilde{\phi }_{t}\big (\Lambda _{t}(x,v,w) - \Lambda _{t}(y,v,w)\big ) \le 0\), which, because of (ii), implies that
Summing over \(t \in \underline{M}\) and using the sublinearity of \(\mathcal {F}(x,y;\cdot )\), we obtain
Combining this inequality with (2.6) and (2.7) and using (iii), we get
which contradicts (2.12). Therefore, we conclude that \(\bar{\phi }(x) \ge \psi _{I}(y,z,u,v,w)\).
-
(d)
The proof is similar to that of part (c).
\(\square \)
Theorem 2.3
(Strong duality) Let \(x^{*}\) be a normal optimal solution of (P) and assume that any one of the four sets of conditions specified in Theorem 2.2 is satisfied for all feasible solutions of (DI). Then, for each \(z^{*} \in C(x^{*})\) , there exist \(u^{*} \in U , v^{*} \in \mathbb {R}^{q}_{+}\) , and \(w^{*} \in \mathbb {R}^{r}\), such that \(\mathcal {S}^{*} \equiv (x^{*},z^{*} ,u^{*},v^{*},w^{*})\) is an optimal solution of (DI) and \(\varphi (x^{*}) = \psi _{I}(\mathcal {S}^{*})\).
Proof
Since \(x^{*}\) is a normal optimal solution of (P), by Theorem 2.1, for each \(z^{*} \in C(x^{*})\), there exist \(u^{*} \in U, \bar{v} \in \mathbb {R}^{q}_{+}\), and \(\bar{w} \in \mathbb {R}^{r}\), such that
Now, choosing \(v^{*}_{j} = \bar{v}_{j}/D(x^{*},u^{*})\) for each \(j \in J_{0}, v^{*}_{j} = \bar{v}_{j}\) for each \(j \in \underline{q}\backslash J_{0}, w^{*}_{k} = \bar{w}_{k}/D(x^{*},u^{*})\) for each \(k \in K_{0}\), and \(w^{*}_{k} = \bar{w}_{k}\) for each \(k \in \underline{r}\backslash K_{0}\), and noticing that \(x^{*} \in \mathbb {F}\), we deduce the following relations from (2.13) to (2.16):
From (2.17) to (2.19), it is clear that \(\mathcal {S}^{*}\) is a feasible solution of (DI), and from (2.20), we see that \(\varphi (x^{*}) = \psi _{I}(\mathcal {S}^{*})\). If \(\mathcal {S}^{*}\) were not an optimal solution of (DI), then there would exist a feasible solution \(\mathcal {S}^{\circ } \equiv (x^{\circ },z^{\circ },u^{\circ },v^{\circ },w^{\circ })\) of (DI), such that \(\psi _{I}(\mathcal {S}^{\circ }) > \psi _{I}(\mathcal {S}^{*}) = \varphi (x^{*})\), which contradicts Theorem 2.2. Therefore, we conclude that \(\mathcal {S}^{*}\) is an optimal solution of (DI). \(\square \)
Theorem 2.4
(Strict Converse Duality) Let \(x^{*}\) be a normal optimal solution of (P), let \(\tilde{\mathcal {S}} \equiv (\tilde{x},\tilde{z},\tilde{u},\tilde{v},\tilde{w})\) be an optimal solution of (DI), and assume that any one of the following four sets of conditions holds:
-
(a)
The assumptions specified in part (a) of Theorem 2.1 are satisfied for the feasible solution \(\tilde{\mathcal {S}}\) of (DI), \(\bar{\phi }(a)> 0 \Rightarrow a > 0\) , and the function \(\xi \rightarrow \Phi (\xi ,\tilde{x},\tilde{u},\tilde{v},\tilde{w})\) is strictly \((\mathcal {F},\beta ,\bar{\phi },\bar{\rho },\theta ,m)\) -pseudosounivex at \(\tilde{x}\).
-
(b)
The assumptions specified in part (b) of Theorem 2.1 are satisfied for the feasible solution \(\tilde{\mathcal {S}}\) of (DI), \(\bar{\phi }(a)> 0 \Rightarrow a > 0\) , and the function \(\xi \rightarrow \Phi (\xi ,\tilde{x},\tilde{u},\tilde{v},\tilde{w})\) is \((\mathcal {F},\beta ,\bar{\phi },\bar{\rho },\theta ,m)\) -quasisounivex at \(\tilde{x}\).
-
(c)
The assumptions specified in part (c) of Theorem 2.1 are satisfied for the feasible solution \(\tilde{\mathcal {S}}\) of (DI), \(\bar{\phi }(a)> 0 \Rightarrow a > 0\) , and the function \(\xi \rightarrow \Phi (\xi ,\tilde{x},\tilde{u},\tilde{v},\tilde{w})\) is \((\mathcal {F},\beta ,\bar{\phi },\bar{\rho },\theta ,m)\) -quasisounivex at \(\tilde{x}\).
-
(d)
The assumptions specified in part (d) of Theorem 2.1 are satisfied for the feasible solution \(\tilde{\mathcal {S}}\) of (DI), \(\bar{\phi }(a)> 0 \Rightarrow a > 0\) , and the function \(\xi \rightarrow \Phi (\xi ,\tilde{x},\tilde{u},\tilde{v},\tilde{w})\) is \((\mathcal {F},\beta ,\bar{\phi },\bar{\rho },\theta ,m)\) -quasisounivex at \(\tilde{x}\).
Then, \(\tilde{x} = x^{*}\) and \(\varphi (x^{*}) = \psi _{I}(\tilde{\mathcal {S}})\).
Proof
Since \(x^{*}\) is a normal optimal solution of (P), by Theorem 2.3, there exist \(z^{*} \in C(x^{*}), u^*, v^{*}\), and \(w^{*}\), such that \(\mathcal {S}^{*} \equiv (x^*,z^{*},u^*,v^{*},w^{*})\) is a feasible solution of (DI) and \(\varphi (x^{*}) = \psi _{I}(\mathcal {S}^{*})\). (a): Suppose to the contrary that \(\tilde{x} \ne x^{*}\). Now, proceeding as in the proof of part (a) of Theorem 2.2 (with x replaced by \(x^{*}\) and \(\mathcal {S}\) by \(\tilde{\mathcal {S}}\)), we arrive at the strict inequality
Using this inequality along with Lemma 2.1, as in the proof of Theorem 2.2, we get \(\varphi (x^{*}) > \psi _{I}(\tilde{\mathcal {S}})\), which contradicts the fact that \(\varphi (x^{*}) = \psi _{I}(\mathcal {S}^{*}) \le \psi _{I}(\tilde{\mathcal {S}})\). (b)–(d): The proofs are similar to that of part (a). \(\square \)
As pointed out earlier, the duality models (DI) and \((\tilde{D}I)\) are two families of dual problems whose members can easily be identified by appropriate choices of the partitioning sets \(J_{0}, J_{1}, \ldots , J_{M}, K_{0}, K_{1}, \ldots , K_{M}\). To illustrate this possibility, we shall next briefly discuss some special cases of (DI) and \((\tilde{D}I)\).
If we choose \(J_{0} = \underline{q}\) and \(K_{0} = \underline{r}\) in (DI) and \((\tilde{D}I)\), then we obtain the following dual problems for (P):
\((DIa) \text{ Maximize } \dfrac{\sum _{i=1}^{p}u_{i}f_{i}(y) + \sum _{j=1}^{q} v_{j}G_{j}(y) + \sum _{k=1}^{r}w_{k}H_{k}(y)}{\sum _{i=1}^{p}u_{i}g_{i}(y)}\)
subject to
where
\((\tilde{D}Ia) \text{ Maximize } \dfrac{\sum _{i=1}^{p}u_{i}f_{i}(y) + \sum _{j=1}^{q} v_{j}G_{j}(y) + \sum _{k=1}^{r}w_{k}H_{k}(y)}{\sum _{i=1}^{p}u_{i}g_{i}(y)}\)
subject to
where \(\mathcal {F}(x,y;\cdot )\) is a sublinear function from \(\mathbb {R}^{n}\) to \(\mathbb {R}\).
If we choose \(M = q + r, J_{0} = \emptyset , K_{0} = \emptyset , J_{t} =\{t\}, K_{t} = \emptyset , t \in \underline{q}\), and \(J_{t} = \emptyset , K_{t} = \{t\}, t \in \underline{r}\), then (DI) and \((\tilde{D}I)\) reduce to the following dual problems for (P):
\((DIb) \text{ Maximize } \dfrac{\sum _{i=1}^{p}u_{i}f_{i}(y)}{\sum _{i=1}^{p}u_{i}g_{i}(y)}\)
subject to
\((\tilde{D}Ib) \text{ Maximize } \dfrac{\sum _{i=1}^{p}u_{i}f_{i}(y)}{\sum _{i=1}^{p}u_{i}g_{i}(y)}\)
subject to
In a similar manner, we can identify many other special cases of (DI) and \((\tilde{D}I)\). Evidently, Theorems 2.1–2.3 can be specialized for \((DIa), (\tilde{D}Ia), (DIb)\), and \((\tilde{D}Ib)\) in a straightforward fashion.
The dual problems \((DIa), (\tilde{D}Ia), (DIb)\), and \((\tilde{D}Ib)\) were investigated previously in [10] with \(\mathcal {F}\big (x,x^{*};\nabla f(x^{*})\big ) = \langle \nabla f(x^{*}),\eta (x,x^{*})\rangle \), where \(\eta \) is a function from \(X\times X\) to \(\mathbb {R}^{n}\), and a great variety of duality results were established under various (strict) \((\phi ,\eta ,\rho ,\theta ,m)\)-sonvexity, (strict) \((\phi ,\eta ,\rho ,\theta ,m)\)-pseudosonvexity, and (prestrict) \((\phi ,\eta ,\rho ,\theta ,m)\)-quasisonvexity hypotheses.
Duality model II and duality theorems
In Theorems 2.2–2.4, various generalized \((\mathcal {F},\beta ,\phi ,\rho ,\theta ,m)\)-sounivexity conditions were imposed on the function \(\xi \rightarrow \Phi (\xi ,y,u,v,w)\), which is the weighted sum of the functions
In this section, we consider some generalized versions of (DI) and \((\tilde{D}I)\), and prove weak and strong duality theorems in which we assume that the individual functions \(\xi \rightarrow \Phi _{i}(\xi ,y,v,w), i \in \underline{p}\), satisfy appropriate generalized \((\mathcal {F},\beta ,\phi ,\rho ,\theta ,m)\)-sounivexity hypotheses. This can be accomplished by appending an additional system of inequality constraints to (DI) and \((\tilde{D}I)\).
Consider the following two problems:
(DII) Maximize \(\dfrac{\sum _{i=1}^{p}u_{i}f_{i}(y) + \sum _{j \in J_{0}}v_{j}G_{j}(y) + \sum _{k \in K_{0}}w_{k}H_{k}(y)}{\sum _{i=1}^{p}u_{i}g_{i}(y)}\)
subject to
\((\tilde{D}II)\) Maximize \(\dfrac{\sum _{i=1}^{p}u_{i}f_{i}(y) + \sum _{j \in J_{0}}v_{j}G_{j}(y) + \sum _{k \in K_{0}}w_{k}H_{k}(y)}{\sum _{i=1}^{p}u_{i}g_{i}(y)}\)
where \(\mathcal {F}(x,y;\cdot )\) is a sublinear function from \(\mathbb {R}^{n}\) to \(\mathbb {R}\).
The comments and observations made earlier about the relationship between (DI) and \((\tilde{D}I)\) are, of course, also valid for (DII) and \((\tilde{D}II)\).
The following two theorems show that (DII) is a dual problem for (P).
Theorem 3.1
(Weak duality) Let x and \(\mathcal {S} \equiv (y,z,u,v,w)\) be arbitrary feasible solutions of (P) and (DII), respectively, and assume that any one of the following seven sets of hypotheses is satisfied:
-
(a)
-
(i)
For each \(i \in I_{+} \equiv \{i \in \underline{p} : u_{i} > 0\}, \xi \rightarrow \Phi _{i}(\xi ,y,v,w)\) is \((\mathcal {F},\beta ,\bar{\phi }_{i},\bar{\rho }_{i},\theta ,m)\)-pseudosounivex at \(y, \bar{\phi }_{i}\) is strictly increasing, and \(\bar{\phi }_{i}(0) = 0\);
-
(ii)
For each \(t \in \underline{M}, \xi \rightarrow \Lambda _{t}(\xi ,v,w)\) is \((\mathcal {F},\beta ,\tilde{\phi }_{t},\tilde{\rho }_{t},\theta ,m)\)-quasisounivex at \(y, \tilde{\phi }_{t}\) is increasing, and \(\tilde{\phi }_{t}(0) = 0\);
-
(iii)
\(\sum _{i \in I_{+}}u_{i}\bar{\rho }_{i}(x,y) + \sum _{t=1}^{M}\tilde{\rho }_{t}(x,y) \ge 0\);
-
(i)
-
(b)
-
(i)
For each \(i \in I_{+}, \xi \rightarrow \Phi _{i}(\xi ,y,v,w)\) is prestrictly \((\mathcal {F},\beta ,\bar{\phi }_{i},\bar{\rho }_{i},\theta ,m)\)-quasisounivex at \(y, \bar{\phi }_{i}\) is strictly increasing, and \(\bar{\phi }_{i}(0) = 0\);
-
(ii)
For each \(t \in \underline{m}, \xi \rightarrow \Lambda _{t}(\xi ,v,w)\) is strictly \((\mathcal {F},\beta ,\tilde{\phi }_{t},\tilde{\rho }_{t},\theta ,m)\)-pseudosounivex at \(y, \tilde{\phi }_{t}\) is increasing, and \(\tilde{\phi }_{t}(0) = 0\);
-
(iii)
\(\sum _{i \in I_{+}}u_{i}\bar{\rho }_{i}(x,y) + \sum _{t=1}^{M}\tilde{\rho }_{t}(x,y) \ge 0\);
-
(i)
-
(c)
-
(i)
For each \(i \in I_{+}, \xi \rightarrow \Phi _{i}(\xi ,y,v,w)\) is prestrictly \((\mathcal {F},\beta ,\bar{\phi }_{i},\bar{\rho }_{i},\theta ,m)\)-quasisounivex at \(y, \bar{\phi }_{i}\) is strictly increasing, and \(\bar{\phi }_{i}(0) = 0\);
-
(ii)
For each \(t \in \underline{M}, \xi \rightarrow \Lambda _{t}(\xi ,v,w)\) is \((\mathcal {F},\beta ,\tilde{\phi }_{t},\tilde{\rho }_{t},\theta ,m)\)-quasisounivex at \(y, \tilde{\phi }_{t}\) is increasing, and \(\tilde{\phi }_{t}(0) = 0\);
-
(iii)
\(\sum _{i \in I_{+}}u_{i}\bar{\rho }_{i}(x,y) + \sum _{t=1}^{M}\tilde{\rho }_{t}(x,y) > 0\);
-
(i)
-
(d)
-
(i)
For each \(i \in I_{1+}, \xi \rightarrow \Phi _{i}(\xi ,y,v,w)\) is \((\mathcal {F},\beta ,\bar{\phi }_{i},\bar{\rho }_{i},\theta ,m)\)-pseudosounivex at y , for each \(i \in I_{2+}, \xi \rightarrow \Phi _{i}(\xi ,y,v,w)\) is prestrictly \((\mathcal {F},\beta ,\bar{\phi }_{i},\bar{\rho }_{i},\theta ,m)\)-quasisounivex at y, and for each \(i \in I_{+}, \bar{\phi }_{i}\) is strictly increasing and \(\bar{\phi }_{i}(0) = 0\), where \(\{I_{1+},I_{2+}\}\) is a partition of \(I_{+}\);
-
(ii)
For each \(t \in \underline{M}, \xi \rightarrow \Lambda _{t}(\xi ,v,w)\) is strictly \((\mathcal {F},\beta ,\tilde{\phi }_{t},\tilde{\rho }_{t},\theta ,m)\)-pseudosounivex at \(y, \tilde{\phi }_{t}\) is increasing, and \(\tilde{\phi }_{t}(0) = 0\);
-
(iii)
\(\sum _{i \in I_{+}}u_{i}\bar{\rho }_{i}(x,y) + \sum _{t=1}^{M}\tilde{\rho }_{t}(x,y) \ge 0\);
-
(i)
-
(e)
-
(i)
For each \(i \in I_{1+}\ne \emptyset , \xi \rightarrow \Phi _{i}(\xi ,y,v,w)\) is \((\mathcal {F},\beta ,\bar{\phi }_{i},\bar{\rho }_{i},\theta ,m)\)-pseudosounivex at y, for each \(i \in I_{2+}, \xi \rightarrow \Phi _{i}(\xi ,y,v,w)\) is prestrictly \((\mathcal {F},\beta ,\bar{\phi }_{i},\bar{\rho }_{i},\theta )\)-quasisounivex at y, and for each \(i \in I_{+}, \bar{\phi }_{i}\) is strictly increasing and \(\bar{\phi }_{i}(0) = 0\) , where \(\{I_{1+},I_{2+}\}\) is a partition of \(I_{+}\);
-
(ii)
For each \(t \in \underline{M}, \xi \rightarrow \Lambda _{t}(\xi ,v,w)\) is \((\mathcal {F},\beta ,\tilde{\phi }_{t},\tilde{\rho }_{t},\theta ,m)\)-quasisounivex at \(y, \tilde{\phi }_{t}\) is increasing, and \(\tilde{\phi }_{t}(0) = 0\);
-
(iii)
\(\sum _{i \in I_{+}}u_{i}\bar{\rho }_{i}(x,y) + \sum _{t=1}^{M}\tilde{\rho }_{t}(x,y) \ge 0\);
-
(i)
-
(f)
-
(i)
For each \(i \in I_{+}, \xi \rightarrow \Phi _{i}(\xi ,y,v,w)\) is prestrictly \((\mathcal {F},\beta ,\bar{\phi }_{i},\bar{\rho }_{i},\theta )\)-quasisounivex at \(y, \bar{\phi }_{i}\) is strictly increasing, and \(\bar{\phi }_{i}(0) = 0\);
-
(ii)
For each \(t \in \underline{M_{1}} \ne \emptyset , \xi \rightarrow \Lambda _{t}(\xi ,v,w)\) is strictly \((\mathcal {F},\beta ,\tilde{\phi }_{t},\tilde{\rho }_{t},\theta ,m)\)-pseudosounivex at y, for each \(t \in \underline{M_{2}}, \xi \rightarrow \Lambda _{t}(\xi ,v,w)\) is \((\mathcal {F},\beta ,\tilde{\phi }_{t},\tilde{\rho }_{t},\theta ,m)\)-quasisounivex at y, and for each \(t \in \underline{M}, \tilde{\phi }_{t}\) is increasing and \(\tilde{\phi }_{t}(0) = 0\) , where \(\{ \underline{M_{1}},\underline{M_{2}}\}\) is a partition of \(\underline{M}\);
-
(iii)
\(\sum _{i \in I_{+}}u_{i}\bar{\rho }_{i}(x,y) + \sum _{t=1}^{M}\tilde{\rho }_{t} \ge 0\);
-
(i)
-
(g)
-
(i)
For each \(i \in I_{1+}, \xi \rightarrow \Phi _{i}(\xi ,y,v,w)\) is \((\mathcal {F},\beta ,\bar{\phi }_{i},\bar{\rho }_{i},\theta ,m)\)-pseudosounivex at y, for each \(i \in I_{2+}, \xi \rightarrow \Phi _{i}(\xi ,y,v,w)\) is prestrictly \((\mathcal {F},\beta ,\bar{\phi }_{i},\bar{\rho }_{i},\theta ,m)\)-quasisounivex at y, and for each \(i \in I_{+}, \bar{\phi }_{i}\) is strictly increasing and \(\bar{\phi }_{i}(0) = 0\) , where \(\{I_{1+},I_{2+}\}\) is a partition of \(I_{+}\);
-
(ii)
For each \(t \in \underline{M_{1}}, \xi \rightarrow \Lambda _{t}(\xi ,v,w)\) is strictly \((\mathcal {F},\beta ,\tilde{\phi }_{t},\tilde{\rho }_{t},\theta ,m)\)-pseudosounivex at y, for each \(t \in \underline{M_{2}}, \xi \rightarrow \Lambda _{t}(\xi ,v,w)\) is \((\mathcal {F},\beta ,\tilde{\phi }_{t},\tilde{\rho }_{t},\theta ,m)\)-quasisounivex at y, and for \(t \in \underline{M}, \tilde{\phi }_{t}\) is increasing and \(\tilde{\phi }_{t}(0) = 0\) , where \(\{\underline{M_{1}},\underline{M_{2}}\}\) is a partition of \(\underline{M}\);
-
(iii)
\(\sum _{i \in I_{+}}u_{i}\bar{\rho }_{i}(x,y) + \sum _{t=1}^{M}\tilde{\rho }_{t}(x,y) \ge 0\);
-
(iv)
\(I_{1+}\ne \emptyset \), \(\underline{M_{1}}\ne \emptyset \), or \(\sum _{i \in I_{+}}u_{i}\bar{\rho }_{i}(x,y) + \sum _{t=1}^{M}\tilde{\rho }_{t}(x,y) > 0\).
-
(i)
Then, \(\varphi (x) \ge \psi _{II}(\mathcal {S})\), where \(\psi _{II}\) is the objective function of (DII).
Proof
(a): Suppose to the contrary that \(\varphi (x) < \psi _{II}(\mathcal {S})\). This implies that
Keeping in mind that \(v \ge 0\), we see that for each \(i \in I_{+}\),
and so it follows from the properties of \(\bar{\phi }_{i}\) that
which in view of (i) implies that
Since \(u \ge 0, u_{i} = 0\) for each \(i \in \underline{p}\backslash I_{+}, \sum _{i=1}^{p}u_{i} = 1\), and \(\mathcal {F}(x,y;\cdot )\) is sublinear, the above inequalities yield
As seen in the proof of Theorem 2.2, our assumptions in (ii) lead to
which when combined with (3.6) and (3.7) results in
In view of (iii), this inequality contradicts (3.7). Hence, \(\varphi (x) \ge \psi _{II}(\mathcal {S})\). (b)–(g) : The proofs are similar to that of part (a). \(\square \)
Theorem 3.2
(Strong duality) Let \(x^{*}\) be a normal optimal solution of (P) and assume that any one of the seven sets of conditions set forth in Theorem 3.1 is satisfied for all feasible solutions of (DII). Then, for each \(z^{*} \in C(x^{*})\) , there exist \(u^*, v^*\) , and \(w^{*}\) , such that \((x^*,z^{*},u^*,v^*,w^{*})\) is an optimal solution of (DII) and \(\varphi (x^{*}) = \psi _{II}(x^*,z^{*},u^*,v^*,w^{*})\).
Proof
The proof is similar to that of Theorem 2.2. \(\square \)
The duality models (DII) and \((\tilde{D}II)\) contain numerous special cases that can easily be identified by appropriate choices of the partitioning sets.
Duality model III and duality theorems
In this section, we discuss two additional duality models for (P). In these duality formulations, we utilize a partition of \(\underline{p}\) in addition to those of \(\underline{q}\) and \(\underline{r}\). This partitioning scheme, which is an extended version of the one initially proposed by Mond and Weir [7], was used by Yang [18] for formulating a generalized duality model for a multiobjective fractional programming problem. In our duality theorems, we impose appropriate generalized \((\mathcal {F},\beta ,\phi ,\rho ,\theta ,m)\)-sounivexity requirements on certain combinations of the problem functions.
Let \(\{I_{0}, I_{1}, \ldots , I_{\ell }\}\) be a partition of \(\underline{p}\), such that \(\mathcal {L} = \{0, 1, 2, \ldots , \ell \}\subset \mathcal {M} = \{0, 1, \ldots , M\}\), and let the real-valued function \(\xi \rightarrow \Pi _{t}(\xi ,y,u,v,w)\) be defined, for fixed u, v, and w, on X by
Consider the following two problems:
(DIII) Maximize \(\dfrac{\sum _{i=1}^{p}u_{i}f_{i}(y)}{\sum _{i=1}^{p}u_{i}g_{i}(y)}\)
subject to
\((\tilde{D}III)\) Maximize \(\dfrac{\sum _{i=1}^{p}u_{i}f_{i}(y)}{\sum _{i=1}^{p}u_{i}g_{i}(y)}\)
where \(\mathcal {F}(x,y;\cdot )\) is a sublinear function from \(\mathbb {R}^{n}\) to \(\mathbb {R}\).
The comments and observations made earlier about the relationship between (DI) and \((\tilde{D}I)\) are, of course, also valid for (DIII) and \((\tilde{D}III)\).
The following two theorems show that (DIII) is a dual problem for (P).
Theorem 4.1
(Weak duality) Let x and \(\mathcal {S} \equiv (y,z,u,v,w)\) be arbitrary feasible solutions of (P) and (DIII), respectively, and assume that any one of the following seven sets of hypotheses is satisfied:
-
(a)
-
(i)
for each \(t \in \mathcal {L}, \xi \rightarrow \Pi _{t}(\xi ,y,u,v,w)\) is strictly \((\mathcal {F},\beta ,\phi _{t},\rho _{t},\theta ,m)\)-pseudosounivex at y, \(\phi _{t}\) is increasing, and \(\phi _{t}(0) = 0\);
-
(ii)
for each \(t \in \mathcal {M}{\setminus}\mathcal {L}, \xi \rightarrow \Lambda _{t}(\xi ,v,w)\) is \((\mathcal {F},\beta ,\phi _{t},\rho _{t},\theta ,m)\)-quasisounivex at y, \(\phi _{t}\) is increasing, and \(\phi _{t}(0) = 0\);
-
(iii)
\(\sum _{t \in \mathcal {M}}\rho _{t}(x,y) \ge 0\) for all \(x \in \mathbb {F}\);
-
(i)
-
(b)
-
(i)
For each \(t \in \mathcal {L}, \xi \rightarrow \Pi _{t}(\xi ,y,u,v,w)\) is prestrictly \((\mathcal {F},\beta ,\phi _{t},\rho _{t},\theta ,m)\)-quasisounivex at y, \(\phi _{t}\) is increasing, and \(\phi _{t}(0) = 0\);
-
(ii)
For each \(t \in \mathcal {M}{\setminus}\mathcal {L}, \xi \rightarrow \Lambda _{t}(\xi ,v,w)\) is strictly \((\mathcal {F},\beta ,\phi _{t},\rho _{t},\theta ,m)\)-pseudosounivex at y, \(\phi _{t}\) is increasing, and \(\phi _{t}(0) = 0\);
-
(iii)
\(\sum _{t \in \mathcal {M}}\rho _{t}(x,y) \ge 0\) for all \(x \in \mathbb {F}\);
-
(i)
-
(c)
-
(i)
For each \(t \in \mathcal {L}, \xi \rightarrow \Pi _{t}(\xi ,y,u,v,w)\) is prestrictly \((\mathcal {F},\beta ,\phi _{t},\rho _{t},\theta ,m)\)-quasisounivex at y, \(\phi _{t}\) is increasing, and \(\phi _{t}(0) = 0\);
-
(ii)
For each \(t \in \mathcal {M}{\setminus}\mathcal {L},\, \xi \rightarrow \Lambda _{t}(\xi ,v,w)\) is \((\mathcal {F},\beta ,\phi _{t},\rho _{t},\theta ,m)\)-quasisounivex at y, \(\phi _{t}\) is increasing, and \(\phi _{t}(0) = 0\);
-
(iii)
\(\sum _{t \in \mathcal {M}}\rho _{t}(x,y) > 0\) for all \(x \in \mathbb {F}\);
-
(i)
-
(d)
-
(i)
For each \(t \in \mathcal {L}_{1}, \xi \rightarrow \Pi _{t}(\xi ,y,u,v,w)\) is strictly \((\mathcal {F},\beta ,\phi _{t},\rho _{t},\theta ,m)\)-pseudosounivex at y , for each \(t \in \mathcal {L}_{2}, \xi \rightarrow \Pi _{t}(\xi ,y,u,v,w)\) is prestrictly \((\mathcal {F},\beta ,\phi _{t},\rho _{t},\theta ,m)\)-quasisounivex at y, and for each \(t \in \mathcal {L}, \phi _{t}\) is increasing and \(\phi _{t}(0) = 0\) , where \(\{\mathcal {L}_{1},\mathcal {L}_{2}\}\) is a partition of \(\mathcal {L}\);
-
(ii)
For each \(t \in \mathcal {M}{\setminus}\mathcal {L}, \xi \rightarrow \Lambda _{t}(\xi ,v,w)\) is strictly \((\mathcal {F},\beta ,\phi _{t},\rho _{t},\theta ,m)\)-pseudosounivex at y, \(\phi _{t}\) is increasing, and \(\phi _{t}(0) = 0\);
-
(iii)
\(\sum _{t \in \mathcal {M}}\rho _{t}(x,y) \ge 0\) for all \(x \in \mathbb {F}\);
-
(i)
-
(e)
-
(i)
for each \(t \in \mathcal {L}_{1} \ne \emptyset , \xi \rightarrow \Pi _{t}(\xi ,y,u,v,w)\) is strictly \((\mathcal {F},\beta ,\phi _{t},\rho _{t},\theta ,m)\)-pseudosounivex at y , for each \(t \in \mathcal {L}_{2}, \xi \rightarrow \Pi _{t}(\xi ,y,u,v,w)\) is prestrictly \((\mathcal {F},\beta ,\phi _{t},\rho _{t},\theta ,m)\)-quasisounivex at y , and for each \(t \in \mathcal {L}, \phi _{t}\) is increasing and \(\phi _{t}(0) = 0\) , where \(\{\mathcal {L}_{1},\mathcal {L}_{2}\}\) is a partition of \(\mathcal {L}\);
-
(ii)
For each \(t \in \mathcal {M}{\setminus}\mathcal {L}, \xi \rightarrow \Lambda _{t}(\xi ,v,w)\) is \((\mathcal {F},\beta ,\phi _{t},\rho _{t},\theta ,m)\)-quasisounivex at y, \(\phi _{t}\) is increasing, and \(\phi _{t}(0) = 0\);
-
(iii)
\(\sum _{t \in \mathcal {M}}\rho _{t}(x,y) \ge 0\) for all \(x \in \mathbb {F}\);
-
(i)
-
(f)
-
(i)
for each \(t \in \mathcal {L}, \xi \rightarrow \Pi _{t}(\xi ,y,u,v,w)\) is prestrictly \((\mathcal {F},\beta ,\phi _{t},\rho _{t},\theta ,m)\)-quasisounivex at y, \(\phi _{t}\) is increasing, and \(\phi _{t}(0) = 0\);
-
(ii)
for each \(t \in (\mathcal {M}{\setminus}\mathcal {L})_{1} \ne \emptyset , \xi \rightarrow \Lambda _{t}(\xi ,v,w)\) is strictly \((\mathcal {F},\beta ,\phi _{t},\rho _{t},\theta ,m)\)-pseudosounivex at y, for each \(t \in (\mathcal {M}{\setminus}\mathcal {L})_{2}, \xi \rightarrow \Lambda _{t}(\xi ,v,w)\) is \((\mathcal {F},\beta ,\phi _{t},\rho _{t},\theta ,m)\)-quasisounivex at y, and for each \(t \in \mathcal {L}, \phi _{t}\) is increasing and \(\phi _{t}(0) = 0\), where \(\{(\mathcal {M}{\setminus}\mathcal {L})_{1},(\mathcal {M}{\setminus}\mathcal {L})_{2}\}\) is a partition of \(\mathcal {M}{\setminus}\mathcal {L})\);
-
(iii)
\(\sum _{t \in \mathcal {M}}\rho _{t}(x,y) \ge 0\) for all \(x \in \mathbb {F}\);
-
(i)
-
(g)
-
(i)
for each \(t \in \mathcal {L}_{1}, \xi \rightarrow \Pi _{t}(\xi ,y,u,v,w)\) is \((\mathcal {F},\beta ,\phi _{t},\rho _{t},\theta ,m)\)-pseudosounivex at y, for each \(t \in \mathcal {L}_{2}, \xi \rightarrow \Pi _{t}(\xi ,y,u,v,w)\) is prestrictly \((\mathcal {F},\beta ,\phi _{t},\rho _{t},\theta ,m)\)-quasisounivex at y, and for each \(t \in \mathcal {L}, \phi _{t}\) is increasing and \(\phi _{t}(0) = 0\), where \(\{\mathcal {L}_{1},\mathcal {L}_{2}\}\) is a partition of \(\mathcal {L}\);
-
(ii)
for each \(t \in (\mathcal {M}{\setminus}\mathcal {L})_{1}, \xi \rightarrow \Lambda _{t}(\xi ,v,w)\) is strictly \((\mathcal {F},\beta ,\phi _{t},\rho _{t},\theta ,m)\)-pseudosounivex at y, for each \(t \in (\mathcal {M}{\setminus}\mathcal {L})_{2},\xi \rightarrow \Lambda _{t}(\xi ,v,w)\) is \((\mathcal {F},\beta ,\phi _{t},\rho _{t},\theta ,m)\)-quasisounivex at y, and for each \(t \in \mathcal {M}{\setminus}\mathcal {L}, \phi _{t}\) is increasing and \(\phi _{t}(0) = 0\), where \(\{(\mathcal {M}{\setminus}\mathcal {L})_{1},(\mathcal {M}{\setminus}\mathcal {L})_{2}\}\) is a partition of \(\mathcal {M}{\setminus} \mathcal {L}\);
-
(iii)
\(\sum _{t \in \mathcal {M}}\rho _{t}(x,y) \ge 0\) for all \(x \in \mathbb {F}\);
-
(iv)
\(\mathcal {L}_{1}\ne \emptyset , (\mathcal {M}{\setminus}\mathcal {L})_{1}\ne \emptyset \), or \(\sum _{t \in \mathcal {M}}\rho _{t}(x,y) > 0\).
-
(i)
Then, \(\varphi (x) \ge \psi _{III}(\mathcal {S})\), where \(\psi _{III}\) is the objective function of (DIII).
Proof
(a): Suppose to the contrary that \(\varphi (x) < \psi _{III}(\mathcal {S})\). This implies that
Since \(u \ge 0\) and \(u \ne 0\), we see that for each \(t \in \mathcal {L}\),
Now, using this inequality, we see that
and hence
which in view of (i) implies that
Summing over \(t \in \mathcal {L}\) and using the sublinearity of \(\mathcal {F}(x,y;\cdot )\), we obtain
Proceeding as in the proof of Theorem 2.2, we get for each \(t \in \mathcal {M}\backslash \mathcal {L}\),
and so
which in view of (ii) implies that
Summing over \(t \in \mathcal {M}\backslash \mathcal {L}\) and using the sublinearity of \(\mathcal {F}(x,y;\cdot )\), we get
Now, combining (4.7) and (4.8) and using (iii), we obtain
Now, multiplying (4.1) by \(\beta \), applying the sublinear function \(\mathcal {F}(x,y;\cdot )\) to both sides of the resulting equation, and then adding the equation to (4.2), we get
which contradicts (4.9). Therefore, we conclude that \(\varphi (x) \ge \psi _{III}(\mathcal {S})\). (b)–(g): The proofs are similar to that of part (a). \(\square \)
Theorem 4.2
(Strong Duality) Let \(x^{*}\) be a normal optimal solution of (P) and assume that any one of the seven sets of conditions set forth in Theorem 4.1 is satisfied for all feasible solutions of (DIII). Then, for each \(z^{*} \in C(x^{*})\) , there exist \(u^*, v^*, w^{*}\), and \(\lambda ^*\) , such that \((x^*,z^{*},u^*,v^*)\) is an optimal solution of (DIII) and \(\varphi (x^{*}) = \psi _{III}(x^*,z^{*},u^*,v^*)\).
Proof
The proof is similar to that of Theorem 2.2. \(\square \)
The generalized duality models (DIII) and \((\tilde{D}III)\) subsume a great variety of special cases which can be identified explicitly by appropriate choices of the partitioning sets \(\{I_{0}, I_{1}, \ldots , I_{\ell }\}, \{J_{0}, J_{1}, \ldots , J_{M}\}\), and \(\{K_{0}, K_{1}, \ldots , K_{M}\}\).
Concluding remarks
Remark 5.1
Using a direct nonparametric approach, in this paper, we have formulated six generalized second-order parameter-free duality models for a discrete minmax fractional programming problem and established numerous duality results using a variety of generalized \((\mathcal {F},\beta ,\phi ,\rho ,\theta ,m)\)-sounivexity assumptions. Each one of the six duality models considered in this paper is, in fact, a family of dual problems whose members can easily be identified by appropriate choices of certain sets and functions. The generalized duality models and the related duality theorems collectively provide a vast number of new second-order dual problems and duality theorems for the principal minmax problem (P) and its special cases designated as \((P1) - (P3)\) in Sect. 2. Furthermore, the style of presentation adopted in this paper as well as the main results derived here will prove useful in investigating other related classes of nonlinear programming problems and utilizing similar generalized convexity concepts. For example, employing similar techniques, one can investigate the second-order sufficient optimality and duality aspects of the following ’semiinfinite’ minmax fractional programming problem:
subject to
where \(X, f_{i}\), and \(g_{i}, i \in \underline{p}\), are as defined in the description of (P), for each \(j \in \underline{q}\) and \(k \in \underline{r}, T_{j}\) and \(S_{k}\) are compact subsets of complete metric spaces, for each \(j \in \underline{q}, \xi \rightarrow G_{j}(\xi ,t)\) is a real-valued function defined on X for all \(t \in T_{j}\), for each \(k \in \underline{r}, \xi \rightarrow H_{k}(\xi ,s)\) is a real-valued function defined on X for all \(s \in S_{k}\), for each \(j \in \underline{q}\) and \(k \in \underline{r}, t \rightarrow G_{j}(x,t)\) and \(s \rightarrow H_{k}(x,s)\) are continuous real-valued functions defined, respectively, on \(T_{j}\) and \(S_{k}\) for all \(x \in X\).
Remark 5.2
The generalized parametric duality model results, established in this paper applying generalized \((\mathcal {F},\beta ,\phi ,\rho ,\theta ,m)\)-sounivexity assumptions, can be generalized to the case of the generalized \((\mathcal {F},\beta ,\phi ,h(x^*,z),\kappa (x^*,z),\rho ,\theta ,m)\)-sounivexity.
Definition 5.1
The function f is said to be (strictly) \((\mathcal {F},\beta ,\phi , h(x^*,z),\kappa (x^*,z),\rho ,\theta ,m)\) -sounivex at \(x^{*}\) of higher order if there exist functions \(\beta : X \times X \rightarrow \mathbb {R}_{+}\backslash \{0\} \equiv (0,\infty ), \phi : \mathbb {R} \rightarrow \mathbb {R}, \rho : X \times X \rightarrow \mathbb {R}, \theta : X \times X \rightarrow \mathbb {R}^{n}\), and a sublinear function \(\mathcal {F}(x,x^{*};\cdot ) : \mathbb {R}^{n} \rightarrow \mathbb {R}\), such that for each \(x \in X (x \ne x^{*})\) and \(z \in \mathbb {R}^{n}\),
where \(h, \kappa :\mathbb {R}^n\times \mathbb {R}^n \rightarrow \mathbb {R}^{n}\) are differentiable.
References
Antczak, T.: Generalized fractional minimax programming with B-(p, r)-invexity. Comp. Math. Appl. 56, 1505–1525 (2008)
Craven, B.D., Mond, B.: On converse duality in nonlinear programming. Operat. Res. 19, 1075–1078 (1971)
Hanson, M.A.: Second order invexity and duality in mathematical programming. Opsearch 30, 313–320 (1993)
Mangasarian, O.L.: Second and higher-order duality in nonlinear programming. J. Math. Anal. Appl. 51, 607–620 (1975)
Mond, B.: Second order duality for nonlinear programs. Opsearch 11, 90–99 (1974)
Mond, B., Zhang, J.: Duality for multiobjective programming involving second-order V-invex functions. In: Glover, M., Jeyakumar, V. (eds.) Proceedings of the Optimization Miniconference II (B), pp. 89–100. University of New South Wales, Australia (1995)
Mond, B., Weir, T.: Generalized concavity and duality, Generalized in Optimization and Economics (S. Schaible and W. T. Ziemba, eds.), Academic Press, New York (1981) pp. 263–279
Verma, R.U.: Generalized B-\((b,\rho,\theta,\tilde{p},\tilde{r})\)-invexities and efficiency conditions for multiobjective fractional programming. Tbilisi Math. J. 8(2), 159–180 (2015)
Verma, R.U.: Generalized higher order (\(\phi,\) \(\eta,\) \(\omega,\) \(\pi,\) \(\rho,\) \(\theta,\) m)-invexities in parametric optimality conditions for discrete minmax fractional programming. J. Basic Appl. Sci. 12, 283–300 (2016)
Verma, R.U., Zalmai, G.J.: Second-order parametric optimality conditions in discrete minmax fractional programming. Commun. Appl. Nonlinear Anal. 23(3), 1–32 (2016)
Verma, R.U., Zalmai, G.J.: Generalized second-order parametric optimality conditions in discrete minmax fractional programming. Trans. Math. Program. Appl. 2(12), 1–20 (2014)
Verma, R.U., Zalmai, G.J.: Parameter-free duality in discrete minmax fractional programming based on second-order optimality conditions. Trans. Math. Program. Appl. 2(11), 1–37 (2014)
Verma, R.U., Zalmai, G.J.: Generalized second-order parametric optimality conditions in semiinfinite discrete minmax fractional programming and second order (\(F,\) \(\beta,\) \(\phi,\) \(\rho,\) \(\theta,\) m)-univexity. Stat. Optim. Inform. Comp. 4, 15–29 (2016)
von Neumann, J.: A model of general economic equilibrium. Review Econ. Stud. 13, 1–9 (1945)
Wang, S.Y.: Second order necessary and sufficient conditions in multiobjective programming. Numer. Funct. Anal. Optim. 12, 237–252 (1991)
Werner, J.: Duality in generalized fractional programming. Intl. Ser. Numer. Anal. 84, 341–351 (1988)
Wolfe, P.: A duality theorem for nonlinear programming. Quart. Appl. Math. 19, 239–244 (1961)
Yang, X.: Generalized convex duality for multiobjective fractional programs. Opsearch 31, 155–163 (1994)
Yang, X.Q.: Second-order conditions in \(C^{1,1}\) optimization with applications. Numer. Funct. Anal. Optim. 14, 621–632 (1993)
Yang, X.Q.: Second-order global optimality conditions of convex composite optimization. Math. Prog. 81, 327–347 (1998)
Yang, X.Q.: Second-order global optimality conditions for optimization problems. J. Global Optim. 30, 271–284 (2004)
Zalmai, G.J.: Hanson-Antczak type generalized (\(\alpha,\) \(\beta,\) \(\gamma,\) \(\xi,\) \(\eta,\) \(\rho,\) \(\theta \))-V-invex functions in semiinfinite multiobjective fractional programming Part II: First-order parametric duality models. Adv. Nonlinear Variat. Inequal. 16(2), 61–90 (2013)
Zalmai, G.J.: Hanson-Antczak type generalized (\(\alpha \), \(\beta,\) \(\gamma,\) \(\xi,\) \(\eta,\) \(\rho,\) \(\theta \))-V-invex functions in semiinfinite multiobjective fractional programming Part III: Second-order parametric duality models. Adv. Nonlinear Variat. Inequal. 16(2), 91–126 (2013)
Zalmai, G.J.: Optimality conditions and duality models for a class of nonsmooth constrained fractional variational problems. Optimization 30, 15–51 (1994)
Zalmai, G.J.: Optimality principles and duality models for a class of continuous-time generalized fractional programming problems with operator constraints. J. Stat. Manag. Syst. 1, 61–100 (1998)
Acknowledgments
The author is greatly indebted to the reviewer for all valuable comments leading to the revised version.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Open Access This article is distributed under the terms of the Creative Commons Attribution 4.0 International License (http://creativecommons.org/licenses/by/4.0/), which permits unrestricted use, distribution, and reproduction in any medium, provided you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license, and indicate if changes were made.
About this article
Cite this article
Zalmai, G.J., Verma, R.U. Generalized parameter-free duality models in discrete minmax fractional programming based on second-order optimality conditions. Math Sci 10, 185–199 (2016). https://doi.org/10.1007/s40096-016-0193-x
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s40096-016-0193-x
Keywords
- Discrete minmax fractional programming
- Generalized second-order (\(\mathcal {F}\), β, ϕ, ρ, θ, m)-univex
- Generalized parameter-free duality models
- Duality theorems