Let x1 represent chocolate ice cream and x2 vanillaThe linear program in the given problem is Maximize:5x1+7x2Subject to: 6x1+9x2≤3608x1+5x2≤400The linear program in its standard form is Maximize:5x1+7x2+0x3+0x4Subject to: 6x1+9x2+x3=3608x1+5x2+x4=400Next we form our first Tableau from our linear programx3x400x1568−5x2795−7x30100x400103604000Next, we locate the most negative number in the bottom row(-7), and label the columnwhere it is found the work column , we then form positive ratios by dividing the elementsin the work column by corresponding elements in the last column. Next we label the the smallest positive ratio, the pivot element. Using elementary row operations we reduce the pivot element to 1 and other elements in the work column to 0 to obtainour tableau 2x2x470x1532314−31x27100x3091−9597x4001040200280We observe that there is still a negative element in the bottom row, repeating the process we obtain tableau 2x2x175x15010x27100x30214−126154231x40−711431411173427629472Since there are no negative elements in the bottom row, the solution is feasible. The company should produce 5 of chocolate ice cream and 7 of vanillaThe maximum values is 290 to the nearest tenth
Comments