| 31. |
One of the properties of Linear Programming Model is
|
||||||||
|
Answer:
Option (d) |
| 32. |
One of the properties of the Linear Programming Model is
|
||||||||
|
Answer:
Option (a) |
| 33. |
The constraints of the Maximisation problem are of
|
||||||||
|
Answer:
Option (d) |
| 34. |
The slack variables indicate
|
||||||||
|
Answer:
Option (d) |
| 35. |
In the graphical solution of solving Linear Programming problem to convert inequalities into equations, we
|
||||||||
|
Answer:
Option (d) |
| 36. |
To convert ≤ type of inequality into equations, we have to
|
||||||||
|
Answer:
Option (c) |
| 37. |
To convert ≥ type of inequality into equations, we have to
|
||||||||
|
Answer:
Option (c) |
| 38. |
In the Graphical solution of the maximization problem, the line, which we move from origin to the extreme point of the polygon is
|
||||||||
|
Answer:
Option (b) |
| 39. |
The key row indicates
|
||||||||
|
Answer:
Option (b) |
| 40. |
The key column indicates
|
||||||||
|
Answer:
Option (d) |