- Open Access
A fuzzy semi-infinite optimization problem
© Megahed; licensee Springer. 2014
- Received: 11 July 2014
- Accepted: 5 November 2014
- Published: 19 November 2014
In this paper, we present a fuzzy semi-infinite optimization problem. Moreover, we will deduce the Fritz-John and Kuhn-Tucker necessary conditions of this problem. Finally, a numerical example is given to illustrate the results.
MSC: 90C34, 90C05, 90C70, 90C30, 90C46.
- necessary conditions
In many practical problems, we might have information containing some uncertainty, which is treated in this paper as fuzzy information; the considered semi-infinite optimization problem with fuzzy information is a fuzzy semi-infinite optimization problem.
Fuzzy set theory was introduced into conventional linear programming by Zimmermann , fuzzy mathematical programming was presented in , and fuzzy programming and linear programming with several objective functions were presented by .
Optimality conditions of a nonlinear programming problem with fuzzy parameters are established, and a fuzzy function is defined, with its differentiability, convexity, and some important properties being studied in ; the fuzzy solution of optimization problems and the incentive solution of the optimization problems are presented which explain that the solution of optimization problems is a generalization of the solutions in the case of crisp optimization problems . As regards fuzzy mathematical programming: theory, application, and an extension are presented in .
This paper is organized as follows: In Section 2, the formulation of the problem of semi-infinite optimization is considered. In Section 3, the main section of the paper, we will study a fuzzy semi-infinite optimization problem, and the Fritz-John and Kuhn-Tucker necessary conditions. Finally, the conclusion is drawn in Section 5.
I, K, and L are finite index sets with and (where denotes the cardinality), all appearing functions are real valued and continuously differentiable, and the set is compact for each , and the set-valued mapping is upper semi-continuous at each .
For the special case that the set does not depend on the variable x, this problem is a common semi-infinite problem (SIP). The generalized semi-infinite and bi-level optimization problem are presented by Stein and Still . Bi-level problems are of the following form.
The generalized semi-infinite programming on generic local minimizers was introduced by Gunzel et al. . The feasible set in generalized semi-infinite optimization is presented by Jongen et al. in . Furthermore, the linear and linearized generalized semi-infinite optimization problems were introduced by Rukmann . In , a first-order optimality condition in generalized semi-infinite programming is introduced. Still discussed the optimality conditions for generalized semi-infinite programming problems in .
3.1 Problem formulation
3.2 Lower level problem
If and , then is a minimizer of the problem (3.5).
In other words, for and the set is nonempty and, furthermore, is also compact.
Firstly, we will give some lemmas, definitions, and a proposition which will be used in the proof of the Fritz-John conditions.
Lemma 2 
Let , and . Then the set is bounded, and whenever .
Lemma 3 
Let , and for let . Then is an interior point of M.
Lemma 5 
Let . Then the set is compact.
Definition 6 
i.e. consists of all finite convex combinations of the elements of V.
Lemma 7 
Let be a nonempty compact set. Then there exists a with for all if and only if .
Lemma 8 
- (i)There are real numbers , , , , satisfying(4.3)
- (ii)The set is linearly independent and there exists a with(4.4)
Proposition 9 
The set () is linearly independent.
- (ii)There is a satisfying(4.5)
Proof Let be a local minimizer of the problem (4.7). We distinguish three cases.
Case 1: The set is linearly dependent. Then we are done by choosing , , in (4.9) (if ), or , in (4.10) (if ) as well as a linear combination with .
Case 3: Neither Case 1 nor Case 2 holds. Then the proof is similar to Theorem 1.1 in . □
the set is linearly independent and
- (2)there exists a such that(5.1)
The proof is similar to the proof of Theorem 10 if we choose .
The optimal solution of the crisp problem is , , and ; and , .
In this work, we discussed a fuzzy semi-infinite optimization problem, by considering that the minimum of the objective function is fuzzy (). The Fritz-John conditions and the constraint qualification are discussed for this problem. Finally, an illustrative example is given to clarify the results.
The author wants to express his deep thanks and his respect to his faculty, colleagues, the Journal, and Prof. Dr. Rachel M Bernales of the Journal of Editorial office. Also the author wants to express his thanks and respect to Jane Doe who provided medical writing services on behalf of XYZ pharmaceuticals Ltd.
- Zimmermann H-J: Description and optimization of fuzzy systems. Int. J. Gen. Syst. 1976, 2: 209–215. 10.1080/03081077608547470View ArticleMATHGoogle Scholar
- Zimmermann H-J: Fuzzy mathematical programming. Comput. Oper. Res. 1983, 10: 291–298. 10.1016/0305-0548(83)90004-7MathSciNetView ArticleGoogle Scholar
- Zimmermann H-J: Fuzzy programming and linear programming with several objective functions. Fuzzy Sets Syst. 1978, 1: 45–55. 10.1016/0165-0114(78)90031-3View ArticleMathSciNetMATHGoogle Scholar
- Cantão, LAP, Yamakami, A: Nonlinear programming with fuzzy parameters: theory and applications. In: Mohammedian, M (ed.) Proceedings of CIMCA 2003. ISBN:1740880684Google Scholar
- Jameed AF, Sadeghi A: Solving nonlinear programming problem in fuzzy environment. Int. J. Contemp. Math. Sci. 2012,7(4):159–170.MathSciNetGoogle Scholar
- Luhandjula MK: Fuzzy mathematical programming: theory, applications and extension. J. Uncertain Syst. 2007,1(2):124–136.Google Scholar
- Reemsten R, Ruckmann J-J (Eds): Semi-Infinite Programming. Kluwer Academic, Boston; 1998.Google Scholar
- Hettich R, Kortank KO: Semi-infinite programming: theory methods, and applications. SIAM Rev. 1993, 35: 380–429. 10.1137/1035089MathSciNetView ArticleMATHGoogle Scholar
- Jongen HT, Ruckmann J-J, Stein O: Generalized semi-infinite optimization: a first order optimality condition and examples. Math. Program. 1998, 83: 145–158.MathSciNetMATHGoogle Scholar
- Weber G-W: Generalized semi-infinite optimization: on some foundation. Vyčisl. Tehnol. 1999, 4: 41–61.MATHGoogle Scholar
- Stein O, Still G: On generalized semi-infinite optimization and bi-level optimization. Eur. J. Oper. Res. 2002, 142: 444–462. 10.1016/S0377-2217(01)00307-1MathSciNetView ArticleMATHGoogle Scholar
- Gunzel H, Jongen HT, Stein O: Generalized semi-infinite programming: on generic local minimizers. J. Glob. Optim. 2008,42(3):413–421. 10.1007/s10898-008-9302-1MathSciNetView ArticleMATHGoogle Scholar
- Jongen HT, Twilt F, Weber G-W: Semi infinite optimization: structure and feasibility of the feasible set. J. Optim. Theory Appl. 1992, 72: 529–552. 10.1007/BF00939841MathSciNetView ArticleMATHGoogle Scholar
- Rukmann JJ: On linear and liberalized generalized semi-infinite optimization problem. Ann. Oper. Res. 2001, 101: 191–208. 10.1023/A:1010972524021MathSciNetView ArticleGoogle Scholar
- Ruckmann J-J, Shapiro A: First-order optimality conditions in generalized semi-infinite programming. J. Optim. Theory Appl. 1999, 101: 677–691. 10.1023/A:1021746305759MathSciNetView ArticleMATHGoogle Scholar
- Stein O, Still G: On optimality conditions for generalized semi- infinite programming problems. J. Optim. Theory Appl. 2000, 104: 443–458. 10.1023/A:1004622015901MathSciNetView ArticleMATHGoogle Scholar
- Bazaraa MS, Shetty CM: Nonlinear Programming Theory and Algorithms. Wiley, New York; 1979.MATHGoogle Scholar
- Cheney EW: Introduction to Approximation Theory. McGraw-Hill, New York; 1966.MATHGoogle Scholar
- Jongen HT, Jonker P, Twilt F: Nonlinear Optimization in Rn. II. Transversality, Flows, Parametric Aspects. Peter Lang, Frankfurt am Main; 1986.MATHGoogle Scholar
This article is published under license to BioMed Central Ltd. This is an Open Access article distributed under the terms of the Creative Commons Attribution License (http://creativecommons.org/licenses/by/4.0), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly credited.