Question on ( Simplex method )

Homework 2

Solve the following linear program.

Maximize c1x1 + c2x2 + c3x3 + c4x4

Subject to:

a11x1 + a12x2 + a13x3 + a14x4 ≤ b1

a21x1 + a22x2 + a23x3 + a24x4 ≤ b2

x1, x2, x3, x4 ≥ 0

where the values of the c’s, a’s and b’s are shown next to your name in the excel file.

1. This HW is due on Wednesday 15 October at 8 PM. Submit the HW through Blackboard.

2. This HW will be graded out of 50.

3. Solve the HW as shown in the hand out that I posted earlier. Follow the steps in the second part in the hand out which is below the line.

4. The HW should be typed on word in the same way I solved, write x1 not x1.

5. If I receive a trivial question, you lose 5 points.

6. You will receive points for submitting a correct HW before its due date. Check the table

If you submit the HW before 8 PM on 3 Oct you receive 40% credit

8 PM ON 6 Oct you receive 30% credit

8 PM ON 9 Oct you receive 20% credit

8 PM ON 12 Oct you receive 10% credit

7. I will be generous with serious students.