Operations Research Answers

Questions: 423

Answers by our Experts: 423

Need a fast expert's response?

Submit order

and get a quick answer at the best price

for any assignment or question with DETAILED EXPLANATIONS!

Search & Filtering

At a one man barber shop, customers arrive according to poison distribution with a

mean arrival rate of 5 per hour and hair cutting time was exponentially distributed

with an average hair cutting time was exponentially distributed with an average hair

cut taking 19 minutes. It is assumed that because of excellent reputation, customers

were always willing to wait. Calculate the following

a. Average number of customers in the shop and average numbers waiting for a hair

cut

b .Percentage of time arrival can walk in right without having to wait

c. The percentage of customers who have to wait before getting into the barber’s chair


Use dual Simplex method to solve the following LPP.


Max Z= -3X1-2X2

Subject to x1+x2>1

X1+X2<7

X1+2X2>10

X2<3

X1,X2>0


Estimated sales revenue (in 000 Rs) of 5 salesmen in 5 districts is as give

65

66

57

60

56

Salesman

P

Q

R

S

T

A

55 85

90

75

80

76

B

75

78

66

72

64

D

125

132

114

120

112

E

75

78

69

72

68

- 414

Find an optimal solution for maximising the total revenue.Estimated sales revenue (in 000 Rs) of 5 salesmen in 5 districts is as given below:

District

C

65

66

57

60

56

Salesman

P

Q

R

S

T

A

55 85

90

75

80

76

B

75

78

66

72

64

D

125

132

114

120

112

E

75

78

69

72

68

- 414

Find an optimal solution for maximising the total revenue.
Estimated sales revenue (in 000 Rs) of 5 salesmen in 5 districts is as given below:

District

C

65

66

57

60

56

Salesman

P

Q

R

S

T

A

55 85

90

75

80

76

B

75

78

66

72

64

D

125

132

114

120

112

E

75

78

69

72

68

- 414

Find an optimal solution for maximising the total revenue.

1)    Complete the regularization of the following primal problem

 

            Min Z = 15x1  +  15x2

 

               s.t       3x1 + 2x> 2

                          7x1 + 2x= 6

                          5x1 + 7x< 4

                           x1 ,  x> 0


Player A and B play a game in which each has three coins, a 5p, 10p and a 20p. Each selects a coin without the knowledge of the other’s choice. If the sum of the coins is an odd amount, then A wins B’s coin. But, if the sum is even, then B wins A’s coin. Find the best strategy for each player and the values of the game.

For model:

3x1+2x2+7x3+5x4+2x5>= 13000

2x2+x4+2x5+3x6>=20000

F(c)=0,2x1+0,1x2+0,2x3+0,3x4+0,4x5+0x6

Build a dual model, solve using the graphical method


Solve the following LPP using dual simplex method: Max Z= -3x1- x2,

Subject to: x1+x2 ≥ 1, 2x1+3x2 ≥ 2, x1,x2 ≥ 0.


Placid company makes 3 production components A, B, C using 3 machines Cutting, Polishing and Packaging whose allocated and available hours are not more than 96hrs, 40hrs and 60hrs respectively. Product A spends 6 hours on cutting machine, 2 hours on polishing and 5 hours on packaging machine. Product B goes through 8 hours of cutting, 1 hour of polishing and 3 hours of packaging. Product C takes 4 hours on cutting machine, 4 hours of polishing and 2 hours of packaging. Contribution margins for each component product are N2, N5 and N8.

Use the Simplex Algorithm to determine how many of each component the Placid Company will make to maximize contribution


A manufacturer makes two products, doors and windows. Each must processed through two work areas. Work area #1 has 60 hours of available production time. Work area #2 has 48 hours of available production time. Manufacturing of a door requires 4 hours in work area #1 and 2 hours in work area #2. Manufacturing of a window requires 2 hours in work area #1 and 4 hours in work area #2. Profit is $8 per door and $6 per window


LATEST TUTORIALS
APPROVED BY CLIENTS