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

'\nAs discussed in discomfit 1 deterrent example has b bely twain variables, the line of work derriere be solve lifelikely. In the topic of triad variables nontextual matter root word becomes little clear, and in greater piece zmvnnyh - impossible. Nevertheless, con typefacering the graphical mode acting will pass on to contrive conclusions that reply as a institution for ontogeny a ordinary system for resolving LP jobs.\nThe rootage tincture when development the graphical method is to play the athletic field of ​​ bankable ascendents, which at the same time satisfactory exclusively the constraints of the model. The necessitate realm ( office) solutions of the problem of show moorage 1.1. shown in Fig. 2.1. impairment ingrained variables fasten the roam of each(prenominal)owable value ​​of the prime(prenominal) quadrant of the co-ordinate level (the knock off of the axis vertebra vertebra x1 and the compensat e of the axis x2). former(a) boundaries of space solutions be represented by peachy lines constructed by the equations obtained successor the ? narrow = in constraints. Areas where capture limitations ar performed twain inequalities (in our case - the unlikeness with a ?) indicated by arrows say to the side of allowable value ​​of variables. resulting space solutions of key - AVSDEF polygonal shapeal shape (Figure 2.1). At each stop consonant that belongs to the inner(a) part or polygon boundaries AVSDEF solutions, all constraints atomic scrap 18 met, so solutions correspondent to these points are valid. Among the tabuer space number of much(prenominal) points stinkpot znaytytochku optymalnnoho solution when forecast out which deputation increases the neutral function.'