Question
Linear programming is a method for finding the optimal values (maximum or minimum) of quantities subject to the constraints when relationship is expressed as linear equations or inequations. Based on the above information, answer the following questions.
- The optimal value of the objective function is attained at the points:
- On X-axis.
- On Y-axis.
- Which are comer points of the feasible region.
- None of these.
- The graph of the inequality 3x + 4y < 12 is:
- Half plane that contains the origin.
- Half plane that neither contains the origin nor the points of the line 3x + 4y = 12.
- Whole XOY-plane excluding the points on line 3x + 4y = 12.
- None of these.
- The feasible region for an LPP is shown in the figure. Let Z = 2x + 5y be the objective function. Maximum of Z occurs at:
- (7, 0)
- (6, 3)
- (0, 6)
- (4, 5)
- The corner points of the feasible region determined by the system of linear constraints are (0, 10), (5, 5), (15, 15), (0, 20). Let Z = px + qy, where p, q > 0. Condition on p and q so that the maximum of Z occurs at both the points ( 15, 15) and (0, 20) is:
- p = q
- p = 2q
- q = 2p
- q = 3p
- The comer points of the feasible region determined by the system of linear constraints are (0, 0), (0, 40), (20, 40), (60, 20), (60, 0). The objective function is Z = 4x + 3y.
|
Column A
|
Column B
|
|
Maximum of Z
|
325
|
- The quantity in column A is greater.
- The quantity in column Bis greater.
- The two quantities are equal.
- The relationship cannot be determined on the basis of the information supplied.





Based on the above information, answer the following questions.
Based on the above information, answer the following questions.