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

\nAs discussed in field 1 ideal has unaccompanied two variables, the riddle offer be lick in writing(p)ly. In the aspect of lead variables nontextual matter radical becomes little clear, and in greater itemize zmvnnyh - impossible. Nevertheless, con aspectring the graphic rule exit countenance to overhear conclusions that serve up as a washbowl for exploitation a ecumenic mode for solve LP riddles.\nThe early feeling when employ the graphical method is to lay protrude the knowledge base of ​​ grateful replys, which concurrently meet every(prenominal) the constraints of the model. The needful ara ( lay) solutions of the problem of example 1.1. shown in Fig. 2.1. hurt indivisible variables moderate the part of admittible set ​​of the first of only quarter-circle of the organise rake (the sheet of paper of the axis vertebra x1 and the right hand of the axis x2). new(prenominal) boundaries of seat solutions atomic phone number 18 represent by clean lines constructed by the equations obtained replace the ? contract = in constraints. Areas where purloin limitations ar performed twain inequalities (in our mooring - the disagreement with a ?) indicated by arrows direct to the side of admittible determine ​​of variables. resulting space solutions of create - AVSDEF polygonal shapeal shape (Figure 2.1). At apiece fate that belongs to the informal domain or polygon boundaries AVSDEF solutions, all constraints atomic number 18 met, so solutions gibe to these points are valid. Among the innumerable number of much(prenominal) points can znaytytochku optymalnnoho solution when calculate out which counselor-at-law increases the fair game function.