True or False
1. An inequality constraint is more restrictive than an equation.
2. The graphical method is restricted to problems having no more than three variables.
3. The objective function may be expressed as an equation or as an inequality.
4. A constraint may be expressed as an equation or as an inequality.
5. All variables in a linear programming problem must take on non-negative values.
6. An iso-profit represents all combinations of the products which would yield the same value of profit.
7. The most profitable solution in a linear programming maximization problems always occurs when one point on the iso-profit line is within the area of feasible solutions.
8. A redundant constraint may be ignored in a linear programming problem without affecting the optimal solution.
9. A iso-cost line is associated with maximization problem, whereas an iso-profit line pertains to minimization problem.
10. There are only three types of constraints in a linear programming problem. They are identified by an equality or inequalities (=, > and