Scribd
Upload
12 views4 pages

Graphical-Solution Sheet 2

The document contains 12 linear programming problems to solve using the graphical method. Each problem defines an objective function to maximize or minimize subject to multiple constraints on two variables X1 and X2, which must be greater than or equal to 0.

Uploaded by

Hesham chemecology
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
12 views4 pages

Graphical-Solution Sheet 2

The document contains 12 linear programming problems to solve using the graphical method. Each problem defines an objective function to maximize or minimize subject to multiple constraints on two variables X1 and X2, which must be greater than or equal to 0.

Uploaded by

Hesham chemecology
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 4

Sheet (2)

Solve the following LLP by graphical method


1. Max Z = 5 X1 + 3 X2
• Subject to constraints
2 X1 + X2 ≤ 1000
X1 ≤ 400
X2 ≤ 700
X1 , X2 ≥ 0.0
2. Max Z = 400 X1 + 200 X2
• Subject to constraints
18 X1 + 3 X2 ≤ 800
9 X1 + 4 X2 ≤ 600
X2 ≤ 150
X1 , X2 ≥ 0.0
3. Min Z = 20 X1 + 40 X2
• Subject to constraints
36 X1 + 6 X2 ≥ 108
3 X1 + 12 X2 ≥ 36
20 X1 + 10 X2 ≥ 100
X1 , X2 ≥ 0.0
4. Max Z = 10 X1 + 8 X2
• Subject to constraints
2 X1 + X2 ≤ 20
X1 + 3 X2 ≤ 30
X1 − 2 X2 ≥ − 15
X1 , X2 ≥ 0.0
5. Max Z = 4 X1 + 3 X2
• Subject to constraints
4 X1 + 3 X2 ≤ 24
X1 ≤ 4.5
X2 ≤ 6
X1 , X2 ≥ 0.0
6. Max Z = 3 X1 + 2 X2
• Subject to constraints
X1 + X 2 ≤ 1
X1 + X 2 ≥ 3
X1 , X2 ≥ 0.0
7. Max Z = 3 X1 + 5 X2
• Subject to constraints
2 X1 + X2 ≥ 7
X1 + X 2 ≥ 6
X1 + 3 X2 ≥ 9
X1 , X2 ≥ 0.0
8. Max Z = 3 X1 + 2 X2
• Subject to constraints
9 X1 + 10 X2 ≤ 90
X1 − X2 ≤ 2
14 X1 + 26 X2 ≤ 91
−X1 + X2 ≤ 2
X1 , X2 ≥ 0.0
9. Max Z = 5 X1 + 3 X2
• Subject to constraints
X1 ≤ 3
X2 ≤ 4
−X1 + 3 X2 ≥ 0
X1 , X2 ≥ 0.0
10. Max Z = 6 X1 + 2 X2
• Subject to constraints
X1 − X2 ≤ 1
3 X1 − X2 ≤ 6
X1 , X2 ≥ 0.0
11. Max Z = 6 X1 + 2 X2
• Subject to constraints
X1 + X 2 ≤ 5
X2 ≤ 4
X1 = 3
X1 , X2 ≥ 0.0
12. Max Z = 3 X1 + 2 X2
• Subject to constraints
X1 + 2 X 2 ≤ 6
2 X1 + X2 ≤ 8
− X1 + X2 ≤ 1
X2 ≤ 2
X1 , X2 ≥ 0.0
• If the coefficient of X1 increased by 200 % , how will it affect the
optimum point.

Course Instructor
DR. MOHAMED ABBAS EL-NAGGER

You might also like