HO CHI MINH CITY UNIVERSITY OF TECHNOLOGY

OFFICE FOR INTERNATIONAL STUDY PROGRAMS

COMPUTER APPLICATIONS FOR

INDUSTRIAL ENGINEERING

LINEAR PROGRAMMING

School year: 2021 - 2022

Executive teacher: Hồ Thanh Phong

Class : CC01
Student : Thái Thị Minh Trâm - 2014816

Ho Chi Minh City, 12 Jan 2022

 TABLES OF CONTENT

I. PROBLEM 1
1. EXERCISE 3.1 - 7 2
2. EXERCISE 3.1 - 8 3
3. EXERCISE 3.1 - 9 3
4. EXERCISE 3.1 - 10 4
5. EXERCISE 3.1 - 11 4
6. EXERCISE 3.1 - 12 5
7. EXERCISE 3.1 - 13 5
II. SOLUTION 7
1. EXERCISE 3.1 - 7 7
2. EXERCISE 3.1 - 8 11
3. EXERCISE 3.1 - 9 13
4. EXERCISE 3.1 - 10 17
5. EXERCISE 3.1 - 11 19
6. EXERCISE 3.1 - 12 21
7. EXERCISE 3.1 - 13 22

1
 I. PROBLEM
EXERCISE 3.1-7
The Whitt Window Company, a company with only three employees, makes two
different kinds of hand-crafted windows: a wood-framed and an aluminum-framed
window. The company earns $300 profit for each wood-framed window and $150 profit
for each aluminum-framed window. Doug makes the wood frames and can make 6 per
day. Linda makes the aluminum frames and can make 4 per day. Bob forms and cuts the
glass and can make 48 square feet of glass per day. Each wood-framed window uses 6
square feet of glass and each aluminum-framed window uses 8 square feet of glass. The
company wishes to determine how many windows of each type to produce per day to
maximize total profit.
(a) Describe the analogy between this problem and the Wyndor Glass Co. problem
discussed in Sec. 3.1. Then construct and fill in a table like Table 3.1 for this problem,
identifying both the activities and the resources.
(b) Formulate a linear programming model for this problem.
(c) Use the graphical method to solve this model.
(d) A new competitor in town has started making wood-framed windows as well. This
may force the company to lower the price they charge and so lower the profit made for
each wood-
framed window. How would the optimal solution change (if at all) if the profit per wood-
framed window decreases from $300 to$200? From $300 to 100? (You may find it
helpful to use
the Graphical Analysis and Sensitivity Analysis procedure in IOR Tutorial.)
(e) Doug is considering lowering his working hours, which would decrease the number of
wood frames he makes per day. How would the optimal solution change if he makes only
5 wood frames per day? (You may find it helpful to use the Graphical Analysis and
Sensitivity Analysis procedure in IOR Tutorial.)

2
EXERCISE 3.1-8
The WorldLight Company produces two light fixtures (products 1 and 2) that
require both metal frame parts and electrical components. Management wants to
determine how many units of each product to produce so as to maximize profit. For each
unit of product 1, 1 unit of frame parts and 2 units of electrical components are required.
For each unit of product 2, 3 units of frame parts and 2 units of electrical components are
required. The company has 200 units of frame parts and 300 units of electrical
components. Each unit of product 1 gives a profit of $1, and each unit of product 2, up to
60 units, gives a profit of $2. Any excess over 60 units of
product 2 brings no profit, so such an excess has been ruled out.
(a) Formulate a linear programming model for this problem.
(b) Use the graphical method to solve this model. What is the resulting total profit?
EXERCISE 3.1-9
The Primo Insurance Company is introducing two new product lines: special risk
insurance and mortgages. The expected profit is $5 per unit on special risk insurance and
$2 per unit on mortgages. Management wishes to establish sales quotas for the new
product lines to maximize total expected profit. The work requirements are as follows:

(a) Formulate a linear programming model for this problem.

(b) Use the graphical method to solve this model.
(c) Verify the exact value of your optimal solution from part (b) by solving algebraically
for the simultaneous solution of the relevant two equations.

