Sale

DOMS304 MBA APPLICATIONS OF OPERATIONS RESEARCH

175549

DOMS304 MBA APPLICATIONS OF OPERATIONS RESEARCH
Clear
Compare Compare

Description

Description

SESSION AUG-Sep’23
PROGRAM MASTER OF BUSINESS ADMINISTRATION (MBA)
SEMESTER III
course CODE & NAME DOMS304 & Applications of Operations Research
   
   

 

Assignment Set – 1

 

  1. a) A farmer has a 100 acre farm. He can sell all tomatoes, Lettuce or radishes and can get a price of Rs. 1.00 per kg for tomatoes, Rs. 0.75 a heap for lettuce and Rs. 2.00 per kg for radishes. The average yield per acre is 2,000 kg of tomatoes, 3,000 heaps of lettuce and 1,000 kg of radishes. Fertilizers are available at Rs. 0.50 per kg and the amount required per acre is 100 kg each for tomatoes and lettuce and 50 kg for radishes. Labour required for sowing, cultivating and harvesting per acre is 5 man-days for tomatoes and radishes and 6 man-days for lettuce. A total of 400 man-days of labour are available at Rs. 20 per man-day. Formulate this problem as linear programming problem. 5

 

 

  1. b) Define sensitivity analysis in LPP. Write the limitation of sensitivity analysis. 5

 

 

  1. Solve the given LPP using simplex method:

Maximize Z = 5x1 + 2x2 +10x3

Subject to: x1– x3≤ 10

                   x2– x3 ≥ 10

                   x1 + x2+ x3≤ 10

x1, x2, x3 ≥ 0

 

  1. Solve the following linear programming problem using Revised Simplex Method:

Maximize Z   = x1 + 2x2

Subject to:          x1+x2 ≤ 3

x1 + 2x2 ≤ 5

 3x1 + x2 ≤ 6

where x1, x2 ≥ 0

 

 

 

 

 

Assignment Set – 2

 

 

  1. A soft drink distributor takes the contract for the sale of soft drinks at a cricket stadium during a one-day match. He has five sales boys to assign to three areas of the stadium. The table shows the estimated sales that can be made with different assignments.
No. of persons

 assigned

East stand North stand Club stand
1 15 45 30
2 30 90 60
3 60 135 90
4 120 180 120
5 150 180 150

 

Using Dynamic programming problem, how he should assign the boys in order to maximize his sales.

 

  1. Solve the following integer programming problem using Branch and Bound method:

Maximize Z = 6x1 + 8x2

Subject to: x1 + 4x2 ≤ 8

7x+ 2x2 ≤ 14

and x1, x2 are non-negative integers

 

 

  1. a) Solve the following Non-linear programming problem using Kuhn-Tucker conditions:

Maximize Z = x12– x1x2 – 2x22

Subject to: 4x1 + 2x2 ≤ 24

5x1 + 10x2 ≤ 20

             and x1, x2 ≥ 0

 

 

  1. b) Write short note on the following
  2. i) Quadratic Programming problem
  3. ii) Metaheuristics techniques

 

Additional information

Assignment Type

General, Unique

Reviews

There are no reviews yet.


Be the first to review “DOMS304 MBA APPLICATIONS OF OPERATIONS RESEARCH”

General Inquiries

There are no inquiries yet.