Midterm 1  Feb 19, 2016.  Math 484.001 25 questions, 2 pts each.

Name  Dr.V

No electronics is allowed.   Write both answers and details.

If you do not like given answers, write this here and choose E on scantron.

Do not talk in class except with me and the proctor.

Answers are in boldface Details are not given.

1. 0 ≤  0   is

(A) a linear constraint for x, (B) an affine function of x  (C) a linear form in x, (D) an equation.

A.

2.   x + y   - 1  is

(A) a linear constraint for x, y,  (B) a linear equation for x, y  in standard form,

(C) a  linear form in  x, y,  (D) an equation which can be solved,

E.

3. Every linear program  with  less  constraints than the number of unknowns

(A) is unbounded,  (B) is infeasible,  (C)  has many optimal solutions, (D) is feasible.

E.

4. For any given numbers a, b, the mathematical  program   a2x + b  -> min, 0 <   x  <  1  with an unknown  x

(A)  is not a linear program , (B)   is unbounded, (C) has no optimal solutions   (D)has no feasible solutions.

A.

5. The mathematical program x/y -> max subject to |x| <  1, y > 0 for two unknowns x, y

(A) is a linear program, (B) is infeasible, (C) has an optimal solution,(D) is unbounded.

D.

6. The minimal total time for the job assignment problem

6  2  1  4

3  0  2  1

2  5  3  6

1  1  2  2

is    (A) 4,  (B) 5,  (C) 6, (D) 7.

B.

7. For each  number  t, the equation     (cos(t) +  1)x= sin(t)  for unknown x

(A) is not linear, (B) has a solution, (C) is unbounded, (D) has many solutions.

B.

8, If x> 2 and y > 3 then x+y≥ 0. A) True,  B) False.

A.

9. The bound  x < 9 is stronger than  x < 9.5.  A) True,  B) False.

A.

10. 1 =  0 provided that 0 >  2.   A) True,  B) False.

A.

11. x > 0 and  y > 0 only if  xy ≥ 0.   A) True,  B) False

A.

12. x > 2 provided that x  =  2.   A) True , B) False.

B.

13. The linear program given by a  standard tableau with the matrix

 -1 -2 0 -3 0 -4 0 -2 0 -1 0 1 0 2 -3

(A) is infeasible, (B) is unbounded,  (C) has an optimal solution,

(D) has only 2 linear constraints.

A.

14. The linear program given by a  standard tableau with the matrix

 -1 -2 -1 0 -1 -4 0 2 0 1 0 -1 -1 -1 -3

(A) is infeasible, (B) is unbounded, (C) has an optimal solution,

(D) requires at least two pivot steps to solve by simplex method.

A.

15. The linear program given by a  standard tableau with the matrix

 -1 -2 0 -3 0 -4 0 2 0 1 -1 1 0 2 3

(A) is infeasible, (B) is unbounded, (C) has an optimal solution,

(D) has -4 as the optimal value.

C.

16. The standard tableau

x1   x2   x3   1

-1    -1  -1   -1   = x4

-1    -1  -1   -1   -> min

(A) is optimal, (B) has a bad column, (C) has a bad row, (D) is not standard.

C.

17. For any numbers  a, b  and c,  the standard tableau

x1  x2   1

a      b   c -> min

(A) is optimal. (B) has a bad column, (C) has a bad row, (D) is terminal.

D.

18. Pivoting the standard tableau with matrix

2*  -3

4     3

produces a tableau which

(A) is optimal,  (B)  has a bad row,  (C) has a bad column,  (D) is not terminal.

A.

19. Pivoting the standard tableau with matrix

-2*  3

-4    3

produces a tableau which

(A) is optimal,  (B)  has a bad row,  (C) has a bad column,  (D) is not terminal.

A.

20. The linear program x+y -> max, x≤  -2, y ≥  - 1 with 2 unknowns x, y

A) is infeasible. B) is unbounded. C) has an optimal solution.

D) has infinitely many optimal solutions.

B.

21. The number of choices for the first pivot entry in the standard tableau with the matrix

-1   2   -3    -1      0   0

0  -1    -1    -3     -3  3

-1  -1   -2   -3     -4   3

which are consistent with the simplex method is  (A) 0, (B) 1, (C)  4, (D) 5.

D.

22. The number of choices for the pivot entry in the standard tableau with the matrix

-1   2   -3    -1      0   0

0  -1    -1    -3     -3   0

1   1    -2    -3     -4   3

which are consistent with the simplex method is  (A) 0, (B) 2, (C)  4, (D) 6.

E.

23. The number of choices for the pivot entry in the standard tableau with the matrix

-1  - 2    3    -1    0

0   -1   -1      3    0

-1  -1   -2    -3    4

which are consistent with the simplex method.is  (A) 0, (B) 1, (C )  3, (D) 5.

D.

24. The linear program given by  the row tableau   with  x1,  x3, x4, x5  ≥ 0

x1             2 x1        - x3         1

 -1 -2 0 -3 = -x4 -4 0 -2 0 = x5 0 1 0 2 -> min

(A) is infeasible, (B) is unbounded,  (C) has an optimal solution,

(D) has only 2 linear constraints.

C.

25. The set of constraints x + y ≥ 2, 2x + 3y ≥  4 implies that

A) 4x + 5y >  8,  B) x > 0,   C) y > 1,   D) x < 0.

E.