Académique Documents
Professionnel Documents
Culture Documents
Cive208 As2022 3
Cive208 As2022 3
Method of Submission:
o Assemble all your answers to the problems of the Assignment in one SINGLE PDF
file (phone scanner apps could be used to scan your answers).
o Please upload the PDF file of your answers on the myCourses web site (under the
Assignments Tab) before the deadline.
Problem 1
Solve the following linear programming problem graphically and by the simplex method:
Maximize Z = 2 x1 + 3x 2
subject to x1 + 2 x 2 £ 4
x1 + x 2 = 3
x1 ³ 0, x 2 ³ 0
Problem 2
Given the following linear programming problem:
Maximize Z = 5 x1 + 6 x 2
subject to x1 + x 2 £ 12
2 x1 - x 2 ³ 4
3x1 - 4 x 2 = 6
x1 ³ 0, x 2 ³ 0
Maximize Z = - x1 + 4 x2
- 3x1 + x2 £ 6
x1 + 2 x2 £ 4
x2 ³ -3
x1 is unrestricted in sign