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 corner 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
Compare the quantity in Column A and Column B

Options

A. The quantity in column A is greater
B. The quantity in column B is greater
C. The two quantities are equal
D. The relationship cannot be determined on the basis of the information supplied