Lagrangian duality for robust problems with decomposable functions: the case of a robust inventory problem
Autor(a) principal: | |
---|---|
Data de Publicação: | 2021 |
Outros Autores: | , , |
Tipo de documento: | Artigo |
Idioma: | eng |
Título da fonte: | Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos) |
Texto Completo: | http://hdl.handle.net/10773/31601 |
Resumo: | We consider a class of min-max robust problems in which the functions that need to be “robustified” can be decomposed as the sum of arbitrary functions. This class of problems includes many practical problems, such as the lot-sizing problem under demand uncertainty. By considering a Lagrangian relaxation of the uncertainty set, we derive a tractable approximation, called the dual Lagrangian approach, that we relate with both the classical dualization approximation approach and an exact approach. Moreover, we show that the dual Lagrangian approach coincides with the affine decision rule approximation approach. The dual Lagrangian approach is applied to a lot-sizing problem, in which demands are assumed to be uncertain and to belong to the uncertainty set with a budget constraint for each time period. Using the insights provided by the interpretation of the Lagrangian multipliers as penalties in the proposed approach, two heuristic strategies, a new guided iterated local search heuristic, and a subgradient optimization method are designed to solve more complex lot-sizing problems in which additional practical aspects, such as setup costs, are considered. Computational results show the efficiency of the proposed heuristics that provide a good compromise between the quality of the robust solutions and the running time required in their computation. |
id |
RCAP_5193b312dec2af68a70ed421b3b7931c |
---|---|
oai_identifier_str |
oai:ria.ua.pt:10773/31601 |
network_acronym_str |
RCAP |
network_name_str |
Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos) |
repository_id_str |
7160 |
spelling |
Lagrangian duality for robust problems with decomposable functions: the case of a robust inventory problemLagrangian relaxationRobust optimizationLot-sizingDemand uncertaintyAffine approximationBudgeted uncertainty polytopeWe consider a class of min-max robust problems in which the functions that need to be “robustified” can be decomposed as the sum of arbitrary functions. This class of problems includes many practical problems, such as the lot-sizing problem under demand uncertainty. By considering a Lagrangian relaxation of the uncertainty set, we derive a tractable approximation, called the dual Lagrangian approach, that we relate with both the classical dualization approximation approach and an exact approach. Moreover, we show that the dual Lagrangian approach coincides with the affine decision rule approximation approach. The dual Lagrangian approach is applied to a lot-sizing problem, in which demands are assumed to be uncertain and to belong to the uncertainty set with a budget constraint for each time period. Using the insights provided by the interpretation of the Lagrangian multipliers as penalties in the proposed approach, two heuristic strategies, a new guided iterated local search heuristic, and a subgradient optimization method are designed to solve more complex lot-sizing problems in which additional practical aspects, such as setup costs, are considered. Computational results show the efficiency of the proposed heuristics that provide a good compromise between the quality of the robust solutions and the running time required in their computation.INFORMS2021-07-19T09:35:33Z2021-01-01T00:00:00Z2021info:eu-repo/semantics/publishedVersioninfo:eu-repo/semantics/articleapplication/pdfhttp://hdl.handle.net/10773/31601eng1091-985610.1287/ijoc.2020.0978Rodrigues, FilipeAgra, AgostinhoRequejo, CristinaDelage, Erickinfo:eu-repo/semantics/openAccessreponame:Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos)instname:Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informaçãoinstacron:RCAAP2024-02-22T12:00:58Zoai:ria.ua.pt:10773/31601Portal AgregadorONGhttps://www.rcaap.pt/oai/openaireopendoar:71602024-03-20T03:03:25.913890Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos) - Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informaçãofalse |
dc.title.none.fl_str_mv |
Lagrangian duality for robust problems with decomposable functions: the case of a robust inventory problem |
title |
Lagrangian duality for robust problems with decomposable functions: the case of a robust inventory problem |
spellingShingle |
Lagrangian duality for robust problems with decomposable functions: the case of a robust inventory problem Rodrigues, Filipe Lagrangian relaxation Robust optimization Lot-sizing Demand uncertainty Affine approximation Budgeted uncertainty polytope |
title_short |
Lagrangian duality for robust problems with decomposable functions: the case of a robust inventory problem |
title_full |
Lagrangian duality for robust problems with decomposable functions: the case of a robust inventory problem |
title_fullStr |
Lagrangian duality for robust problems with decomposable functions: the case of a robust inventory problem |
title_full_unstemmed |
Lagrangian duality for robust problems with decomposable functions: the case of a robust inventory problem |
title_sort |
Lagrangian duality for robust problems with decomposable functions: the case of a robust inventory problem |
author |
Rodrigues, Filipe |
author_facet |
Rodrigues, Filipe Agra, Agostinho Requejo, Cristina Delage, Erick |
author_role |
author |
author2 |
Agra, Agostinho Requejo, Cristina Delage, Erick |
author2_role |
author author author |
dc.contributor.author.fl_str_mv |
Rodrigues, Filipe Agra, Agostinho Requejo, Cristina Delage, Erick |
dc.subject.por.fl_str_mv |
Lagrangian relaxation Robust optimization Lot-sizing Demand uncertainty Affine approximation Budgeted uncertainty polytope |
topic |
Lagrangian relaxation Robust optimization Lot-sizing Demand uncertainty Affine approximation Budgeted uncertainty polytope |
description |
We consider a class of min-max robust problems in which the functions that need to be “robustified” can be decomposed as the sum of arbitrary functions. This class of problems includes many practical problems, such as the lot-sizing problem under demand uncertainty. By considering a Lagrangian relaxation of the uncertainty set, we derive a tractable approximation, called the dual Lagrangian approach, that we relate with both the classical dualization approximation approach and an exact approach. Moreover, we show that the dual Lagrangian approach coincides with the affine decision rule approximation approach. The dual Lagrangian approach is applied to a lot-sizing problem, in which demands are assumed to be uncertain and to belong to the uncertainty set with a budget constraint for each time period. Using the insights provided by the interpretation of the Lagrangian multipliers as penalties in the proposed approach, two heuristic strategies, a new guided iterated local search heuristic, and a subgradient optimization method are designed to solve more complex lot-sizing problems in which additional practical aspects, such as setup costs, are considered. Computational results show the efficiency of the proposed heuristics that provide a good compromise between the quality of the robust solutions and the running time required in their computation. |
publishDate |
2021 |
dc.date.none.fl_str_mv |
2021-07-19T09:35:33Z 2021-01-01T00:00:00Z 2021 |
dc.type.status.fl_str_mv |
info:eu-repo/semantics/publishedVersion |
dc.type.driver.fl_str_mv |
info:eu-repo/semantics/article |
format |
article |
status_str |
publishedVersion |
dc.identifier.uri.fl_str_mv |
http://hdl.handle.net/10773/31601 |
url |
http://hdl.handle.net/10773/31601 |
dc.language.iso.fl_str_mv |
eng |
language |
eng |
dc.relation.none.fl_str_mv |
1091-9856 10.1287/ijoc.2020.0978 |
dc.rights.driver.fl_str_mv |
info:eu-repo/semantics/openAccess |
eu_rights_str_mv |
openAccess |
dc.format.none.fl_str_mv |
application/pdf |
dc.publisher.none.fl_str_mv |
INFORMS |
publisher.none.fl_str_mv |
INFORMS |
dc.source.none.fl_str_mv |
reponame:Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos) instname:Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informação instacron:RCAAP |
instname_str |
Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informação |
instacron_str |
RCAAP |
institution |
RCAAP |
reponame_str |
Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos) |
collection |
Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos) |
repository.name.fl_str_mv |
Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos) - Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informação |
repository.mail.fl_str_mv |
|
_version_ |
1799137689264455680 |