Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Scribd
Upload
24 views

MBA or Probs On Linear Programming Simplex Method

Uploaded by

Rohit Madugula
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
24 views

MBA or Probs On Linear Programming Simplex Method

Uploaded by

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

OPERATIONS RESEARCH

Problems o Linear Programming (Simplex Method)


Maximization Type Problems

1. A company produces two products A and , each of which requires three types of
processing. The length of time for processing each unit and the profit per unit are given
in the following table.

Product A Product B Available capacity


(hrs / unit) (hrs / unit) per day (hrs)
Process I 120 120 8,400
Process II 30 60 3,000
Process III 80 40 4,800
Profit per unit (Rs.) 50 70 ------

How many units of each product should the company produce per day in order to
maximize the profit. Use simplex method.

2. The ABC Manufacturing Company ca n make two products A and B. Each of the
products requires time on a cutting machine and a finishing machine. Relevant data :
Products
A B
Cutting hours (per unit) 2 1
Finishing hours (per unit) 3 3
Profit (per unit) (Rs) 6 4
Maximum sales units (per week) --- 200

The number of cutting hours available per week is 390 and number of finishing hours
available per week is 810. How much should be produced of each product in order to
achieve maximum profit for the company.

3. Maximize Z = 3x1 + 2x2 + 5x3


Subject to Constraints :
X1 + 2x2 + x3 <= 430
3x1 + 2x3 <= 460
X1 + 4x3 <= 420

And x1, x2 and x3 >= 0


-2-

Minimization Type Problems

4. A chemical company produces two compounds A and B. The following table gives the
units of ingredients C and D per kg of compound A and B as well as requirement of C
and D and cost per kg of A and B. Using the simplex method find the quantities of A and
B which would give a supply of C and D at a minimum cost.

Ingredient Compound Minimum Requirement


A B
C 1 2 80
D 3 1 75
Cost per kg. 4 6

5. Solve by Simplex :
Minimize Z = 3x1 + 4x2
Subject to constraints :
2x1 + 3x2 >= 90
4x1 + 3x2 >= 120
And x1, x2 >= 0

6. Solve by Simplex :
Minimize Z = 4x1 + x2
Subject to constraints :
3x1 + 4x2 >= 20
X1 + 5x2 >= 15
And x1, x2 >= 0

Mixed Constraints

7. Solve by simplex :
Minimize Z = 30x1 + 30x2 + 10x3
Subject to constraints :
2x1 + x2 + x3 >= 6
X1 + x2 + 2x3 <= 8
And x1, x2 and x3 >= 0
-3-

8. Solve by simplex :
Maximize Z = 4x1 + 5x2 - 3x3
Subject to constraints :
X1 + x2 + x3 = 10
X1 - x2 >= 1
2x1 + 3x2 + x3 <= 30
And x1, x2, x3 >= 0

9. An animal feed company must produce 200 kg of a mixture consisting of ingredients X1


and X2 daily. X1 costs Rs. 3 per kg., and X2 Rs. 8 per kg. No more than 80 kgs of
X1 can be used, and at least 60 kgs of X2 must be used. Find how much of each
ingredient should be used if the company wants to minimize cost.

Duality

10. Obtain the dual of :


Minimize Z = 16x1 + 9x2 + 21x3
Subject to :
X1 + x2 + 3x3 >= 16
2x1 + x2 + x3 >= 12
And x1, x2, x3 >= 0

11. Obtain the dual of :


Maximize Z = 20x1 + 30x2
Subject to :
X1 + 2x2 <= 20
X1 + x2 <= 12
5x1 + x2 <= 40
And x1, x2, x3 >= 0

12. Obtain the dual of :


Maximize Z = 5x1 + 3x2
Subject to :
X1 + x2 <= 2
5x1 + 2x2 <= 10
3x1 + 8x2 <= 12
And x1, x2, x3 >= 0
-4-

13. Find the dual of the following problem and then obtai the solution :
Minimize Z = 20x1 + 10x2
Subject to constraints :
X1 + x2 >= 10
3x1 + 2x2 >= 24
And x1, x2 >= 0

14. Solve the following linear programming problem by simplex method after converting the
primal to dual.
Minimize Z = 1.5x1 + 2.5x2
Subject to constraints :
X1 + 3x2 >= 3
X1 + x2 >= 2
And x1, x2 >= 0

15. A company makes three products X, Y and Z out of three raw materials, A, B and C.
The raw material requirement is given below :

Raw Material The number of units of raw material required to


-produce one unit of product
X Y Z

A 1 2 1
B 2 1 4
C 2 5 1

The unit profit contribution of the products X, Y and Z are Rs. 40, Rs. 25 and Rs. 50
respectively. The number of units of raw material available are 36, 60 and 45
respectively.
(i) Determine the product mix that will maximize the total profit.
(ii) Through the final simplex table, write the solution of the dual problem.

You might also like