An inexact restoration package for bilevel programming problems

Autores
Pilotta, Elvio Angel; Torres, German Ariel
Año de publicación
2012
Idioma
inglés
Tipo de recurso
artículo
Estado
versión publicada
Descripción
Bilevel programming problems are a class of optimization problems with hierarchical structure where one of the constraints is also an optimization problem. Inexact restoration methods were introduced for solving nonlinear programming problems a few years ago. They generate a sequence of, generally, infeasible iterates with intermediate iterationsthat consist of inexactly restored points. In this paper we present a software environment for solving bilevel programming problems using an inexact restoration technique without replacing the lower level problem by its KKT optimality conditions. With this strategy we maintain the minimization structure of the lower level problem and avoid spurioussolutions. The environment is a user-friendly set of Fortran 90 modules which is easily and highly configurable. It is prepared to use two well-tested minimization solvers and different formulations in one of the minimization subproblems. We validate our implementation using a set of test problems from the literature, comparing different formulations andthe use of the minimization solvers.
Fil: Pilotta, Elvio Angel. Universidad Nacional de Córdoba. Facultad de Matemática, Astronomia y Física. Sección Matemática; Argentina. Consejo Nacional de Investigaciones Científicas y Técnicas. Centro Científico Tecnológico Conicet - Córdoba. Centro de Investigación y Estudios de Matemática. Universidad Nacional de Córdoba. Centro de Investigación y Estudios de Matemática; Argentina
Fil: Torres, German Ariel. Universidad Nacional de Córdoba. Facultad de Matemática, Astronomia y Física. Sección Matemática; Argentina. Consejo Nacional de Investigaciones Científicas y Técnicas. Centro Científico Tecnológico Conicet - Nordeste. Instituto de Modelado e Innovación Tecnológica. Universidad Nacional del Nordeste. Facultad de Ciencias Exactas Naturales y Agrimensura. Instituto de Modelado e Innovación Tecnológica; Argentina
Materia
BILEVEL PROGRAMMING PROBLEMS
INEXACT RESTORATION METHODS
ALGORITHMS
Nivel de accesibilidad
acceso abierto
Condiciones de uso
https://creativecommons.org/licenses/by-nc-sa/2.5/ar/
Repositorio
CONICET Digital (CONICET)
Institución
Consejo Nacional de Investigaciones Científicas y Técnicas
OAI Identificador
oai:ri.conicet.gov.ar:11336/197565

