Exercises
Exercises
Linear Programming
Formulate the objective function and constraints on the following linear programming problem then solve the problem:
a) using graphical method and b) simplex method.
Note: You can also solve the following problems using any software/computer programs in analyzing linear
programming.
1. A Firm manufactures 2 products, A and B. Each product is processed by 2 machines, M 1 and M2. Each unit of type
A requires 1 hour processing by M 1 and 2 hours M2 and each unit of type B requires 3 hours on M 1 and 1 hour on
M2. The profit on product A is P20 per unit and on product B is P30 per unit. If M 1 is available for 200 hours each
month and M2 for 300 hours, how many units each type can be manufactured in one month in order to
maximize the profits?
2. A firm produces two products has limitations on machine and labor time. There are 240 hours of machine time
and 300 hours of labor time available during the production period. A unit of the first product requires 4 hours
of machine time and 3 hours of labor time. The second product takes 6 and 8 hours of machine and labor time
respectively. A unit of product 1 and 2 generates profits of P10.00 and P30.00 respectively. The problem is to
find the number of units of products 1 and 2 to produce to maximize profit.
Machine Labor
1 4 6 240
2 23 8 300
10 30
Transportation Methods
Solve the following problem using any of the two methods in solving transportation problem (Stepping Stone or
Modified Distribution)
1. The Rivera Construction supply won a bidding to supply cements to three horizontal (road) Projects; Projects 1, 2
and 3 require 100 bags, 170 bags, and 180 bags respectively; it has three warehouses A, B, and C. The available
bags per warehouse are as follows 120 bags for A, 180 bags for B, and 150 bags for C. It will cost P5/bag to
transport cement from warehouse A to Project 1, P2/bag to Project 2;P4/bag to Project 3;warehouse B costs P3,
P5 and P4 respectively for Projects 1,2 and 3; P4, P3, P2 warehouse C.
Table 1:
Projects
1 2 3 Supply
5 2 4 120
A
3 5 4 180
B
4 3 2 150
C
Note: The numbers indicated at the upper right corner of each cell represents the cost of transportation
[Warehouse Projects]
(A B C) (1 2 3)
The numbers above columns 1, 2 and 3 are the point of destination; while the numbers
below represents the quantity demanded by Projects 1, 2 and 3.
1 2 3 1 2 3
A 100 (5) 20 (2) 120 A 120 (2) 120
B 150 (5) 30 (4) 180 B 100 (3) 50 (5) 30 (4) 180
C 150 (2) 150 C 150 (2) 150
100 170 180 450 100 170 180 450
1 2 3 1 2 3
A 500 40 540 A 240 240
B 750 120 870 B 300 250 120 670
C 300 300 C 300 300
Total 500 790 420 1710 Total 300 490 420 1210
1. The LAGASCA Company has three jobs to be done on three machines. Each job must be done on one and only
one machine. The cost of each machine is given below: Determine the job assignment which will minimize the
cost.
Machines
X Y Z
A 1400 1600 1800
Jobs B 1200 1300 1400
C 1400 1800 1500
X Y Z
Assignment 1 A (1400) B (1300) C (1500) 4,200
Assignment 2 A (1400) C (1800) B (1400) 4,600
Assignment 3 B (1200) A (1600) C (1500) 4,300
Assignment 4 B (1200) C (1800) A (1800) 4,800
Assignment 5 C (1400) A (1600) B (1400) 4,400
Assignment 6 C (1400) B (1300) A (1800) 4,500
Decision Theory
1. Which is the best alternative if the probability of small demand is estimated to be 0.4 and the probability of
large demand is estimated to be 0.6? Compute for the expected payoff under certainty? Risk?
Under Certainty
Under Risk
BID
Prepare
Not Prepare
P5,000
Income of
Fine of 15,000
P60,000
Prepared by:
JOAN V. RIVERA
Instructor/Trainor
Elect 101T