A mathematical model of market competition

We consider a mathematical model of decision making by a company attempting to win a market share. We assume that the company releases its products to the market under the competitive conditions that another company is making similar products. Both companies can vary the kinds of their products on the market as well as the prices in accordance with consumer preferences. Each company aims to maximize its profit. A mathematical statement of the decision-making problem for the market players is a bilevel mathematical programming problem that reduces to a competitive facility location problem. As regards the latter, we propose a method for finding an upper bound for the optimal value of the objective function and an algorithm for constructing an approximate solution. The algorithm amounts to local ascent search in a neighborhood of a particular form, which starts with an initial approximate solution obtained simultaneously with an upper bound. We give a computational example of the problem under study which demonstrates the output of the algorithm.