id CONICETDig_e106d09f761fe6eb7c88a4803b6df4a3
oai_identifier_str oai:ri.conicet.gov.ar:11336/197565
network_acronym_str CONICETDig
repository_id_str 3498
network_name_str CONICET Digital (CONICET)
spelling An inexact restoration package for bilevel programming problemsPilotta, Elvio AngelTorres, German ArielBILEVEL PROGRAMMING PROBLEMSINEXACT RESTORATION METHODSALGORITHMShttps://purl.org/becyt/ford/1.1https://purl.org/becyt/ford/1Bilevel programming problems are a class of optimization problems with hierarchical structure where one of the constraints is also an optimization problem. Inexact restoration methods were introduced for solving nonlinear programming problems a few years ago. They generate a sequence of, generally, infeasible iterates with intermediate iterationsthat consist of inexactly restored points. In this paper we present a software environment for solving bilevel programming problems using an inexact restoration technique without replacing the lower level problem by its KKT optimality conditions. With this strategy we maintain the minimization structure of the lower level problem and avoid spurioussolutions. The environment is a user-friendly set of Fortran 90 modules which is easily and highly configurable. It is prepared to use two well-tested minimization solvers and different formulations in one of the minimization subproblems. We validate our implementation using a set of test problems from the literature, comparing different formulations andthe use of the minimization solvers.Fil: Pilotta, Elvio Angel. Universidad Nacional de Córdoba. Facultad de Matemática, Astronomia y Física. Sección Matemática; Argentina. Consejo Nacional de Investigaciones Científicas y Técnicas. Centro Científico Tecnológico Conicet - Córdoba. Centro de Investigación y Estudios de Matemática. Universidad Nacional de Córdoba. Centro de Investigación y Estudios de Matemática; ArgentinaFil: Torres, German Ariel. Universidad Nacional de Córdoba. Facultad de Matemática, Astronomia y Física. Sección Matemática; Argentina. Consejo Nacional de Investigaciones Científicas y Técnicas. Centro Científico Tecnológico Conicet - Nordeste. Instituto de Modelado e Innovación Tecnológica. Universidad Nacional del Nordeste. Facultad de Ciencias Exactas Naturales y Agrimensura. Instituto de Modelado e Innovación Tecnológica; ArgentinaScientific Research Publishing2012-07info:eu-repo/semantics/articleinfo:eu-repo/semantics/publishedVersionhttp://purl.org/coar/resource_type/c_6501info:ar-repo/semantics/articuloapplication/pdfapplication/pdfapplication/pdfhttp://hdl.handle.net/11336/197565Pilotta, Elvio Angel; Torres, German Ariel; An inexact restoration package for bilevel programming problems; Scientific Research Publishing; Applied Mathematics; 03; 10; 7-2012; 1252-12592152-73852152-7393CONICET DigitalCONICETenginfo:eu-repo/semantics/altIdentifier/doi/10.4236/am.2012.330181info:eu-repo/semantics/altIdentifier/url/https://www.scirp.org/journal/paperinformation.aspx?paperid=24091info:eu-repo/semantics/openAccesshttps://creativecommons.org/licenses/by-nc-sa/2.5/ar/reponame:CONICET Digital (CONICET)instname:Consejo Nacional de Investigaciones Científicas y Técnicas2025-09-29T09:42:26Zoai:ri.conicet.gov.ar:11336/197565instacron:CONICETInstitucionalhttp://ri.conicet.gov.ar/Organismo científico-tecnológicoNo correspondehttp://ri.conicet.gov.ar/oai/requestdasensio@conicet.gov.ar; lcarlino@conicet.gov.arArgentinaNo correspondeNo correspondeNo correspondeopendoar:34982025-09-29 09:42:26.467CONICET Digital (CONICET) - Consejo Nacional de Investigaciones Científicas y Técnicasfalse
dc.title.none.fl_str_mv An inexact restoration package for bilevel programming problems
title An inexact restoration package for bilevel programming problems
spellingShingle An inexact restoration package for bilevel programming problems
Pilotta, Elvio Angel
BILEVEL PROGRAMMING PROBLEMS
INEXACT RESTORATION METHODS
ALGORITHMS
title_short An inexact restoration package for bilevel programming problems
title_full An inexact restoration package for bilevel programming problems
title_fullStr An inexact restoration package for bilevel programming problems
title_full_unstemmed An inexact restoration package for bilevel programming problems
title_sort An inexact restoration package for bilevel programming problems
dc.creator.none.fl_str_mv Pilotta, Elvio Angel
Torres, German Ariel
author Pilotta, Elvio Angel
author_facet Pilotta, Elvio Angel
Torres, German Ariel
author_role author
author2 Torres, German Ariel
author2_role author
dc.subject.none.fl_str_mv BILEVEL PROGRAMMING PROBLEMS
INEXACT RESTORATION METHODS
ALGORITHMS
topic BILEVEL PROGRAMMING PROBLEMS
INEXACT RESTORATION METHODS
ALGORITHMS
purl_subject.fl_str_mv https://purl.org/becyt/ford/1.1
https://purl.org/becyt/ford/1
dc.description.none.fl_txt_mv Bilevel programming problems are a class of optimization problems with hierarchical structure where one of the constraints is also an optimization problem. Inexact restoration methods were introduced for solving nonlinear programming problems a few years ago. They generate a sequence of, generally, infeasible iterates with intermediate iterationsthat consist of inexactly restored points. In this paper we present a software environment for solving bilevel programming problems using an inexact restoration technique without replacing the lower level problem by its KKT optimality conditions. With this strategy we maintain the minimization structure of the lower level problem and avoid spurioussolutions. The environment is a user-friendly set of Fortran 90 modules which is easily and highly configurable. It is prepared to use two well-tested minimization solvers and different formulations in one of the minimization subproblems. We validate our implementation using a set of test problems from the literature, comparing different formulations andthe use of the minimization solvers.
Fil: Pilotta, Elvio Angel. Universidad Nacional de Córdoba. Facultad de Matemática, Astronomia y Física. Sección Matemática; Argentina. Consejo Nacional de Investigaciones Científicas y Técnicas. Centro Científico Tecnológico Conicet - Córdoba. Centro de Investigación y Estudios de Matemática. Universidad Nacional de Córdoba. Centro de Investigación y Estudios de Matemática; Argentina
Fil: Torres, German Ariel. Universidad Nacional de Córdoba. Facultad de Matemática, Astronomia y Física. Sección Matemática; Argentina. Consejo Nacional de Investigaciones Científicas y Técnicas. Centro Científico Tecnológico Conicet - Nordeste. Instituto de Modelado e Innovación Tecnológica. Universidad Nacional del Nordeste. Facultad de Ciencias Exactas Naturales y Agrimensura. Instituto de Modelado e Innovación Tecnológica; Argentina
description Bilevel programming problems are a class of optimization problems with hierarchical structure where one of the constraints is also an optimization problem. Inexact restoration methods were introduced for solving nonlinear programming problems a few years ago. They generate a sequence of, generally, infeasible iterates with intermediate iterationsthat consist of inexactly restored points. In this paper we present a software environment for solving bilevel programming problems using an inexact restoration technique without replacing the lower level problem by its KKT optimality conditions. With this strategy we maintain the minimization structure of the lower level problem and avoid spurioussolutions. The environment is a user-friendly set of Fortran 90 modules which is easily and highly configurable. It is prepared to use two well-tested minimization solvers and different formulations in one of the minimization subproblems. We validate our implementation using a set of test problems from the literature, comparing different formulations andthe use of the minimization solvers.
publishDate 2012
dc.date.none.fl_str_mv 2012-07
dc.type.none.fl_str_mv info:eu-repo/semantics/article
info:eu-repo/semantics/publishedVersion
http://purl.org/coar/resource_type/c_6501
info:ar-repo/semantics/articulo
format article
status_str publishedVersion
dc.identifier.none.fl_str_mv http://hdl.handle.net/11336/197565
Pilotta, Elvio Angel; Torres, German Ariel; An inexact restoration package for bilevel programming problems; Scientific Research Publishing; Applied Mathematics; 03; 10; 7-2012; 1252-1259
2152-7385
2152-7393
CONICET Digital
CONICET
url http://hdl.handle.net/11336/197565
identifier_str_mv Pilotta, Elvio Angel; Torres, German Ariel; An inexact restoration package for bilevel programming problems; Scientific Research Publishing; Applied Mathematics; 03; 10; 7-2012; 1252-1259
2152-7385
2152-7393
CONICET Digital
CONICET
dc.language.none.fl_str_mv eng
language eng
dc.relation.none.fl_str_mv info:eu-repo/semantics/altIdentifier/doi/10.4236/am.2012.330181
info:eu-repo/semantics/altIdentifier/url/https://www.scirp.org/journal/paperinformation.aspx?paperid=24091
dc.rights.none.fl_str_mv info:eu-repo/semantics/openAccess
https://creativecommons.org/licenses/by-nc-sa/2.5/ar/
eu_rights_str_mv openAccess
rights_invalid_str_mv https://creativecommons.org/licenses/by-nc-sa/2.5/ar/
dc.format.none.fl_str_mv application/pdf
application/pdf
application/pdf
dc.publisher.none.fl_str_mv Scientific Research Publishing
publisher.none.fl_str_mv Scientific Research Publishing
dc.source.none.fl_str_mv reponame:CONICET Digital (CONICET)
instname:Consejo Nacional de Investigaciones Científicas y Técnicas
reponame_str CONICET Digital (CONICET)
collection CONICET Digital (CONICET)
instname_str Consejo Nacional de Investigaciones Científicas y Técnicas
repository.name.fl_str_mv CONICET Digital (CONICET) - Consejo Nacional de Investigaciones Científicas y Técnicas
repository.mail.fl_str_mv dasensio@conicet.gov.ar; lcarlino@conicet.gov.ar
_version_ 1844613336794136576
score 13.069144