Name:       Date Taken:           /          /               

Math 181: Test for Chapter 4: Linear Programming

This test may be taken with a calculator and any number of hand-written notes. Computers or books and other printed material, be they copies, printouts, or typed, are not allowed.
Place your answer in space provide for each question. Note that correct answers have integer values.
Notice: this page changes every time it is loaded, or re-loaded (refreshed).
Be careful to read all of each problem. Because these pages are produced on the WEB, for printed versions of these pages there is a chance that a problem, or its possible answers, will be split across two pages.
____________________ 1.-7.
____________________ 8.
____________________ 9.
____________________ 10.
____________________ 11.
____________________ 12.-18.
____________________ 19.
____________________ 20.
____________________ 21-22.
____________________ 23-24. Use the simplex method to find the values that maximize the objective expression using the constraints given in problem 21-22. Provide the maximum value and the values for the various variables.
____________________ 25.-26. Use the simplex method to find the values that minimize the expression using the same constraints as in problem 21-22. Provide the minimum value and the values for the various variables.
____________________ 27.-28. Below is a set of inequalities in four variables, w, x, y, and z. These inequalities describe a bounded, convex space. The Simplex Method can be used to minimize or maximize an objective function over this space. Needless to say, this is a substantial task. Care must be taken to correctly state the inequalities and then to enter them into the calculator.
Click on the See Answers button to display the answers in a new window.


©Roger M. Palay     Saline, MI 48176     October, 2010