Characterizations of global optimality are given for general difference convex (DC) optimization problems involving convex inequality constraints. These results are obtained in terms of E-subdifferentials of the objective and constraint functions and do not require any regularity condition. An extension of Farkas’ lemma is obtained for inequality systems involving convex functions and is used t...

Focus in the paper is on the definition of linear bilevel programming problems, the existence of optimal solutions and necessary as well as sufficient optimality conditions. In the papers [9] and [10] the authors claim to suggest a refined definition of linear bilevel programming problems and related optimality conditions. Mainly their attempt reduces to shifting upper level constraints involvi...

The necessary and sufficient condition for beamforming optimality for multiple-input multiple output (MIMO) systems with mean feedback has been derived and thoroughly investigated in this article. The condition is an inequality that contains parameters of the number of antennas, transmission power, and the singular values of channel mean matrix. When the beamforming optimality condition is sati...

Nonsmooth semidefinite programming problems is concerned in this paper where the objective functions is quasidifferentiable. Necessary optimality conditions for quasidifferentiable optimization is proposed. The advantage of Kuhn-Tucker necessary optimality condition in terms of quasidifferential over that in terms of Clarke generalized gradient, is discussed.

The purpose of this paper is to characterize the weak Pareto optimality for multiobjective pseudoconvex problem. In fact, it is a first order optimality characterization that generalize the Karush-Kuhn-Tucker condition. Moreover, this work is an extension of the single-objective case [6] to the multiobjective one with pseudoconvex continuous functions. Mathematics Subject Classification: 46N10,...

Since the standard multi knapsack problem, may be rewritten as a reverse convex problem, we present a global optimization approach. It is known from solving high dimensional nonconvex problems that pure cutting plane methods may fail and branch-and-bound is impractical, due to a large duality gap. On the other hand, a strategy based on some sufficient optimality condition does not help much bec...

We develop a new notion of second-order complementarity with respect to the tangent subspace associated to second-order necessary optimality conditions by the introduction of so-called tangent multipliers. We prove that around a local minimizer, a second-order stationarity residual can be driven to zero while controlling the growth of Lagrange multipliers and tangent multipliers, which gives a ...

In this paper, we defined the interval form of \(\alpha, \beta\) level set for triangular q-rung orthopair fuzzy (qROPF) number. To obtain a differentiability notion qROPF valued functions, Hukuhara (H-differentiability) and level-wise H-differentiability is defined. Using KKT optimality condition optimization problem with objective function are formulated.