1. 


The graph of a linear inequality consists of a line and some points on both sides of the line. 
2. 


The graph of a linear inequality consists of a line and only some of the points on one side of the line. 
3. 


The graph of a linear inequality consists of a line and all of the points on one side of the line. 
4. 


If a linear programming problem has a solution at all, it will have a solution at some corner of the feasible region. 
5. 


No point other than a corner of the feasible region can be a solution to an LP problem. 
6. 


No point in the interior of the feasible region can be a solution to an LP problem. 
7. 


Every LP problem has a solution. 
8. 


Every LP problem with a bounded nonempty feasible region has a solution. 
9. 


No LP problem with an unbounded feasible region has a solution. 
10. 


The graphical method is practical for all LP problems. 
11. 


The simplex method can be used to solve all LP problems. 
12. 


Constraints can always be turned into equations by adding slack variables to the lefthand sides. 
13. 


Constraints can always be turned into equations by subtracting surplus variables from the lefthand sides. 
14. 


Constraints can always be turned into equations by adding or subtracting slack or surplus variables from the lefthand sides as appropriate. 
15. 


To minimize c you can instead maximize p = c. 
16. 


In a basic solution some of the variables are 0. 
17. 


The variables that are 0 are those that appear on the left. 
18. 


In a feasible basic solution all the variables (with the possible exception of the objective) are nonnegative. 
19. 


You should always make sure that there are no negative numbers in the rightmost column (with the possible exception of the objective) before choosing a pivot. 
20. 


When all the variables (with the possible exception of the objective) are nonnegative and all the numbers in the bottom row are nonnegative (with the possible exception of the rightmost) you are done with the simplex method. 