Scribd
Upload
137 views10 pages

Linear Programming Problem Solutions

The document contains solutions to 7 practice problems on linear programming. Problem 1 asks to identify the feasible region for a set of constraints. Problem 2 provides a linear program and asks to write it in standard form, graphically solve it, and find the slack variables. Problem 3 is similar but includes a surplus variable. Problem 4 asks to graph the feasible region, determine if it is bounded, find the optimal solution, and consider if an unbounded region implies an unbounded problem. Problems 5, 6, and 7 provide additional practice identifying feasible regions from constraints.

Uploaded by

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

Linear Programming Problem Solutions

The document contains solutions to 7 practice problems on linear programming. Problem 1 asks to identify the feasible region for a set of constraints. Problem 2 provides a linear program and asks to write it in standard form, graphically solve it, and find the slack variables. Problem 3 is similar but includes a surplus variable. Problem 4 asks to graph the feasible region, determine if it is bounded, find the optimal solution, and consider if an unbounded region implies an unbounded problem. Problems 5, 6, and 7 provide additional practice identifying feasible regions from constraints.

Uploaded by

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

Practice 1

Identify the feasible region for the following set of constraints.


0.5A + 0.25B ≥ 30
1A + 5B ≥ 250
0.25A + 0.5B ≤ 50
A, B ≥ 0
Solutions:
B

Practice 2
14
(3)

12

Consider the linear program below and answer the following questions.
10 (1)
Max 3A + 4B
s.t. 8
–1A + 2B ≤ 8
1A + 2B ≤ 12 6

2A + 1B ≤ 16 Optimal Solution
A = 20/3, B = 8/3
4
A, B ≥ 0 Value = 30 2/3

a. Write the problem in standard form. 2


b. Solve the problem using the graphical solution procedure. (2)

c. What are the values of the three slack variables at the optimal solution? 0
2 4 6 8 10 12
A

Solutions:
a.

Max 3A + 4B + 0S1 + 0S2 + 0S3    


s.t.                      
  −1A + 2B + 1S1         = 8 (1)
  1A + 2B     + 1S2     = 12 (2)
  2A + 1B         + 1S3 = 16 (3)
A, B, S1, S2, S3 ≥ 0
Practice 2
Consider the linear program below and answer the following B
questions.
14
Max 3A + 4B (3)

s.t. 12

–1A + 2B ≤ 8
10 (1)
1A + 2B ≤ 12
2A + 1B ≤ 16 8

A, B ≥ 0
6
a. Write the problem in standard form. Optimal Solution
b. Solve the problem using the graphical solution procedure. 4 A = 20/3, B = 8/3
Value = 30 2/3
c. What are the values of the three slack variables at the optimal
2
solution? (2)
Solutions: 0 A
2 4 6 8 10 12
b.
Practice 2
Consider the linear program below and answer the following questions.
Max 3A + 4B
s.t.
–1A + 2B ≤ 8
1A + 2B ≤ 12
2A + 1B ≤ 16
A, B ≥ 0
a. Write the problem in standard form.
b. Solve the problem using the graphical solution procedure.
c. What are the values of the three slack variables at the optimal solution?
Solutions:
c.
S1 = 8 + A – 2B = 8 + 20/3 − 16/3 = 28/3
S2 = 12 − A – 2B = 12 − 20/3 −16/3 = 0
S3 = 16 – 2A − B = 16 - 40/3 − 8/3 = 0
Practice 3
Consider the linear program below and answer the followingMin 6A + 4B
s.t.
2A + 1B ≥ 12
1A + 1B ≥ 10
1B ≤ 4
A, B ≥ 0
a. Write the problem in standard form.
b. Solve the problem using the graphical solution procedure.
c. What are the values of the slack and surplus variables?
Solutions:
a.
Min 6A + 4B + 0S1 + 0S2 + 0S3    
s.t.                      
  2A + 1B − S1         = 12
  1A + 1B     – S2     = 10
  A, B,  S , S , S  ≥ 0 1B         + S3 = 4
1 2 3
b. The optimal solution is A = 6, B = 4.
c. S1 = 4, S2 = 0, S3 = 0.
Practice 4
Consider the linear program below and answer the
following.
Max 1A – 2B
s.t.
–4A + 3B ≤ 3
1A – 1B ≤3
A, B ≥ 0
a. Graph the feasible region for the problem.
b. Is the feasible region unbounded? Explain.
c. Find the optimal solution.
d. Does an unbounded feasible region imply that the
optimal solution to the linear program will be
unbounded?

Solutions:
a.
Practice 4
Consider the linear program below and answer the following.
Max 1A – 2B
s.t.
–4A + 3B ≤ 3
1A – 1B ≤3
A, B ≥ 0
a. Graph the feasible region for the problem.
b. Is the feasible region unbounded? Explain.
c. Find the optimal solution.
d. Does an unbounded feasible region imply that the optimal solution to the linear program will be unbounded?

Solutions:
b. Feasible region is unbounded.
c. Optimal Solution: A = 3, B = 0, z = 3.
d. An unbounded feasible region does not imply the problem is unbounded. This will only be the case when it is
unbounded in the direction of improvement for the objective function.
Practice 5
Practice 6
Practice 7
Identify the feasible region for the following set of constraints.
2A – 1B ≤ 0
–1A + 1.5B ≤ 200
A, B ≥ 0
Solutions:

You might also like