Production optimization problems and blending problems are considered. It is shown that with such problems, it is natural for constraints to contain inequality groups which form some polyhedral cone. The suggested solution is to convert the problem to a problem in a space of new variables. The basis of the new space is a set of vectors forming a cone, or this set's convex hull and the null vector form the given polyhedral cone. It is shown that the considered approach leads to substantial simplifications in searching for the solution. The methods to identify the forming set of vectors are described. The suggested methodology is illustrated with an example at the end of the article.
Linear programming, cone, basis, cone constraints
1. Zangvill U.I. Nelineynoe programmirovanie. - M.: Sovetskoe radio, 1973. - 312 s.
2. Yudin D.B., Gol'shteyn E.G. Zadachi i metody lineynogo programmirovaniya. - M.: Sovetskoe radio, 1961. - 493 s.
3. Nikaydo H. Vypuklye struktury i matematicheskaya ekonomika. - M.: Mir, 1972. - 519 s.
4. Sevodin M.A., Semenova O.I. O konkurentnyh ravnovesiyah v modelyah ekonomicheskogo obmena rastuschego tipa s ogranicheniyami na ceny// Vestnik INZhEKONA, seriya: Ekonomika. 2012. - Vypusk 6(57) - S. 103-106
5. Gavrilova M.O., Novoselova Yu.V., Sevodin M.A. Ob odnoy modifikacii zadachi razmescheniya predpriyatiy pri planirovanii razvitiya otrasli//»Fundamental'nye issledovaniya», 2016, №2, ch.1. - S. 92-96
6. Taha H.A. Vvedenie v issledovanie operaciy. - M.: Izdatel'skiy dom «Vil'yams», 2005. - 912 s.
7. Kozlovskaya Ya.I., Sevodin M.A. O polozhenii ravnovesiya v sistemah leont'evskogo tipa s ogranicheniyami i netochnymi ishodnymi dannymi//» Nauka i biznes: puti razvitiya», 2015, №10(52). - S. 79-81
8. Tischenko A.V. Lineynaya algebra. Elementy analiticheskoy geometrii. - M.: Finakademiya, 2009. - 116 s.
