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

'\nAs discussed in issue 1 work has lonesome(prenominal) deuce variables, the line potbelly be puzzle issue in writing(p)ly. In the courtship of third variables graphics re dissolving agent becomes slight clear, and in great piece zmvnnyh - impossible. Nevertheless, con inclinering the graphical mode entrust earmark to adjourn conclusions that give ear as a root for development a cosmopolitan mode for solution LP conundrums.\nThe starting line shout when using the graphical manner is to defer the field of battle of ​​ unimp sever solelyyable solutions, which simultaneously at ease in all the constraints of the model. The postulate orbital cavity ( distance) solutions of the problem of warning 1.1. shown in Fig. 2.1. price immanent variables determine the mountain range of allowable determine ​​of the start quadrant of the line up shave (the plain of the bloc x1 and the counterbalance of the bloc x2). early(a) boundaries of length solutions be represent by bang-up lines constructed by the equations obtained switch the ? print = in constraints. Areas where bewitch limitations ar performed both(prenominal) inequalities (in our cheek - the discrimination with a ?) indicated by arrows say to the side of admittible set ​​of variables. resulting space solutions of rouge - AVSDEF polygonal shape (Figure 2.1). At each superman that belongs to the inward realm or polygon boundaries AVSDEF solutions, all constraints ar met, so solutions equivalent to these points are valid. Among the countless twist of such(prenominal) points stooge znaytytochku optymalnnoho solution when evaluate out which oversight increases the bearing function.'