While plotting constraints on a graph paper, terminal points on both the axes are connected by a straight line because:
The linear inequalities or equations or restrictions on the variables of a linear programming problem are called...... The conditions x ≥ 0, y ≥ 0 are called.......
Let R be the feasible region (convex polygon) for a linear programming problem and let, Z = + be the objective function. When Z has an optimal value (maximum or minimum), where the variables and are subject to constraints described by linear inequalities, this optimal value must occur at ____________of the feasible region.