Results 51 to 60 of about 514 (86)
Unified Robust Necessary Optimality Conditions for Nonconvex Nonsmooth Uncertain Multiobjective Optimization. [PDF]
Wang J, Li S, Feng M.
europepmc +1 more source
A Stochastic Nash Equilibrium Problem for Medical Supply Competition. [PDF]
Fargetta G, Maugeri A, Scrimali L.
europepmc +1 more source
ON SUFFICIENCY IN MULTIOBJECTIVE PROGRAMMING INVOLVING GENERALIZED G,C,r - TYPE I FUNCTIONS
: In this paper, a new class of (G,C,r)-type I functions and their generalizations are introduced. We consider a class of differentiable multiobjective optimization problems and establish sufficient optimality conditions.
Y. Singh +3 more
semanticscholar +1 more source
Optimization problems with quasiconvex inequality constraints [PDF]
The constrained optimization problem min f(x), gj(x) 0 (j = 1, . . . , p) is considered, where f : X ! R and gj : X ! R are nonsmooth functions with domain X Rn.
Ginchev Ivan, Ivanov Vsevolod
core
On Lagrangian Duality in Vector Optimization. Applications to the linear case. [PDF]
The paper deals with vector constrained extremum problems. A separation scheme is recalled; starting from it, a vector Lagrangian duality theory is developed. The linear duality due to Isermann can be embedded in this separation approach.
Elisa Pagani
core
On constraint qualifications with generalized convexity and optimality conditions [PDF]
This paper deals with a multiobjective programming problem involving both equality constraints in infinite dimensional spaces. It is shown that some constraint qualifications together with a condition of interior points are sufficient conditions for the ...
Do Van Luu, Manh-Hung Nguyen
core
: A second order Mond-Weir type dual is presented for a non-differentiable multiobjective optimization problem with square root terms in the objective as well as in the constraints. Optimality and duality results are presented.
Rishi Rajan Sahay, Guneet Bhatia
semanticscholar +1 more source
On the Duality of Semiantichains and Unichain Coverings [PDF]
We study a min-max relation conjectured by Saks and West: For any two posets $P$ and $Q$ the size of a maximum semiantichain and the size of a minimum unichain covering in the product $P\times Q$ are equal. For positive we state conditions on $P$ and $Q$
Bart Lomiej Bosek +4 more
core
Introduction to Optimal Transport Theory
These notes constitute a sort of Crash Course in Optimal Transport Theory. The different features of the problem of Monge-Kantorovitch are treated, starting from convex duality issues. The main properties of space of probability measures endowed with the
Santambrogio, Filippo
core +2 more sources
On constrained set-valued optimization [PDF]
The set-valued optimization problem minC F(x), G(x)\(-K) 6= ; is considered, where F : Rn Rm and G : Rn Rp are set-valued functions, and C Rm and K Rp are closed convex cones.
Ginchev Ivan, Rocca Matteo
core

