scholarly journals Necessary optimality conditions of KKT type for interval programming problems

Author(s):  
Valeriano Antunes de Oliveira ◽  
Fabiola Roxana Villanueva ◽  
Tiago Mendonça da Costa
2018 ◽  
Vol 24 (3) ◽  
pp. 1059-1074
Author(s):  
Michel H. Geoffroy ◽  
Yvesner Marcelin

We introduce a class of positively homogeneous set-valued mappings, called inner prederivatives, serving as first order approximants to set-valued mappings. We prove an inverse mapping theorem involving such prederivatives and study their stability with respect to variational perturbations. Then, taking advantage of their properties we establish necessary optimality conditions for the existence of several kind of minimizers in set-valued optimization. As an application of these last results, we consider the problem of finding optimal allocations in welfare economics. Finally, to emphasize the interest of our approach, we compare the notion of inner prederivative to the related concepts of set-valued differentiation commonly used in the literature.


2017 ◽  
Vol 9 (4) ◽  
pp. 168
Author(s):  
Giorgio Giorgi

We take into condideration necessary optimality conditions of minimum principle-type, that is for optimization problems having, besides the usual inequality and/or equality constraints, a set constraint. The first part pf the paper is concerned with scalar optimization problems; the second part of the paper deals with vector optimization problems.


2020 ◽  
pp. 152-158
Author(s):  
Stepan Sorokin ◽  
Maxim Staritsyn

We propose and compare three numeric algorithms for optimal control of state-linear impulsive systems. The algorithms rely on the standard transformation of impulsive control problems through the discontinuous time rescaling, and the so-called “feedback”, direct and dual, maximum principles. The feedback maximum principles are variational necessary optimality conditions operating with feedback controls, which are designed through the usual constructions of the Pontryagin’s Maximum Principle (PMP); though these optimality conditions are formulated completely in the formalism of PMP, they essentially strengthen it. All the algorithms are non-local in the sense that they are aimed at improving non-optimal extrema of PMP (local minima), and, therefore, show the potential of global optimization.


Sign in / Sign up

Export Citation Format

Share Document