0% found this document useful (0 votes)
10 views

Assignment 2

The document contains an assignment with 3 linear programming problems to solve using the geometric approach. Students must show their work and only a sample will be graded. The problems involve maximizing and minimizing objective functions subject to various inequality constraints involving x1 and x2.
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
10 views

Assignment 2

The document contains an assignment with 3 linear programming problems to solve using the geometric approach. Students must show their work and only a sample will be graded. The problems involve maximizing and minimizing objective functions subject to various inequality constraints involving x1 and x2.
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 1

Assignment 2

Due Date: no later than Sunday November 20, 2005 11:00 am


You loose 20% per day if you are late
Dr. Guillaume Leduc

Name , ID# ,

***For all questions, make sure to show all the relevant work***
***Only a sample of your answers will be graded***

1. Solve the following Linear Programming Problem using the geometric approach. If no solution can be
found, indicate it.
Maximize and Minimize z = −3x1 + 2x2
Subject to: x2 ≤ 4
4x1 − x2 ≥ 0
x1 + x2 ≥ 1
x1 ≤ 5
x1 , x 2 ≥ 0

2. Solve the following Linear Programming Problem using the geometric approach. If no solution can be
found, indicate it.
Maximize and Minimize z = 4x1 + 3x2
Subject to: x1 − x2 ≥ 0
x1 − x2 ≤ 4
x1 + x2 ≥ 2
x1 , x 2 ≥ 0

3. Solve the following Linear Programming Problem using the geometric approach. If no solution can be
found, indicate it.
Maximize and Minimize z = x1 + x2
Subject to: 3x1 + 4x2 ≤ 12
5x1 + 6x2 ≥ 30
x1 , x 2 ≥ 0

You might also like