| 11. |
The feasible region usually expands when more constraints are added to the design model and shrinks when some constraints are deleted.
|
||||
|
Answer:
Option (b) |
| 12. |
The technique for selecting a new point depends upon _____________.
|
||||||||
|
Answer:
Option (b) |
| 13. |
In linear programming, the solution is based on _________.
|
||||||||
|
Answer:
Option (c) |
| 14. |
A linear function in three-dimensional space is a _________.
|
||||||||
|
Answer:
Option (b) |
| 15. |
One of the most powerful techniques for solving non-linear programming is to transform the _________.
|
||||||||
|
Answer:
Option (b) |
| 16. |
In non-linear programming the boundaries of the contours of the function are _________.
|
||||||||
|
Answer:
Option (d) |
| 17. |
What is linear programming?
|
||||||||
|
Answer:
Option (d) |
| 18. |
Constraint in a linear programming model restricts.
|
||||||||
|
Answer:
Option (d) |
| 19. |
The distinguishing feature of a linear programming model is_____________.
|
||||||||
|
Answer:
Option (a) |
| 20. |
While solving a Linear Programing model graphically, the area bounded by the constraints is called
|
||||||||
|
Answer:
Option (a) |