2. Who is considered to be the Father of Linear Programming? B. George Foreman D. Boris BadenovC. Curious George A. George Dantzig

3. B. George Foreman C. Curious GeorgeD. Boris Badenov Who is considered to be the Father of Linear Programming?

4. A. George DantzigB. George Foreman

5. Who is considered to be the Father of Linear Programming? A. George Dantzig

6. Who is considered to be the Father of Linear Programming? A. George Dantzig

7. When the Simplex Algorithm returns to a basis it has previously visited, this is called B. unboundedness. D. rotating.C. cycling. A. repeating.

8. B. unboundedness. C. cycling.D. rotating. When the Simplex Algorithm returns to a basis it has previously visited, this is called

9. C. cycling.D. rotating.

10. C. cycling. When the Simplex Algorithm returns to a basis it has previously visited, this is called

11. C. cycling. When the Simplex Algorithm returns to a basis it has previously visited, this is called

12. Which of the following is not a possible number of optimal solutions to a linear programming problem? D.  B. 1 C. 5 A. 0

13. D.  C. 5 B. 1 Which of the following is not a possible number of optimal solutions to a linear programming problem?

14. C. 5 D. 

15. C. 5 Which of the following is not a possible number of optimal solutions to a linear programming problem?

16. C. 5 Which of the following is not a possible number of optimal solutions to a linear programming problem?

17. Who is not associated with a set of first- order conditions identified to be necessary for a solution to be optimal? B. Karush D. TuckerC. Charnes A. Kuhn

18. B. Karush C. CharnesD. Tucker Who is not associated with a set of first- order conditions identified to be necessary for a solution to be optimal?

19. C. Charnes B. Karush

20. C. Charnes Who is not associated with a set of first- order conditions identified to be necessary for a solution to be optimal?

21. C. Charnes Who is not associated with a set of first- order conditions identified to be necessary for a solution to be optimal?

22. THANKS FOR PLAYING!