Scribd
Upload
24 views

Assignment - 1

Uploaded by

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

Assignment - 1

Uploaded by

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

Assignment - 1

1. Discuss the various steps used in solving Operations Research problems.

2. A retail store stocks two types of shirts A and B. These are packed in attractive cardboard
boxes. During a week the store can sell a maximum of 400 shirts of type A and a
maximum of 300 shirts of type B. The storage capacity, however, is limited to a
maximum of 600 of both types combined. Type A shirt fetches a profit of Rs. 2/- per
unit and type B a profit of Rs. 5/- per unit. How many of each type the store should
stock per week to maximize the total profit? Formulate a mathematical model of the
problem.

3. Evening shift resident doctor in a government hospital work five consecutive days and
have two consecutive days off. Their five days of work can start on any day of the
week and their schedule rotates indefinitely. The hospital requires the following
minimum number of doctors to work on the given days:

Sun Mon Tue Wed Thu

35 55 60 50 60

No more than 40 doctors can start their five working days on the same day. Formulate this
problem as an LPP module to minimise the number of doctors employed by the hospital. 5M

4. Find the solution for the following LPP, using graphical method

Maximization, Z = 7x + 4y

Subjected to Constraints:

x + 2y ≤ 6

3x + 2y ≤ 12

and, x ≥ 0, y ≥ 0

5. Find the solution for the following LPP, using graphical method 10M

Maximization, Z = 120x + 100y

Subjected to Constraints:

2x + y ≤ 16

x + y ≤ 11

x + 2y ≥ 6

5x + 6y ≤ 90

and, x ≥ 0, y ≥ 0
6. Use Simplex Method to solve the following LPP.
Maximize, Z = 3x + 5x + 4x
1 2 3

Subject to Constraints:
2x + 3x ≤ 8
1 2

2x + 5x ≤ 10
2 3

3x + 2x + 4x ≤ 15
1 2 3

and, x , x ,x ≥ 0
1 2 3

7. Use Simplex Method to solve the following LPP.


Maximize, Z = 3x + 2x
1 2

Subject to Constraints:
x +x ≤4
1 2

x -x ≤2
1 2

and, x , x ≥ 0
1 2

You might also like