Optimization Online


Solving a Huff-like Stackelberg problem on networks

Boglárka G.-Tóth (bog***at***math.bme.hu)
Kristóf Kovács (kkovacs***at***math.bme.hu)

Abstract: This work deals with a Huff-like Stackelberg problem, where the leader facility wants to decide its location so that its profit is maximal after the competitor (the follower) also built its facility. It is assumed that the follower makes a rational decision, maximizing their profit. The inelastic demand is aggregated into the vertices of a graph, and facilities can be located along the edges. Though the problem is considered very hard computationally we give a Branch and Bound algorithm that can find the solution in reasonable time on medium sized networks, and thus contributing to the scientific achievement of the field.

Keywords: global optimization, Stackelberg problem, branch and bound, DC

Category 1: Global Optimization (Applications )

Citation: Budapest University of Technology and Economics, 05/2014

Download: [PDF]

Entry Submitted: 05/30/2014
Entry Accepted: 05/30/2014
Entry Last Modified: 05/30/2014

Modify/Update this entry

  Visitors Authors More about us Links
  Subscribe, Unsubscribe
Digest Archive
Search, Browse the Repository


Coordinator's Board
Classification Scheme
Give us feedback
Optimization Journals, Sites, Societies
Mathematical Optimization Society