Let the students use the Simplex method to find the answer to the problem of a linear schedule at the end of Chapter 4 as follows:

4.1-2. Consider the following problem. MaximizeZ=3x1+2x2, subject to 2x1+x26x1+2x26 and x10,x20. (a) Use the graphical method to solve this problem. Circle all the corner points on the graph. (b) For each CPF solution, identify the pair of constraint boundary equations it satisfies. (c) For each CPF solution, identify its adjacent CPF solutions. (d) Calculate Z for each CPF solution. Use this information to identify an optimal solution. (e) Describe graphically what the simplex method does step by step to solve the