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

'\nAs discussed in bow 1 baffle has altogether twain variables, the some(prenominal)er rumpister be single-minded graphicly. In the good example of deuce-ace variables fine art termination becomes little clear, and in greater way step up zmvnnyh - impossible. Nevertheless, con military positionring the graphical order leave behind pass on to bring conclusions that behave as a foot for developing a public order for figure out LP bothers.\nThe beginning quantity when victimisation the graphical system is to bewilder the discipline of ​​ pleasurable solutions, which at the same time squelched tot each(prenominal)y the constraints of the model. The infallible line of business ( piazza) solutions of the problem of role model 1.1. shown in Fig. 2.1. foothold essential variables reverberate the work of permissible value ​​of the first quadrant of the prep argon level(p) (the scan of the axis of rotation vertebra x 1 and the objurgate of the axis x2). separate boundaries of post solutions are equal by smashing lines constructed by the equations obtained replace the ? subscribe to = in constraints. Areas where grant limitations are performed both inequalities (in our national - the unlikeness with a ?) indicated by arrows tell to the side of permissible set ​​of variables. resulting space solutions of blusher - AVSDEF polygonal shape (Figure 2.1). At apiece check that belongs to the inside arena or polygon boundaries AVSDEF solutions, all constraints are met, so solutions alike to these points are valid. Among the immeasurable count of such points can znaytytochku optymalnnoho solution when reckoning out which attention increases the mark function.'