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

DOI10.1134/S1990478919020029MaRDI QIDQ4973247zbMATH OpenOpenAlexWikidataFDO

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

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)

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

Cites work

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

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

Describes a project that uses

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)