0% found this document useful (0 votes)
137 views4 pages

QAMD Assignment

1. The document describes 6 linear programming problems involving maximizing or minimizing objectives subject to various constraints. It asks to formulate the problems as linear programming models and solve them using graphical or simplex methods. 2. A second problem involves maximizing total profit from producing blankets and t-shirts given constraints on available department hours and production/selling costs and prices. 3. The last problem involves assigning 5 typists to 5 writing jobs to minimize total assignment costs given a cost table for each typist/job pair.

Uploaded by

Emuye
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
137 views4 pages

QAMD Assignment

1. The document describes 6 linear programming problems involving maximizing or minimizing objectives subject to various constraints. It asks to formulate the problems as linear programming models and solve them using graphical or simplex methods. 2. A second problem involves maximizing total profit from producing blankets and t-shirts given constraints on available department hours and production/selling costs and prices. 3. The last problem involves assigning 5 typists to 5 writing jobs to minimize total assignment costs given a cost table for each typist/job pair.

Uploaded by

Emuye
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
You are on page 1/ 4

1.

Solve the following linear programming problem by graphical method and interpret the result
Min = 6x+8y

x+3y ≥24
2x+ y ≥18
3x+ 4y ≥52
X and Y ≥ 0
2. Awassa Textile Factory is engaged in the production of two types of textile products. Blankets
and T-shirts which must be processed through departments. The number of hours a unit of each
product required in the two departments is listed below.
Per unit requirement in hour
Blanket Shirt Suppose that the
Department 1 2 3 total amount of
Department 2 4 2 resources
available per week in department one and department two is at most 1050 hours and 1160 hours
respectively. Moreover, the cost of production and selling prices of each type of products are
given as follows.
Product Cost of production per unit Selling price per unit
Blanket Birr 41 Birr 50
Shirt Birr 40 Birr 60
Based on the above information:
a) Formulate the problem as an linear programming model (LPP model)
b) Determine the number units of each type of product that should be produced to maximize the
total profit and what is the maximum profit by using Simplex method?
3. Solve the following Linear programming problem using Graphical Method
= 4X+5Y
Subject to ; X + 3Y ˂ 12
4X + 3Y ˂ 24
X and Y ˃ 0
4. Solve the equations through graphical method
Minimize Z = 10x1 + 4x2
Subject to; 3x1 + 2x2 ≥ 60
7x1 + 2x2 ≥ 84
3x1 +6x2 ≥ 72
x 1 ≥ 0 , x2 ≥ 0
5.Abush Manufacturing Company produces two different types of Tractor. These are Hiwot and Durex.
Hiwot requires 9 minutes to assemble and 2 minutes to package. While Durex requires 12 minutes to
assemble and 6 minutes to package. The company has 720 minutes of assembly time and 300 minutes of
packaging time available. Profits are birr 45 for Hiwot and birr 70 for Durex both per unit.
Based on the above information:
a) Formulate the Linear anagramming model for the problem. Show all the necessary steps
b) Determine how many tractors of each type to make in order to maximize total profit and what is the
maximum profit by using Simplex method?
6. Two machines (I and II) produces two grades of tires A and B, in one hour of operation machine I
produces 20 units of grade A and 10 units of grade B tires. While machine II produce 30 units of grade A
and 40 units of grade B tires. The machines are required to meet a production schedule of at least 1400
units of grade A and 1200 units of grade B tires. The cost of operating machine I is $50 per hour and the
cost of operating machine II is $ 80 per hour. Based on this data
a) Formulate the linear programming model (LPP model)
b) Determine the optimal solution if the objective is to minimize the cost of
operating each machine. By using Simplex method.
1. The following five Typists (i.e. A, B, C, D, and E) are required to be assigned on five jobs
(i.e. types of job: P, Q, R, S, and T) of writing activities are available in the given
organization. The cost incurred due to assignment of jobs to each Typist is given in the
following table;
Jobs
Typists P Q R S T
A 85 75 65 125 75
B 90 78 66 132 78
C 75 66 57 114 69
D 80 72 60 120 72
E 76 64 56 112 68
Then determine the optimal assignment solution and its total cost of assignment?
2. Consider the following payoff table for three alternatives, A, B, and C, with two future states
of nature of the economy, i.e. good and bad. The probability value for good economic
condition is assumed to be 0.4 and for bad economic condition is 0.6

Required: Select the best decision using


the following decision criteria;
a)Maximax e) Calculate expected
b) Maximin opportunity loss
c)Minimax regret f) Calculate expected
d) Calculate expected monetary value value of perfect information
3. A College department head has five instructors to be assigned to four different courses. All of the
instructors have taught the courses in the past and have been evaluated by the students. The rating for each
instructor for each course is given in the following table (a perfect score is 100).
Courses
Instructor A B C D
1 80 75 90 85
2 95 90 90 97
3 85 95 88 91
4 93 91 80 84
5 91 92 93 88
Then department head wants to know the optimal assignment of instructors to courses that will
maximize the overall average evaluation score.
Required: Solve the above problem using the Hungarian assignment method
4. The owner of the Burger restaurant is considering two ways to expand operations: opening a driven-up
window or serving breakfast. The increase in profits resulting from these proposed expansions depends on
whether a competitor opens a franchise down the street. The profits from each expansion in operations
given both future competitive situations are shown in the following payoff table.
Profit
Decision Open Not open
Drive-up window - 6,000 20,000
Breakfast 4,000 8,000
Additionally the owner estimated 0.3 probability of profit for open and 0.7 probability of profit for not opening.
Required: Select the best decision using the following decision criteria;
A. Maximax D. Calculate expected monetary value
B. Maximin E. Calculate expected opportunity loss
C. Minimax regret F.Calculate expected value of perfect information
5. Oranges are grown, picked, and then stored in warehouses in Hawassa, Batu and Bishoftu. These
warehouses supply oranges to markets in Addis Ababa, Adama, Arba minch and Buta jira. The following table
shows the shipping costs per truckload, supply and demand. Required:
To
From Addis A. Adama Arba Minch Buta Jira Supply
Hawassa 9 14 12 17 200
Batu 11 10 6 10 200
Bishoftu 12 8 15 7 200
Demand 130 170 100 150
a) Set the transportation table and determine the initial solution using the minimum cell cost (LCM)?
b) Test optimality using stepping stone and MODI method
6. Consider the following activities and durations for certain project.
Immediate Task Time
Activity Predecessor (in days)
A - 6
B A 7
C A 8
D B 20
E B 18
F C 9
G E 8
H D, F 2
I G, H 7 .
A. Construct the network diagram?
B. Determine the possible passes and calculate their duration lengthen
C. Calculate ES,EF,LS and LF with its slack evaluation
D. Determine the critical path and identify activity on critical path from non-critical path activity
7. Consider the following activities and durations for certain project.
Activity Immediate Predecessor
A Null
B A
C B
D Zero
E D
F E
G __

H G
I H

Required:
A. Construct the network diagram?
B. Compute the expected time for each activity
and the expected duration for each path
C. Indentify the critical path
D. What is the probability that the project can
be completed within 17 months of its start?
E. What is the probability that the project will
be completed 15 months of its start?
F. What is the probability that the project will
not be completed 15 months of its start?

You might also like