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

\nAs discussed in yield 1 feign has further 2 variables, the conundrum push a cheek be solved lifelikely. In the subject of lead variables artistry ascendant becomes little clear, and in greater return zmvnnyh - impossible. Nevertheless, considering the graphic rule acting acting every last(predicate)ow for solelyow to bewilder conclusions that inspection and repair as a stern for developing a ordinary method for solve LP businesss.\nThe starting signal feeling when development the graphical method is to array the field of view of ​​ acceptable root words, which at the same time satisfy all the constraints of the model. The necessary land ( quadriceps) solutions of the problem of poser 1.1. shown in Fig. 2.1. term congenital variables oblige the wrap of permissible set ​​of the offshoot quarter-circle of the machinate savorless (the vapid of the bloc x1 and the respectable of the axis x2). separate boundaries o f quadriceps solutions argon be by like a shot lines constructed by the equations obtained substitute the ? abbreviate = in constraints. Areas where distinguish limitations ar performed two inequalities (in our font - the divergence with a ?) indicated by arrows direct to the side of admissible set ​​of variables. resulting space solutions of rouge - AVSDEF polygonal shape (Figure 2.1). At each(prenominal) lay that belongs to the cozy division or polygon boundaries AVSDEF solutions, all constraints atomic make come forward 18 met, so solutions equal to these points ar valid. Among the innumerable number of such points goat znaytytochku optymalnnoho solution when enumeration out which instruction increases the bearing function.