DOI: https://doi.org/10.15587/1729-4061.2019.180993

### Development of a price optimization algorithm using inverse calculations

Ekaterina Gribanova

#### Abstract

An algorithm is proposed for solving the price optimization problem using inverse calculations. The algorithm includes two stages: solving the problem of unconditional optimization and solving the inverse problem using inverse calculations while minimizing changes in the arguments of the function. In this case, the solution of the inverse problem can be performed repeatedly within a given number of iterations to sequentially approach the set value of the constraint, and to determine the increment of the arguments, the values of the elements of the gradient/anti-gradient vector of the constraint function are used. To take into account the influence of the arguments on the change of the objective function, its second partial derivatives are used. Five options of the price optimization problem are considered, which nonlinear programming tasks with one restriction are. The revenue of the enterprise, the deviation of demand from the volume of production, the deviation of the sought price from its current value are considered as the objective function. It is shown that the solutions obtained in this way are consistent with the result of using classical methods (Lagrange multipliers, penalties), and the results are also compared with solving problems using the MathCad mathematical package. The advantage of the method is a simpler computer implementation, the ability to obtain a solution in fewer iterations compared to known methods. The method can also be used to solve other problems of the presented type with the following requirements for the objective function and restrictions:

1) partial derivatives of the objective function of the first order – linear one-dimensional functions;

2) the restriction has the form of equality;

3) the constraint is linear or the constraint is quadratic, and the partial derivatives of the first order of the constraint function are one-dimensional linear functions.

The article may be useful for specialists making decisions in the field of pricing policies of organizations, as well as the development of optimization models of economic facilities and decision support systems

#### Full Text:

PDF PDF (Русский)

#### References

Kunz, T. P., Crone, S. F., Meissner, J. (2016). The effect of data preprocessing on a retail price optimization system. Decision Support Systems, 84, 16–27. doi: https://doi.org/10.1016/j.dss.2016.01.003

Reisi, M., Gabriel, S. A., Fahimnia, B. (2019). Supply chain competition on shelf space and pricing for soft drinks: A bilevel optimization approach. International Journal of Production Economics, 211, 237–250. doi: https://doi.org/10.1016/j.ijpe.2018.12.018

Theysohn, S., Klein, K., Völckner, F., Spann, M. (2013). Dual effect-based market segmentation and price optimization. Journal of Business Research, 66 (4), 480–488. doi: https://doi.org/10.1016/j.jbusres.2011.11.007

Krasheninnikova, E., García, J., Maestre, R., Fernández, F. (2019). Reinforcement learning for pricing strategy optimization in the insurance industry. Engineering Applications of Artificial Intelligence, 80, 8–19. doi: https://doi.org/10.1016/j.engappai.2019.01.010

Gupta, V. K., Ting, Q. U., Tiwari, M. K. (2019). Multi-period price optimization problem for omnichannel retailers accounting for customer heterogeneity. International Journal of Production Economics, 212, 155–167. doi: https://doi.org/10.1016/j.ijpe.2019.02.016

Chen, R., Jiang, H. (2017). Capacitated assortment and price optimization for customers with disjoint consideration sets. Operations Research Letters, 45 (2), 170–174. doi: https://doi.org/10.1016/j.orl.2017.01.009

Chen, R., Jiang, H. (2019). Capacitated assortment and price optimization under the multilevel nested logit model. Operations Research Letters, 47 (1), 30–35. doi: https://doi.org/10.1016/j.orl.2018.11.006

Qu, T., Zhang, J. H., Chan, F. T. S., Srivastava, R. S., Tiwari, M. K., Park, W.-Y. (2017). Demand prediction and price optimization for semi-luxury supermarket segment. Computers & Industrial Engineering, 113, 91–102. doi: https://doi.org/10.1016/j.cie.2017.09.004

Gallego, G., Wang, R. (2014). Multiproduct Price Optimization and Competition Under the Nested Logit Model with Product-Differentiated Price Sensitivities. Operations Research, 62 (2), 450–461. doi: https://doi.org/10.1287/opre.2013.1249

Choi, T.-M., Ma, C., Shen, B., Sun, Q. (2019). Optimal pricing in mass customization supply chains with risk-averse agents and retail competition. Omega, 88, 150–161. doi: https://doi.org/10.1016/j.omega.2018.08.004

Ferreira, K. J., Lee, B. H. A., Simchi-Levi, D. (2016). Analytics for an Online Retailer: Demand Forecasting and Price Optimization. Manufacturing & Service Operations Management, 18 (1), 69–88. doi: https://doi.org/10.1287/msom.2015.0561

Caro, F., Gallien, J. (2012). Clearance Pricing Optimization for a Fast-Fashion Retailer. Operations Research, 60 (6), 1404–1422. doi: https://doi.org/10.1287/opre.1120.1102

Harsha, P., Subramanian, S., Ettl, M. (2019). A Practical Price Optimization Approach for Omnichannel Retailing. INFORMS Journal on Optimization, 1 (3), 241–264. doi: https://doi.org/10.1287/ijoo.2019.0018

Salvietti, L., Smith, N. R. (2008). A profit-maximizing economic lot scheduling problem with price optimization. European Journal of Operational Research, 184 (3), 900–914. doi: https://doi.org/10.1016/j.ejor.2006.11.031

Katsifou, A., Seifert, R. W., Tancrez, J.-S. (2014). Joint product assortment, inventory and price optimization to attract loyal and non-loyal customers. Omega, 46, 36–50. doi: https://doi.org/10.1016/j.omega.2014.02.002

Zaichenko, Yu. P. (2000). Doslidzhennia operatsiy. Kyiv: ZAT "VIPOL", 687.

Trunov, A. N. (2014). The increasing of degree of completeness for solution of financial and business problems in nonlinear programming with constraints inequalities. Journal of Computational Optimization in Economics and Finance, 243–253.

Trunov, A. N. (2015). Modernization of means for analyses and solution of nonlinear programming problems. Quantitative Methods in Economics, 16 (2), 133–141.

Gribanova, E. B. (2019). Reshenie zadachi optimizatsii tseny s pomoshch'yu obratnyh vychisleniy. Modelirovanie, optimizatsiya i informatsionnye tehnologii, 7 (3). doi: http://doi.org/10.26102/2310-6018/2019.26.3.014

Li, B., Nguyen, V. H., Ng, C. L., del Rio-Chanona, E. A., Vassiliadis, V. S., Arellano-Garcia, H. (2016). ICRS-Filter: A randomized direct search algorithm for constrained nonconvex optimization problems. Chemical Engineering Research and Design, 106, 178–190. doi: https://doi.org/10.1016/j.cherd.2015.12.001

El-Shorbagy, M. A., Mousa, A. A., Nasr, S. M. (2016). A chaos-based evolutionary algorithm for general nonlinear programming problems. Chaos, Solitons & Fractals, 85, 8–21. doi: https://doi.org/10.1016/j.chaos.2016.01.007

Mitsel', A. A., Hvashchevskiy, A. N. (1999). Noviy algoritm resheniya zadachi kvadratichnogo programmirovaniya. Avtometriya, 3, 93–98.

Odintsov, B. E. (2004). Obratnye vychisleniya v formirovanii ekonomicheskih resheniy. Moscow: Finansy i statistika, 256.

Gribanova, E. B. (2018). Methods for solving inverse problems of economic analysis by minimizing argument increments. Proceedings of Tomsk State University of Control Systems and Radioelectronics, 21 (2), 95–99. doi: https://doi.org/10.21293/1818-0442-2018-21-2-95-99