Tut 1 Rev
Tut 1 Rev
Tut 1 Rev
FACULTY OF ENGINEERING
PEM2046 ENGINEERING MATHEMATICS IV
TUTORIAL
2. Giapetto’s Woodcarving, Inc., manufactures two types of wooden toys: Soldiers and
trains. A Soldier sells for $ 27 and uses $ 10 worth of raw materials. Each Soldier that
is manufactured increases Giapetto’s variable labor and overhead by $ 14. A train
sells for $ 21 and uses $ 9 worth of raw materials. Each train built increase Giapetto’s
variable labor and overhead by $ 10. The manufacturer of wooden soldiers and trains
requires two types of skilled labor: carpentry and finishing. A soldier requires 2 hours
of finishing labor and 1 hour of carpentry labor. A train requires 1 hours of finishing
labor and 1 hour of carpentry labor. Each week, Giapetto can obtain all the needed
raw materials but only 100 Finish hours and 80 carpentry hours. Demand for trains is
unlimited, but at most 40 soldiers are bought each week. Giapetto wants to maximize
weekly profit (revenues-costs). Formulate a mathematical model of Giapetto’s
situation that can be used to maximize Giapetto’s weekly profit.
3. An auto company manufactures cars and trucks. Each vehicle must be processed in
the paint shop and body assembly shop. If the paint shop were only painting trucks,
40 per day could be painted. If the paint shop were only painting cars, 60 cars could
be painted. If the body shop were only producing cars, it could process 50 per day. If
the body shop were only producing trucks, it could process 50 per day. Each truck
contributes $ 300 to profit, and each car contributes $ 200 to profit.
(a) Use graphical method to determine a daily production schedule that will maximize
the company’s profit.
(b) Suppose that auto dealers requires that the Auto Company in the previous example
produce at least 30 trucks and 20 cars. Find the optimal solution to this new LP.
[12000; Infeasible LP]
(a) Given that s1 and s2 are slack variables for constraint 1 and 2 respectively.
Determine whether
(i) [x1, x2, x3, s1, s2] = [1,0,0,2,4]
(ii) [x1, x2, x3, s1, s2] = [1,0,1,0,0]
is a basic feasible solution to the linear program given above.
(b) Write down the basic feasible solution corresponding to basic variables x1 and x2,
and the corresponding vertex of the feasible region.
(c) Produce a different basic feasible solution to the linear program given above.
Let x4 and x5 be the slack variables of constraint (1) & (2). If you are given the
information that the Simplex iteration proceeds as follow to obtain the optimal
solution in two iteration:
(a) By using the information provided, find the optimal solution. (DO NOT USE
SIMPLEX ALGORITHME) [ (0, 2, 1), 7]
(b) Develop a three-dimensional drawing of the feasible region for this problem, and
show the path followed by Simplex method.
(a) Maximize z = 2x1 + 4x2 + 3x3 (b) Maximize z =4x1 + 3x2 + 6x3
st 3x1 +4x2 + 2x3 ≤ 60 st 3x1 + x2 +3x3 ≤ 30
2x1 + x2 + 2x3 ≤ 40 2x1+2x2 +3x3 ≤ 40
x1 + 3x2 + 2x3 ≤ 80 x1≥ 0, x2≥ 0, x3 ≥ 0
x1 ≥ 0, x2 ≥ 0, x3 ≥ 0
8. Suppose we have obtained the tableau as follow for a maximization problem. State
conditions on a1, a2, b, c1, c2 (if applicable) that required to make the following
statements true:
Basic z x1 x2 x3 x4 x5 x6 Solution
z 1 c1 c2 0 0 2 0 10
0 4 a1 1 0 3 0 b
0 −1 −5 0 1 −1 0 2
0 a2 −3 0 0 −4 1 3
(a) The current solution is optimal, and there are alternative optimal solutions
(b) The current basic solution is not a basic feasible solution
(c) The current basic solution is a degenerate basic feasible solution.
(d) The current basic solution is feasible, but the LP is unbounded.
(e) The current basic solution is feasible, but the objective function value can be
improved by replacing x6 as a basic variable with x1.
Max z = 4x1 + x2
s.t. 3x1 + 2x2 ≤ 6
6x1 + 3x2 ≤ 10
x1 , x2 ≥ 0
Suppose that in solving this problem, row 0 of the optimal tableau is found to be
z + 2x2 + s2 = 20/3. Use the Dual theorem to prove that the computations must be
incorrect.
Basic z x1 x2 s1 s2 s3 Solution
z 1 0 0 5/8 1/8 0 17/2
x2 0 0 1 1/2 −1/2 0 2
x1 0 1 0 −1/8 3/8 0 3/2
s3 0 0 0 1 −2 1 4
(b) The range of feasibility is defined as the range over which the right hand side
quantities can change without affecting the optimal solution. Find the range of
feasibility of resource 1 & 3.
(c) In each of the following cases, indicate whether the given solution remains
optimal. If yes, identify the new optimal value.
Find the new optimal solution if a new variable xnew has been introduced into the
model as follow:
Identify the optimal solution for the dual problem from the final set of equations.
[ (1/5,3/5),z=17]
[not optimal but feasible, optimal & feasible, optimal & feasible, optimal & feasible]
14. JC lives in New York City, but he plans to drive to Los Angeles to seek fame and
fortune. JC’c funds are limited , so he has decided to spend each night on his trip at a
friend’s house. JC has a friend in Columbus, Nashville, Louisville, Kansas City,
Omaha, Dallas, San Antonio, and Denver. JC knows that after one day’s drive he can
reach Columbus, Nashville or Louisville. After two days of driving, he can reach
Kansas City, Omaha or Dallas. After three days of driving, he can reach San Antonio,
or Denver. Finally, after four days of driving, he can reach Los Angeles. To minimize
the number of miles traveled, where should JC spend each night of the trip? The
actual mileages between cities are given below. [shortest path:2870 miles]
16. Suppose that a 10-lb knapsack is to be filled with items listed in table 27-1. To
maximize total benefit, how should the knapsack be filled?
[Max:25, one type 1 & two type 2]
Table 27.1
Weight Benefit
Item 1 4 lb 11
Item 2 3 lb 7
Item 3 5 lb 12
Age, u
0 1 2 3 4 5
Income, I(u) 10 000 9 500 9 200 8 500 7 300 6 100
Maintenance, M(u) 100 400 800 2000 2800 3300
Replacement, R(u) … 3 500 4 200 4 900 5 800 5 900
As a matter of policy, no machine is ever kept past its sixth anniversary and
replacement are only with new machines. Determine a replacement policy that will
maximize the total profit from this one location over the next 4 years.
[keep-replace-keep-keep]
19. Ali lives in City 1. He owns insurance agencies in City 2, 3 and 4. Each month, he
visits each of his insurance agencies. The distance between each of his agencies in
km is shown as follow:
City 1 2 3 4
1 - 525 650 303
2 525 - 535 621
3 650 535 - 415
4 303 621 415 -
What order of visiting his agencies will minimize the total distance traveled?
[1-2-3-4-1, 1-4-3-2-1]
22. A soft drink company has divided Bloomington into two territories. If x1 dollars are
spent on promotion in territory 1, then 6x11/ 2 cases of soft drink can be sold there, and
if x2 dollars are spent on promotion in territory 2,then 4x12/ 2 cases of soft drink can be
sold there. Each case of soft drink sold in territory 1 sells for $10 and incurs $5 in
shipping and production cost. Each case of soft drink sold in territory 2 sells for $9
and incurs $4 in shipping and production cost. A total of $100 is available for
promotion. How can the soft drink Company maximize profits?
[400/13, 900/13]