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

'\nAs discussed in subject 1 model has solitary(prenominal) two variables, the hassle buttocks be solved in writing(p)ly. In the chance of troika variables graphics upshot becomes less clear, and in greater enactment zmvnnyh - impossible. Nevertheless, considering the graphical rule will consent to to draw conclusions that lot as a basis for ontogeny a universal method for work out LP problems.\nThe first graduation when using the graphical method is to puzzle the bea of ​​ unimp individu everyyable solutions, which simultaneously fulfil all the constraints of the model. The undeniable area (outer outer space) solutions of the problem of Example 1.1. shown in Fig. 2.1. Terms inbred variables restrict the twine of admittable set ​​of the first quadrant of the coordinate sheet (the plane of the bloc of rotation x1 and the right of the axis x2). Other boundaries of space solutions are delineated by swell lines constructed by the equa tions obtained surrogate the ? Sign = in constraints. Areas where appropriate limitations are performed both inequalities (in our case - the inequality with a ?) indicated by arrows say to the side of admissible values ​​of variables. resulting space solutions of paint - AVSDEF polygonal shape (Figure 2.1). At each point that belongs to the informal region or polygon boundaries AVSDEF solutions, all constraints are met, so solutions corresponding to these points are valid. Among the infinite make out of such points can znaytytochku optymalnnoho solution when estimate out which stress increases the objective function.'