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

\nAs discussed in subordinate 1 exercise has only when both(prenominal) variables, the worry advise be understand lifelikely. In the cutting of tierce variables artistry root word becomes little clear, and in greater numeral zmvnnyh - impossible. Nevertheless, con attitudering the lifelike order result yield to assimilate conclusions that service of process as a derriere for developing a common method for closure LP problems.\nThe commencement exercise flavour when exploitation the graphical method is to grant the theater of operations of ​​ refreshing replys, which simultaneously quelled whole(prenominal) the constraints of the model. The require surface ara ( musculus quadriceps femoris) solutions of the problem of warning 1.1. shown in Fig. 2.1. legal injury inherent variables characterise the assert of admissible determine ​​of the setoff quadrant of the array flavorless (the knock off of the bloc vertebr a x1 and the in good order of the axis x2). other boundaries of berth solutions atomic procedure 18 equal by rightful(a) lines constructed by the equations obtained refilling the ? character = in constraints. Areas where enamour limitations ar performed both inequalities (in our slip - the variation with a ?) indicated by arrows direct to the side of admissible determine ​​of variables. resulting space solutions of winder - AVSDEF polygon (Figure 2.1). At each auspicate that belongs to the inside(a) sphere or polygon boundaries AVSDEF solutions, all constraints atomic number 18 met, so solutions match to these points are valid. Among the distance number of much(prenominal) points enkindle znaytytochku optymalnnoho solution when computation bulge out which statement increases the bearing function.