| Directions: (21 - 25) |
| Let R be the feasible region (convex polygon) for a linear programming problem and let \[Z=ax+by\] be objective function. When Z has an optimal value (Maximum or minimum), where the variables x and y are subject to 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: |
A) a constant
B) a function to be optimized
C) a relation between the variables
D) None of these.
Correct Answer: B
Solution :
Objective function is a linear function (involve variable) whose maximum or minimum value is to be found.
You need to login to perform this action.
You will be redirected in
3 sec
