1. How many basic feasible solutions?
2. Assuming the dashed line represent the objective function Z= c1x1+c2x2 and the point E has beter value (larger for max problem, or smaller for a min problem) than the point G . select the binding constraints

3. Assuming the dashed line represent the objective function Z= c1x1+c2x2 and the point E has beter value (larger for max problem, or smaller for a min problem) than the point G .

Which point gives the optimal solution? select answer

1. F
2. A
3. There is infinite number of optimal solution from A to B
4. More information is needed to answer this question

4. Assuming the dashed line represent the objective function and the point E has better value (larger for max problem, or smaller for a min problem) than the point G. removing constraint 3 will change the optimal solution
   1. True
   2. False

5. Assuming the dashed line represent the objective function Z= c1x1+c2x2 and the point F gives the optimal solution. Select all statement that can be said about the point (0,4) where and .
   1. It is a feasible solution
   2. It can be written as convex combination of point between A and B.
   3. It is basic feasible solution
   4. It is basic solution

6. Assuming the dashed line represent the objective function Z= c1x1+c2x2 and the point F gives the optimal solution. Select all statement that can be said about the point (2,4) where x1=2 and x2=4.
   1. It can be written as convex combination of the basic feasible solutions
   2. It gives better z-value some basic feasible solutions
   3. It gives better z-value than point (0,4)
   4. It is extreme point