Consider a linear programming problem with two variables and two constraints. The objective function is: Maximize (ac x + 2b2y). The corner points of the feasible region determined by a set of constraints (linear inequalities) are (0, 10) (20, 0) (30, 30), and (0, 40). The condition on a, b, and c such that the maximum Z occurs at both the points (0,10) and (20, 0) is:
1
b, a and c are in geometric progression
2
a, b and c are in geometric progression
3
a, c and b are in geometric progression
4
None