Scribd
Upload
0 views

Tutorial_7

This document contains a tutorial on linear programming with various optimization problems to solve. It includes maximizing and minimizing functions subject to multiple constraints, as well as graphical methods for finding solutions. Additionally, it addresses scenarios with no feasible solutions and explores the impact of variable parameters on optimal solutions.

Uploaded by

ibrahemashhab
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
0 views

Tutorial_7

This document contains a tutorial on linear programming with various optimization problems to solve. It includes maximizing and minimizing functions subject to multiple constraints, as well as graphical methods for finding solutions. Additionally, it addresses scenarios with no feasible solutions and explores the impact of variable parameters on optimal solutions.

Uploaded by

ibrahemashhab
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

Discrete Math.

& Linear Programming BES 114


Tutorial #7
”Introduction to Linear Programming”
1. Maximize Z = 2x1 + x2 , subject to:
x2 ≤ 10
2x1 + 5x2 ≤ 60
x1 + x2 ≤ 18
3x1 + x2 ≤ 44
x1 ≥ 0, x2 ≥ 0

2. Maximize Z = 10x1 + 20x2 , subject to:


−x1 + 2x2 ≤ 15
x1 + x2 ≤ 12
5x1 + 3x2 ≤ 45
x1 ≥ 0, x2 ≥ 0

3. Maximize Z = x1 + 2x2 , where the value of k has not yet been ascertained, subject to:
−x1 + x2 ≤ 2
x2 ≤ 3
kx1 + x2 ≤ 2k + 3 (k ≥ 0)
x1 ≥ 0, x2 ≥ 0
The solution currently being used is x1 = 2, x2 = 3. Use graphical analysis to determine the values of
k such that this solution actually is optimal.
4. Use the graphical method to find all optimal solutions for the following model:
Maximize Z = 500x1 + 300x2 , subject to:
15x1 + 5x2 ≤ 300
10x1 + 6x2 ≤ 240
8x1 + 12x2 ≤ 450
x1 ≥ 0, x2 ≥ 0

5. Demonstrate that the following model has no feasible solutions:


Maximize Z = 5x1 + 7x2
Subject to
2x1 − x2 ≤ −1
− x1 + 2x2 ≤ −1
x1 ≥ 0, x2 ≥ 0

6. Use the graphical method to solve this problem:


Minimize Z = 15x1 + 20x2 , subject to:
x1 + 2x2 ≥ 10
2x1 − 3x2 ≤ 6
x1 + x2 ≥ 6
x1 ≥ 0, x2 ≥ 0
7. Use the graphical method to solve this problem:
Minimize Z = 3x1 + 2x2 , subject to:

x1 + 2x2 ≤ 12
2x1 + 3x2 = 12
2x1 + x2 ≥ 8
x1 ≥ 0, x2 ≥ 0

8. Consider the following problem, where the value of c1 has not yet been ascertained:

Maximize Z = c1 x1 + 2x2
Subject to
4x1 + x2 ≤ 12
x1 − x2 ≥ 2
x1 ≥ 0, x2 ≥ 0

Use graphical analysis to determine the optimal solution(s) for (x1 , x2 ) for various possible values of
c1 .

You might also like