A cut generation algorithm of finding an optimal solution in a market competition

DOI10.1134/S1990478919020029zbMATH Open1438.90217OpenAlexW2951553976WikidataQ127701849 ScholiaQ127701849MaRDI QIDQ4973247FDOQ4973247

Authors: Andrey Melnikov, V. L. Beresnev 

Publication date: 2 December 2019

Published in: Journal of Applied and Industrial Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1134/s1990478919020029

Recommendations

• Cut generation algorithm for the discrete competitive facility location problem
• A mathematical model of market competition
• Approximation of the competitive facility location problem with MIPs
• The branch-and-bound algorithm for a competitive facility location problem with the prescribed choice of suppliers
• Branch-and-bound algorithm for a competitive facility location problem

zbMATH Keywords

bilevel programmingStackelberg gamemarket competitionestimating problem

Mathematics Subject Classification ID

Cooperative games (91A12) Auctions, bargaining, bidding and selling, and other market models (91B26) Marketing, advertising (90B60) Integer programming (90C10)

Cites Work

• Foundations of bilevel programming
• On the competitive facility location problem with a free choice of suppliers
• Randomized local search for the discrete competitive facility location problem
• A strengthened formulation for the simple plant location problem with order
• The Mixed Integer Linear Bilevel Programming Problem
• Branch-and-bound algorithm for a competitive facility location problem
• Polyhedral study of simple plant location problem with order
• A mixed-integer bilevel programming approach for a competitive prioritized set covering problem
• Exact method for the capacitated competitive facility location problem
• A mathematical model of market competition
• The branch-and-bound algorithm for a competitive facility location problem with the prescribed choice of suppliers
• Cut generation algorithm for the discrete competitive facility location problem
• Approximation of the competitive facility location problem with MIPs

Cited In (5)

• Solving the market split problem via branch-and-cut
• A mathematical model of market competition
• Cut generation algorithm for the discrete competitive facility location problem
• A bilevel competitive location and pricing model with nonuniform split of demand
• New product introduction against a predator: a bilevel mixed-integer programming approach

Uses Software

• Gurobi

This page was built for publication: A cut generation algorithm of finding an optimal solution in a market competition

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4973247)