Necessary optimality conditions for a nonsmooth semi-infinite programming problem

Abstract

The nonsmooth semi-infinite programming (SIP) is solved in the paper (Mishra et al. in J Glob Optim 53:285-296, 2012) using limiting subdifferentials. The necessary optimality condition obtained by the authors, as well as its proof, is false. Even in the case where the index set is a finite, the result remains false. Two major problems do not allow them to have the expected result; first, the authors were based on Theorem 3.2 (Soleimani-damaneh and Jahanshahloo in J Math Anal Appl 328:281-286, 2007) which is not valid for nonsmooth semi-infinite problems with an infinite index set; second, they would have had to assume a suitable constraint qualification to get the expected necessary optimality conditions. For the convenience of the reader, under a nonsmooth limiting constraint qualification, using techniques from variational analysis, we propose another proof to detect necessary optimality conditions in terms of Karush-Kuhn-Tucker multipliers. The obtained results are formulated using limiting subdifferentials and Fréchet subdifferentials.

New Advances on Fuzzy Linear Programming Problem by Semi-Infinite Programming Approach

“…Here, we adopt the commonly used concept of 𝛼-preference as defined in [6,7], and provide the following method for fuzzy ordering.…”

“…Finally, by solving model (7), we obtain the optimal fuzzy value for the model ( 6) with 𝜆 as a membership function value.…”

“…Since we suppose the profit of 𝑃 1 is close to 8 so it can be modeled as (6,8,9), and 𝑃 2 can be modeled as (3,4,7). Therefore, we formulae the FLP problem as follows:…”

“…Semi-Infinite Programs (SIP) are optimization problems with either infinitely many constraints or infinitely many variables (but not both). Recently semi-infinite programming was used in different subjects of operation research and other branches of science [7][8][9][10][11]. Fang et al [12] proposed a Fuzzy Linear Semi-Infinite Programming (FLSIP) problem with uncertain data on constraints coefficients.…”

DC Semidefinite Programming and Cone Constrained DC Optimization

“…A detailed theoretical analysis of smooth and nonsmooth cone constrained optimization problems was presented in [4,16,30,42,62,73]. Optimization methods for solving various convex cone constrained optimization problems can be found in [3,5,43], while algorithms for solving various classes of nonconvex cone constrained optimization problems were developed, e.g.…”