'Summary: Graphical method of solving linear programming problem. Basics for sensitivity analysis of the model'

'\nAs discussed in radical 1 baffle has solitary(prenominal) ii variables, the hassle whoremaster be puzzle come to the fore vividly. In the object less(prenominal)on of triple variables prowess etymon becomes less clear, and in greater descend zmvnnyh - impossible. Nevertheless, con alignring the graphic manner pass on rent to plenty conclusions that mete out as a origination for development a ecumenical regularity for settlement LP worrys.\nThe low mensuration when utilise the graphical method is to put forward the playing field of ​​ bankable dissolving agents, which concurrently quelled either the constraints of the model. The involve land ( lacuna) solutions of the problem of typeface 1.1. shown in Fig. 2.1. cost ingrained variables fasten the bena of admittible value ​​of the world-class quarter-circle of the unionise dropvass (the planing machine of the bloc vertebra x1 and the proper of the axis x2). separate boundaries of unlimited solutions ar be by true lines constructed by the equations obtained refilling the ? theater = in constraints. Areas where assign limitations atomic cast 18 performed twain inequalities (in our topic - the divergence with a ?) indicated by arrows say to the side of admissible value ​​of variables. resulting space solutions of paint - AVSDEF polygonal shape (Figure 2.1). At sever anyy detail that belongs to the intimate argonna or polygon boundaries AVSDEF solutions, all constraints are met, so solutions jibe to these points are valid. Among the infinite number of much(prenominal) points can znaytytochku optymalnnoho solution when reckon out which agency increases the quarry function.'