3
EXERCISE 3.1-10
Weenies and Buns is a food processing plant which manufactures hot dogs and hot dog
buns. They grind their own flour for the hot dog buns at a maximum rate of 200 pounds
per week. Each hot dog bun requires 0.1 pound of flour. They currently have a contract
with Pigland, Inc., which specifies that a delivery of 800 pounds of pork product is
delivered every Monday. Each hot dog requires ¼ pound of pork product. All the other
ingredients in the hot dogs and hot dog buns are in plentiful supply. Finally, the labor
force at Weenies and Buns consists of 5 employees working full time (40 hours per week
each). Each hot dog requires 3 minutes of labor, and each hot dog bun requires 2 minutes
of labor. Each hot dog yields a profit of $0.88, and each bun yields a profit of $0.33.
Weenies and Buns would like to know how many hot dogs and how many hot dog buns
they should produce each week so as to achieve the highest possible profit.
(a) Formulate a linear programming model for this problem.
(b) Use the graphical method to solve this model.
EXERCISE 3.1-11*
The Omega Manufacturing Company has discontinued the production of a certain
unprofitable product line. This act created considerable excess production capacity.
Management is considering devoting this excess capacity to one or more of three
products; call them products 1, 2, and 3. The available capacity on the machines that
might limit output is summarized in the following table:

The number of machine hours required for each unit of the respective products is

4
The sales department indicates that the sales potential for products 1 and 2 exceeds the
maximum production rate and that the sales potential for product 3 is 20 units per week.
The unit profit would be $50, $20, and $25, respectively, on products 1, 2, and 3. The
objective is to determine how much of each product Omega should produce to maximize
profit.
(a) Formulate a linear programming model for this problem.
(b) Use a computer to solve this model by the simplex method.
EXERCISE 3.1-12
Consider the following problem, where the value of c 1 has not yet been ascertained.
Maximize Z =c 1 x 1+ x 2 ,
subject to
x1 + x2 ≤ 6
x 1 + 2 x 2 ≤ 10
And
x 1≥ 0 , x 2≥ 0 ,
Use graphical analysis to determine the optimal solution(s) for (x1, x2) for the various
possible values of c 1(-∞ <c 1 <∞ ).
EXERCISE 3.1-13
Consider the following problem, where the value of k has not yet been ascertained.
Maximize Z = x 1+ 2 x2 ,
subject to
-x1 + x2 ≤ 2
x2 ≤ 3
k x 1 + x 2 ≤ 2k + 3, where k ≥ 0
And
x 1≥ 0 , x 2≥ 0

5
The solution currently being used is x 1 = 2, x 2 = 3. Use graphical analysis to determine
the values of k such that this solution actually is optimal.

II. SOLUTION
EXERCISE 3.1-7

6
 (a) Linear programming model

Glass needed per products Glass available per

Employee production
Product

X1 (Aluminum) X2 (Wood)

Doug 0 6 36

Linda 4 0 32

Bob 8 6 48

Profit per batch $150 $300

- The data in example 3.1 is used to determine the maximum profit _ the number of
working hours
- The data in table 1 which is raw materials of glass used to determine the
maximization of the profit
(b) Linear programming model.
Z = 8x1 + 6x2 with constraints 6x2 ≤ 36 ; 8x1 ≤ 32
8x1 + 6x2 ≤ 48
x1,x2 ≥ 0
Maximize Z = 8x1 + 6x2 to get the points of the boundary on the graph we say

when 6x2= 36 = > x2=6

When 8x1= 32 => x1=4

to get the line of intersect , we go to

8x1 + 6x2 ≤ 48

so, 8x1 + 6x2 = 48

7
When x1=0 = > 6x2=48 => x2=8

When x2=0 => x1=6

❖ IN LINGO

CODE

RESULT

(c) Graphical method

❖ Linear programming model of Whitt Company on Excel.

8
 ➔ Therefore we can calculate:

Corner points Z values

A (2.67, 4) 45.33

C (6, 1.5) 57
D (6, 0) 48

E (0,4) 16
⇒ The profit is maximized at C (6,1.5) with value $57
(d) Optimal solution change if the profit per wood-framed window decreases from $300
to $200 and from $300 to 100

Amount windows made per day Amount of glass

