1. |
Liner programming was initially developed by ____________ for military operations.
|
||||||||
Answer:
Option (a) |
2. |
Liner programming solves problem by ________
|
||||||||
Answer:
Option (b) |
3. |
A brick manufacturer can run furnace for 8 hours and have three options of different size and its variable production time, find out maximum profitable option.
1. Size X – Production Time 20mins. – Profit 3Rs.
2. Size Y – Production Time 10 mins. – Profit 2.5Rs.
3. Size Z – Production Time 15 mins. – Profit 3Rs.
|
||||||||
Answer:
Option (b) |
4. |
When it is feasible to use graphical method of liner programming?
|
||||||||
Answer:
Option (d) |
5. |
Arrange following steps of Simplex method of liner programming in appropriate sequence:
1. Setting up initial simplex solution
2. Generalizing the objective function and constrain
3. Identifying mathematical model
4. Converting the constrains into equation
|
||||||||
Answer:
Option (c) |
6. |
Arrange following steps of simplex method of liner programming in appropriate sequence:
1. Determining the new basic equation
2. Preparing initial simplex table
3. Selecting variables using optimally and feasibility
4. Repeating steps till optimal solution is achieved
|
||||||||
Answer:
Option (a) |