Showing math.OCShow all
3 papers · 1 filter
math.OC2026
Complexity of Bilevel Linear Programming with a Single Upper-Level Variable
Nagisa Sugishita, Margarida Carvalho
Bilevel linear programming (LP) is one of the simplest classes of bilevel optimization problems, yet it is known to be NP-hard in general. Specifically, determining whether the opt…
math.OC2026
Stackelberg Dynamic Location Planning under Cumulative Demand
Warley Almeida Silva, Margarida Carvalho, Sanjay Dominik Jena
Dynamic facility location problems predominantly suppose a monopoly over the service or product provided. Nonetheless, this premise can be a severe oversimplification in the presen…
math.OC2025
Solving Combinatorial Pricing Problems using Embedded Dynamic Programming Models
Quang Minh Bui, Margarida Carvalho, José Neto
The combinatorial pricing problem (CPP) is a bilevel problem in which the leader maximizes their revenue by imposing tolls on certain items that they can control. Based on the toll…