[go: up one dir, main page]

100% found this document useful (2 votes)
158 views2 pages

Or PHD

The document provides 4 quantitative techniques assignments for an MBA program, including linear programming problems about manufacturing processes, nutrition requirements, window production, and a problem to minimize a linear function subject to constraints. Students are asked to formulate models and solve the problems graphically or using the simplex method to determine optimal values or minimum costs.

Uploaded by

Industrial It
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
100% found this document useful (2 votes)
158 views2 pages

Or PHD

The document provides 4 quantitative techniques assignments for an MBA program, including linear programming problems about manufacturing processes, nutrition requirements, window production, and a problem to minimize a linear function subject to constraints. Students are asked to formulate models and solve the problems graphically or using the simplex method to determine optimal values or minimum costs.

Uploaded by

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

Arsi University

College of Business and Economics


Department of Management
MBA Program

Quantitative Techniques for Management Decisions


Individual Assignment

Instructor: Edo Rago, PhD

Directions:
Solve the following problems by showing the necessary steps and submit the
answers only within 48 hrs.

1. A company manufactures two types of products, A and B. Each product uses two processes,
I and II. The processing time per unit of product A on process I is 6 hours and on the
process II is 5 hours. The processing time per unit of product B on process I is 12 hours
and on process II is 4 hours. The maximum number of hours available per week on process
I and II are 75 and 55 hours respectively. The profit per unit of selling A and B are $12 and
$10 respectively.
i. Formulate a linear programming model so that the profit is maximized.
ii. Solve the problem graphically and determine the optimum values of product A and B.
(use extreme point approach). What is the optimal profit?
2. A nutrition scheme for babies is proposed by a committee of doctors. Babies can be given
two types of food (I and II) which are available in standard sized packets, weighing 50
gms. The cost per packet of these foods are $2 and $3 respectively. The vitamin availability
in each type of food per packet and the minimum vitamin requirement for each type of
vitamin are summarized in the table given.

Vitamin availability per product


Minimum Daily
Vitamin Food Food requirement
Type I Type II
1 1 1 6
2 7 1 14
Cost/Packet (USD) 2 3
i. Develop a linear programming model to determine the optimal combination of food
type.
ii. Solve the problem graphically and determine the minimum cost such that the
minimum requirement of vitamin is each type is satisfied. (use extreme point
approach). What is the optimal profit?

3. A metal fabricator manufactures three types of windows. Each of the windows needs four
processes. The time taken on various machines differ due to the size of windows. The time
taken and available hours are given in the table below:

Window Type Cutting Heat Treating Forging Grinding


A 5 7 1 4
B 7 4 4 6
C 4 8 6 2
Available time (Hrs) 20 24 28 22

The profit contribution for windows A, B and C are $3.00, $4.00 and $5.00 respectively.
1. Formulate the problem.
2. Solve the problem using simplex method to maximize the profit.
3. Determine the excess time available in each process and by how much.

4. Solve the following linear program using simplex method:

Min 84x1 + 4x2 + 30x3


s.t.
8x1 + 1x2 + 3x3 ≤ 240
16x1 + 1x2 + 7x3  480
8x1 - 1x2 + 4x3  160
x1, x2, x3  0

You might also like