Comportamento do método de direções interiores ao epígrafo (IED) quando aplicado a problemas de programação em dois níveis
Loading...
Date
Journal Title
Journal ISSN
Volume Title
Publisher
Universidade Federal de Juiz de Fora (UFJF)
DOI
Abstract
This work presents the behavior of the IED algorithm when applied to bilevel
programming problems. For this, the follower problem is replaced by the first-order
necessary Karush-Kuhn-Tucker’s conditions and thus, the problem of bilevel programming turns into an optimization problem with non-linear constraints. Thus, the conditions required for use of the IED (Interior Epigraph Directions) algorithm are satisfied. This method has the characteristic of solving non-convex and non-differentiable optimization problems using the Lagrangian duality technique, where the constraint functions are introduced into the objective function for formulation of the Lagrangian. Furthermore, the method considers the dual problem induced by a generalized scheme of augmented Lagrangian duality and obtains the primal solution by producing a sequence of points inside the dual function epigraph. Then the value of the dual function, at some point in the dual space, is given by Lagrangian minimization. Finally, numerical experiments are presented showing the use of the IED algorithm in bilevel programming problems found in the literature.
Description
Citation
Endorsement
Review
Supplemented By
Referenced By
Rights and licensing
Acesso Aberto