Employee per production
Types
(feet)
X1 (Aluminum) X2 (Wood)

Doug 0 6 36

Linda 4 0 32

Bob 8 6 48

9
 Profit per batch $150 $200 ($100)

The optimum construct by IOR when the The optimum construct by IOR when the
profit per wood-framed window is reduced to $100 profit per wood-framed window is reduced to $200.

● To reach the optimal with the price of $200, the company has to produce 6
aluminium windows and 0 wood windows per day.
● To maximize the profit with the price of $100, the company has to produce 1.5
aluminium and 6 wood windows
(e) Optimal solution change if making only 5 wood frames per day

Amount windows made per day Amount of glass

Employee per production
Types
(feet)
X1 (Aluminum) X2 (Wood)

10
 Doug 6 -> 5 0 36

Linda 4 0 32

Bob 8 6 48

Profit per batch $150 $300

EXERCISE 3.1-8
(a) Linear programming model

Amount products made per day Amount of

Product available
Types
components for the
X1 (Product 1) X2 (Product 2) products (units)

Metal frame parts 1 3 200

Electrical 2 2 300
components

Profit per batch $1 $2

Z = x1 + 2x2 with constraints x1 + 3x2 ≤ 200

2x1 + 2x2 ≤ 300
x2 ≤ 60,x1, x2 ≥ 0

❖ IN LINGO

CODE

11
RESULT

(b) Graphical methodWhat is the resulting total profit

❖ Linear programming model of WorldLight Company on Excel.

12
 ➔ Therefore we can calculate:

Corner points Z values

A(0, 66.67) 133.3333

B (125, 25) 150

D (150, 0) 175

⇒ the maximum profit is at point B (125, 25) with a value of $150.

EXERCISE 3.1-9
(a) Linear programming model
FORMULAR
Z = 5x1 + 2x2
With constraints 3x1 + 2x2 ≤ 2400
x2 ≤ 800
2x1 ≤ 1200
x1,x2 ≥ 0
❖ IN LINGO

13
CODE

RESULT

(b) Graphical method

❖ Linear programming model of Primo Insurance Company on Excel.

14
 ➔ Therefore we can calculate:

Corner points Z values

A (266.67, 800) 2933.333

B (600, 300) 3600

C (600, 800) 4600

(c) Verify the exact value of your optimal solution from part (b) by solving algebraically
for the simultaneous solution of the relevant two equations.
We have Z = 5x1 + 2x2
With constraints : 3x1 + 2x2 =< 2400 (1)
x2 =< 800 (2)
2x1 =< 1200 (3)
x1 =< 0, x2 =< 0
From (1) we have

x1 x2

0 1200

800 0

From (2) we have

15
 x1 x2

0 800

From (3) we have

x1 x2

600 0

➔ With x1 = 600 , Plug x1 into 3x1 + 2x2 = 2400 => 3(600) + 2x2 = 2400 => x2 =
300
➔ With x2 = 800 , Plug x2 into 3x1 + 2x2 = 2400 => 3x2 + 2(800) = 2400 => x1 =
266,67
From these points we have graph

A(0,1
200) C(266.6, D(600,80
B(0,8 800) 0)
00)
E(600,300)

A(600 A(800
O ,0) ,0) X

➔ Therefore we can calculate:

Corner points Z values

C(266.67, 800) 2933.333

16
 E (600, 300) 3600

D (600, 800) 4600

=> The maximum point is at D (600, 800) with a value of $4600.

EXERCISE 3.1-10.
(a) Linear programming model.

Amount products made per day Amount of

Product available
Types
components for the
X1 (Hot dog) X2 (Hot dog bun) products (units)

Flour 0 0.1 200

Pork ¼ 0 800

Labor minutes 3 2 12000

Profit per batch $0.88 $0.33

FORMULAR
Z = 0.88x1 + 0.33x2
With constraints 0.1x2 ≤ 200
0.25 x1 ≤ 800
3x1 + 2x2 ≤ 40
x1,x2 ≥ 0

❖ IN LINGO

CODE

17
RESULT

(b) Use the graphical method to solve this model

❖ Linear programming model of Weenies and Buns Company on Excel

