Results 11 to 20 of about 91 (84)
Symmetric duality for a class of multiobjective programming
We formulate a pair of symmetric dual nondifferentiable multiobjective programming and establish appropriate duality theorems. We also show that differentiable and nondifferentiable analogues of several pairs of symmetric dual problems can be obtained as special cases of our general symmetric programs.
Xinmin Yang, Shouyang Wang, Duan Li
wiley +1 more source
Quantified linear programs (QLPs) are linear programs with variables being either existentially or universally quantified. QLPs are convex multistage decision problems on the one side, and two-person zero-sum games between an existential and a universal ...
Ulf Lorenz, Jan Wolf
doaj +1 more source
Characterizations of Benson proper efficiency of set-valued optimization in real linear spaces
A new class of generalized convex set-valued maps termed relatively solid generalized cone-subconvexlike maps is introduced in real linear spaces not equipped with any topology.
Liang Hongwei, Wan Zhongping
doaj +1 more source
Multiobjective optimization problems, Constraint qualification, Necessary conditions for Pareto minimum, Lagrange multipliers, Clarke subdifferential, 90C29, 90C46,
B. Jiménez +3 more
core +1 more source
Approximations of bi-criteria optimization problem [PDF]
In this article we study approximation methods for solving bi-criteria optimization problems. Initial problem is approximated by a new one consisting of the second order approximation of feasible set and components of objective function might be initial ...
LUCA, Traian Ionuț, DUCA, Dorel I.
core +1 more source
Characterizations of minimal elements of upper support with applications in minimizing DC functions
In this study, we discuss on the problem of minimizing the differences of two non-positive valued increasing, co-radiant and quasi-concave (ICRQC) functions defined on XX (where XX is a real locally convex topological vector space).
Mirzadeh Somayeh +2 more
doaj +1 more source
Jordan Algebras are an important tool for dealing with semidefinite programming and optimization over symmetric cones in general. In this paper, a judicious use of Jordan Algebras in the context of sequential optimality conditions is done in order to ...
R. Andreani +5 more
core +1 more source
This article concerns about optimality conditions for boundary-value problems related to differential inclusions (DFIs) of higher orders. We intend to attain optimality conditions when a general Lagrange functional takes place in the cost function ...
Yıldırım Uğur +2 more
doaj +1 more source
Generalized derivatives and nonsmooth optimization, a finite dimensional tour
Convex optimization, nonsmooth analysis, nonsmooth optimization, set-valued maps, variational analysis, mathematical programming, nonconvex programming, nonlinear programming, optimality conditions, second order conditions, tangent cones, normal cones ...
Joydeep Dutta
core +1 more source
On generalized semi-infinite programming
Generalized semi-infinite programming, extended Mangasarian-Fromovitz, Kuhn-Tucker and Abadie constraint qualification, Fritz-John condition, first and second order optimality conditions, optimal value function, directional differentiability, second ...
Alfredo Gomez, J +3 more
core +1 more source

