Showing 1 - 10 of 50
A a set-valued optimization problem min<Subscript> C </Subscript> F(x), x ∈X <Subscript>0</Subscript>, is considered, where X <Subscript>0</Subscript> ⊂ X, X and Y are normed spaces, F: X <Subscript>0</Subscript> ⊂ Y is a set-valued function and C ⊂ Y is a closed cone. The solutions of the set-valued problem are defined as pairs (x <Superscript>0</Superscript>,y <Superscript>0</Superscript>), y <Superscript>0</Superscript> ∈F(x <Superscript>0</Superscript>), and are called...</superscript></superscript></superscript></superscript></subscript></subscript></subscript></subscript>
Persistent link: https://www.econbiz.de/10010999774
In this paper some second order necessary and sucient conditions aregiven for unconstrained and constrained optimization problems involving C1functions. A generalized derivative is obtained by approximation with smoothfunctions and it collapses to Clarke's definition when C(1,1) data are...
Persistent link: https://www.econbiz.de/10005007138
In this paper second-order optimality conditions for nonsmooth vector optimization problems are given by smooth approximations. We extend to the vector case the approach introduced by Ermoliev,Norkin and Wets to define generalized derivatives for discontinuous functions as limit of the classical...
Persistent link: https://www.econbiz.de/10005007347
Persistent link: https://www.econbiz.de/10006604820
Persistent link: https://www.econbiz.de/10007147942
Directional derivatives are the ideal tool to model simultaneous shifts of the instruments of economic policy. Provided the equilibrium solution of an oligolistic model are differentiable with respect to the parameter, such a problem can be easily solved considering shift in single instruments,...
Persistent link: https://www.econbiz.de/10005007235
Persistent link: https://www.econbiz.de/10011872969
A function <InlineEquation ID="IEq1"> <EquationSource Format="TEX">$${f : \Omega \to \mathbb{R}}$$</EquationSource> </InlineEquation> , where Ω is a convex subset of the linear space X, is said to be d.c. (difference of convex) if f =  g − h with <InlineEquation ID="IEq2"> <EquationSource Format="TEX">$${g, h : \Omega \to \mathbb{R}}$$</EquationSource> </InlineEquation> convex functions. While d.c. functions find various applications, especially in optimization, the...</equationsource></inlineequation></equationsource></inlineequation>
Persistent link: https://www.econbiz.de/10010994161
D. V. Luu and P. T. Kien propose in Soochow J. Math. 33 (2007), 17-31, higher-order conditions for strict efficiency of vector optimization problems based on the derivatives introduced by I. Ginchev in Optimization 51 (2002), 47-72. These derivatives are defined for scalar functions and in their...
Persistent link: https://www.econbiz.de/10008493501
Persistent link: https://www.econbiz.de/10008237657