A deterministic bounding procedure for the global optimization of a bi-level mixed-integer problem
type: Item
instance of: scholarly article
title: A deterministic bounding procedure for the global optimization of a bi-level mixed-integer problem
zbMATH Open document ID: 1487.90492
author: Inês Soares
author: Maria João Alves
author: Carlos Henggeler Antunes
published in: European Journal of Operational Research
publication date: 2021-06-04T00:00:00Z
Mathematics Subject Classification ID: 90C11
Mathematics Subject Classification ID: 90C26
Mathematics Subject Classification ID: 90C57
Mathematics Subject Classification ID: 91B74
zbMATH DE Number: 7355328
zbMATH Keywords: global optimization
zbMATH Keywords: bi-level optimization
zbMATH Keywords: mixed-integer linear programming model
zbMATH Keywords: pricing problem
zbMATH Keywords: dynamic tariffs
zbMATH Keywords: electricity retail market
zbMATH Keywords: demand response
MaRDI profile type: Publication
full work available at URL: j.ejor.2020.09.015
OpenAlex ID: W3087571207
cites work: A trilevel model for best response in energy demand-side management
cites work: Enhanced exact algorithms for discrete bilevel linear problems
cites work: Intersection Cuts for Bilevel Optimization
cites work: A New General-Purpose Algorithm for Mixed-Integer Bilevel Linear Programs
cites work: Global optimization of mixed-integer bilevel programming problems
cites work: A Value-Function-Based Exact Approach for the Bilevel Mixed-Integer Programming Problem
cites work: Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
cites work: Linear bilevel programming with upper level constraints depending on the lower level solution
cites work: Global solution of nonlinear mixed-integer bilevel programs
cites work: Global solution of bilevel programs with a nonconvex inner program
cites work: The Mixed Integer Linear Bilevel Programming Problem
cites work: Discrete linear bilevel programming problem
cites work: An exact algorithm for the bilevel mixed integer linear programming problem under three simplifying assumptions
DOI: 10.1016/J.EJOR.2020.09.015
description: scientific article; zbMATH DE number 7355328