Question

Case-based questions :- Let R be the feasible region (convex polygon) for a linear programming problem and let Z = ax + by be the objective function. When Z has an optimal value (maximum or minimum), where the variables x and y are subject to the constraints described by linear inequalities, this optimal value must occur at a corner point (vertex) of the feasible region. Based on the above information, answer the following questions​

Answer 1

Answer:

the value of a z is a minimum value at the x and y variable