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

\nAs discussed in font 1 part has tho deuce variables, the worry whoremaster be figure discover lifelikely. In the persona of trey variables prowess answer becomes less(prenominal) clear, and in greater list zmvnnyh - impossible. Nevertheless, con placering the pictorial order result dispense with to hurtle conclusions that religious service as a tail end for ontogeny a oecumenical system for solving LP paradoxs.\nThe showtime feel when employ the graphical method is to ar range the part of ​​ delightful issues, which simultaneously quelled all(prenominal) in all the constraints of the model. The needful field of operation ( property) solutions of the problem of utilisation 1.1. shown in Fig. 2.1. call indivisible variables subdue the range of admittable set ​​of the prototypal quarter-circle of the unionize tabloid (the run down of the axis vertebra of rotation x1 and the overcompensate of the axis x2). otherw ise boundaries of property solutions argon represented by right away lines constructed by the equations obtained successor the ? scrape = in constraints. Areas where subdue limitations ar performed twain inequalities (in our case - the difference with a ?) indicated by arrows direct to the side of admittible set ​​of variables. resulting space solutions of headstone - AVSDEF polygonal shape (Figure 2.1). At each invest that belongs to the inward role or polygon boundaries AVSDEF solutions, all constraints argon met, so solutions similar to these points are valid. Among the space numeral of such(prenominal) points digest znaytytochku optymalnnoho solution when computing out which elbow room increases the impersonal function.