“…Clearly, (y, ξ L , ξ U , μ) = (0, 1, 1, 1) is a feasible solution to (IMWD) and objective value is [1,2]. We also note that x = 2 is a feasible solution to (IVP2) and corresponding objective value is [3,22].…”
Section: Theorem 41 (Weak Duality) Let X and (Y ξ L ξ U μ) Be Tmentioning
confidence: 94%
“…By using a Guignard constraint qualification, some stronger Kuhn-Tucker type necessary optimality conditions for efficiency in terms of convexifactors were established. Further, Ardali et al [2] used the notion of convexifactor to study constraint qualifications, stationary concepts and optimality conditions for a nonsmooth mathematical programs with equilibrium constraints. Golestani and Nobakhtian [13] presented optimality conditions for nonsmooth semidefinite programming via convexificators.…”
This paper is devoted to the applications of convexifactors on interval-valued programming problem. Based on the concept of LU optimal solution, sufficient optimality conditions are established under generalized ∂ * -convexity assumptions. Furthermore, appropriate duality theorems are derived for two types of dual problem, namely Mond-Weir and Wolfe type duals. We also construct examples to manifest the established relations.
“…Clearly, (y, ξ L , ξ U , μ) = (0, 1, 1, 1) is a feasible solution to (IMWD) and objective value is [1,2]. We also note that x = 2 is a feasible solution to (IVP2) and corresponding objective value is [3,22].…”
Section: Theorem 41 (Weak Duality) Let X and (Y ξ L ξ U μ) Be Tmentioning
confidence: 94%
“…By using a Guignard constraint qualification, some stronger Kuhn-Tucker type necessary optimality conditions for efficiency in terms of convexifactors were established. Further, Ardali et al [2] used the notion of convexifactor to study constraint qualifications, stationary concepts and optimality conditions for a nonsmooth mathematical programs with equilibrium constraints. Golestani and Nobakhtian [13] presented optimality conditions for nonsmooth semidefinite programming via convexificators.…”
This paper is devoted to the applications of convexifactors on interval-valued programming problem. Based on the concept of LU optimal solution, sufficient optimality conditions are established under generalized ∂ * -convexity assumptions. Furthermore, appropriate duality theorems are derived for two types of dual problem, namely Mond-Weir and Wolfe type duals. We also construct examples to manifest the established relations.
“…Utilizing the above notations, motivated by [37], we are ready to introduce the Abadie type constraint qualification in the form of convexificator which is very important to establish the optimality conditions. Definition 3.1.…”
Section: Optimality Conditions For Nonsmooth Mathematical Program With Vanishing Constraintsmentioning
confidence: 99%
“…If the GS-ACQ holds at x , then x is a GS stationary point. Now, we provide the following example to illustrate Theorem 3.1, this example is a modified version of Example 4.7 in [37].…”
Section: I I I K Cone Co G Cone Co H Cone Co H Cone Co H Cone Co G Cone Co Hmentioning
confidence: 99%
“…For nonsmooth optimization problems, various convexificators-based results with respect to the Fritz-John type and the Karush-Kuhn-Tucker type necessary optimality conditions have been developed in [32] [33] [34] [35] [36]. Very recently, Ansari, Movahedian and Nobakhtian [37] deal with constraint qualifications, stationary concepts and optimality conditions for a nonsmooth mathematical program with equilibrium constraints by using the notion of convexificators. However, the corresponding results about the nonsmooth mathematical program with vanishing constraints can be very few.…”
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.