1) Identify points co-optimal with B, if any.

2) Identify degenerate points, if any.

3) Which variables are non-basic at B?

4) Is it possible for the simplex algorithm to move from ADCB? (Yes or No)

5) At least how many simplex iterations are needed to get to the optimum from the traditional starting point (with x1 and x2 as non-basic)?

The constraints of a linear program in standard form are given and graphed together with the objective function line (in dashed lines). Additionally, it is found that point B is optimal. Answer the succeeding questions pertaining to the problem described. 1:x1+x2+s1=02:x1+2x2+s2=93:2x1+x2+s3=12