18
 ➔ Therefore we can calculate: .

Corner points Z values

A (2666.7, 2000) 3006.667

C (3200, 1200) 3212

⇒ the maximum profit is at C ( 3200, 1200) with a value of $3212.

EXERCISE 3.1-11.
(a) Linear programming model.

Amount products made per day Amount of

Product available
Types
components
X1(Product 1) X2(Product 2) X3(Product 3) for the
products
(units)

Milling 9 3 5 500
machine

19
 Lathe 5 4 0 350

Grinder 3 0 2 150

Profit per batch $50 $20 $25

FORMULAR
Z = 50x1 + 20x2 + 25x3
With constraints 9x1+3x2 +5x3 ≤ 500
5x1 +4x2 ≤ 350
3x1 + 2x3 ≤ 150
x3 ≤ 20
x1,x2,x3 ≥ 0
(b) Use a computer to solve this model by the simplex method.
❖ IN LINGO

CODE

RESULT

20
=> The profit is optimized at the point: x1 = 43.3; x2 = 33.3; x3 = 2 with profit of
$2883.3

EXERCISE 3.1-12
Maximize Z =c 1 x 1+ x 2 ,
subject to
x1 + x2 ≤ 6
x 1 + 2 x 2 ≤ 10
And
x 1≥ 0 , x 2≥ 0 ,
Using Linear programming model on Excel, I can plot the graph as below:

Therefore, we can easily see ABCD is the feasible region with 4 boundary points A(0,5) ;
B(2,4); C(6,0) and D(0,0).
→ The optimal solution should lie in the corner point.

21
By plugging all of the points to Z, the value of the objective function at the
boundary points is shown as follow:
A(0,5) → Z = c 1(0)+ 5 = 5
B(2,4) → Z = c 1(2)+ 4 = 2c 1 + 4
C(6,0) → Z = c 1(6)+ 0 = 6c 1
D(0,0) → Z = c 1(0)+ 0 = 0
In addition, there are 2 functions of c 1 that we can compute from calculations as above:
1
2c 1 + 4 = 0 → c 1 =
2
6c 1 = 0 → c 1= 0
6c 1= 2c 1 + 4 → c 1= 1
Therefore, we will have 3 case for c 1
● c1 > 1
For c 1 > 0, the optimal solution will be C(6,0) because it will give the maximum value.
● 0 < c 1 <1
For c 1 > 0, the optimal solution will be B(2,4) because it will give the maximum value.
1
For c 1 = 2 , Z at B(2,4) and A(0,5) will have the same value.
● c1 < 1
For c 1 < 1, the optimal solution will be A(0,5) because it will give the maximum value.

EXERCISE 3.1-13
Rewrite the constraints as follow:
- x 1 + x 2 ¿ 2 (1)
x 2 = 3 (2)
k x 1 + x 2 ¿ 2k + 3, where k ≥ 0 (3)
Plug x 1= 0 into the first equation then we have:
-x1 + x2 ¿ 2
→ - 0 + x2 ¿ 2
→ x2 ¿ 2
Therefore the first point is A (0;2)
Plug x 2= 0 into the first equation then we have:
-x 1 + x2 ¿ 2
→ - x1 + 0 ¿ 2
→ x1 ¿ - 2

22
Therefore the first point is B (-2;0)
Plug x 1= 0 into the (3) equation then we have:
k x 1 + x 2 ¿ 2k + 3
→ k(0) + x 2 ¿ 2k + 3
→ x 2 ¿ 2k + 3 (4)
Plug x 2= 3 into the (4) equation then we have:
x 2 ¿ 2k + 3
→ 3 ¿ 2k + 3
→k=0
Similarly, plug x 2= 0 into the (3) equation then we have:
k x 1 + x 2 ¿ 2k + 3
→ k x 1 + 0 ¿ 2k + 3
→ k x 1 - 2k = 3
3
→k¿
(x 1−2)
Using x 1= 0 into the that equation then we have:
3
k ¿ ( x −2)
1

3 3
→k¿ ¿
(2−2) 0
⇒ k = +∞
In conclusion, if k = 0, then the given linear program will have an optimal solution.

23