Methods for optimizing the parameters of a linear programming problem (LPP)
this article presents a solution to a linear programming problem and a method that is important for optimizing parameter definition. In this case, the term programming should be understood as planning, that is, it is necessary to find the optimal production plan in which revenues will be maximum or costs will be minimal. One of these methods is the simplex method, the so-called method of gradual improvement of the plan. The idea of the method is that we choose some initial reference plan. Then, based on checking certain conditions, we move on to the next better plan. This process continues until we reach the optimal plan. At the same time, at every step we find one of the reference plans.
[1] Сафаева Қ. Математик дастурлаш (Дарслик) Т.: «Ибн Сино» 2004.
[2] Исследование операций в экономике. /Под. ред. Кремера Н.Ш. М: ЮНИТИ, 1997.
[3] Кузнецов Ю.М., Новиков Г.И., Холод Н.И. Сборник задач по математическому программированию. Минск. «Высшая школа», 1985.
[4] Bland, R. (1977), ‘New finite pivoting rules for the simplex method’, Mathematics of Operations Research 2, 103–107.