Scribd
Upload
4 views

Quantitative Analysis Assignment

quantitative anaysis

Uploaded by

zelalemb2119
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
4 views

Quantitative Analysis Assignment

quantitative anaysis

Uploaded by

zelalemb2119
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 3

MARYLAND INTERNATIONAL COLLEGE

MASTERS OF BUSINESS ADMINISTRATION (MBA)

Course Title: Quantitative Analysis for Decision Making


(Management Science) (MBA-652)

Marks: 50%

Individual Assignment
Full Name ID No. Email Phone No.

1
1. Solve the following linear programming model graphically:
Maximize Z = 14 X + 10Y
Subject to: 8 X + 6Y  480
4 X + 2Y  200
X ,Y  0
2. A company produces two products (A and B) that are processed on two assembly
lines. Each product requires 10 hours of processing time on line 1, while on line 2
product A requires 7 hours and product B requires 3 hours. Assembly line 1 has 100
available hours, and assembly line 2 has 42 available hours. The profit for product A
is Birr 6 per unit, and the profit for product B is Birr 4 per unit.
A. Formulate a linear programming model for this problem.
B. Solve this model by using graphical method.
3. A firm produces three products Z, Y, and X, each of which passes through three
departments:Fabrication, Finishing and Packaging. Each unit of product Z requires 3,
4 and 2 hours; a unit ofY requires 5, 4 and 4 hours while each unit of product X
requires 2, 4, 5 hours respectively inthe three departments. Every day, 60 hours are
available in fabrication department, 72 hours inthe finishing department and 100
hours in the packaging department. If the unit contribution ofproduct Z is ETB 5, of
product Y is ETB 10, and of product X is ETB 8, determine the numberof units of
each of the products, which should be made each day to maximize the
totalcontribution. Also determine if any capacity would remain unutilised.
A. Write the formulation for this linear program.
B. Solve the Linear programming problem using simplex method.
4. A product is manufactured by four factories A, B, C and D. The unit production costs
in themare ETB 2, ETB 3, ETB 1 and ETB 5 respectively. Their production capacities
are 50, 70, 30and 50 units respectively. These factories supply the product to four
stories, demands of whichare 40, 40, 100, and 20 units respectively. Unit
transportation cost in ETB for each factory toeach store is given in the table below.

2
Answer the following questions based on the above transportation problem
A. Is the problem a balanced transportation problem or Unbalanced?
B. Find the initial basic feasible solution using
i. North West Corner method
ii. Least cost method
iii. Vogel’s Approximation Method
5. Consider:Player 1 with three strategies S1, S2, and S3 and Player 2 with four
strategies OP1, OP2, OP3, and OP4.
Player
2
OP1 OP2 OP3 OP4

S1 12 3 9 8
Player S2 5 4 6 5
1
S3 3 0 6 7
` What is the optimal strategy for each Player?

6. Consider following data. Draw activity on arc (AOA) network diagram. Find out
critical path,expected duration, slack, total and independent floats.

You might also like