| Syllabus | Contact Info | Computer Club |

Herbert J. Bernstein Professor of Mathematics and Computer Science
Dept. of Mathematics and Computer Science, 1300 William Floyd Parkway, B205, Shirley, NY 11967

90103 MTH 1007 Operations Research -- Fall 2013 On Line Course Quiz 7

This web page is http://www.bernstein-plus-sons.com/.dowling/MTH1007F13/MTH1007_Quiz_7.html

This is the seventh quiz for MTH 1007 due on on Wednesday, 6 November 2013 This quiz should be taken after reading Chapter 4 and making a first pass at viewing the videos on linear programming and the simplex method. It should take you between half an hour and two hours to answer these questions.

<==== Do this AFTER you've answered all the questions

You probably DON'T want to do this ===>

Please fill in the following information:

Name:

Email:

Skype ID:

Please answer the following questions on this form (or on a paper copy of this form).

1. Explain what the linear programming model in general as well as using the example of Braddock Plastics as a detailed example.

2. Consider the linear constraints: x ≥ 0, y ≥ 0; 3x + 2y ≤ 6; 2x + 3y ≤ 6. Descibe in detail the feasible region for these constraints, giving each of the corners of the region.

3. Consider the linear constraints: x ≥ 0, y ≥ 0; 3x + 2y ≤ 6; 2x + 3y ≤ 6. Maximize the objective function P = 1.1x + 1.2y subject to these constraints using your answer to question 2. Show your work.

4. Consider the linear constraints: x ≥ 0, y ≥ 0; 3x + 2y ≤ 6; 2x + 3y ≤ 6. Consider the objective function P = 1.1x + 1.2y. Following the example on pages 172 ff in the book, introduce slack variables and create an initial simplex tableau for maximizing the objective function subject to these constraints. subject to these constraints using your answer to question

5. Use the tableau you created in question 4 and apply the simplex method to maximize the objective function subject to these constraints. Show your work.

<==== Do this AFTER you've answered all the questions

You probably DON'T want to do this ===>

Revised 20 October 2013