CH 17 - Linear Programming: Simplex Method.
When a system of simultaneous equations has more variables than equations, there is a unique solution. a. True b. False ANSWER: False POINTS: 1 DIFFICULTY: Easy LEARNING OBJECTIVES: IMS.ASWC.19.17.01 - 17.1 NATIONAL STANDARDS: United States - BUSPROG: Reflective Thinking TOPICS: 17.1 An Algebraic Overview of the Simplex Method KEYWORDS: Bloom's: Remember 2. In order to determine a basic solution, set n − m of the variables equal to zero, and solve the m linear constraint equations for the remaining m variables. a. True b. False ANSWER: True POINTS: 1 DIFFICULTY: Easy LEARNING OBJECTIVES: IMS.ASWC.19.17.01 - 17.1 NATIONAL STANDARDS: United States - BUSPROG: Reflective Thinking TOPICS: 17.1 An Algebraic Overview of the Simplex Method KEYWORDS: Bloom's: Understand 3. A basic feasible solution also satisfies the nonnegativity restriction. a. True b. False ANSWER: True POINTS: 1 DIFFICULTY: Easy LEARNING OBJECTIVES: IMS.ASWC.19.17.01 - 17.1 NATIONAL STANDARDS: United States - BUSPROG: Reflective Thinking TOPICS: 17.1 An Algebraic Overview of the Simplex Method KEYWORDS: Bloom's: Understand 4. The simplex method is an iterative procedure for moving from one basic feasible solution (an extreme point) to another until the optimal solution is reached. a. True b. False ANSWER: True POINTS: 1
Información del documento
- Subido en
- 29 de noviembre de 2023
- Número de páginas
- 21
- Escrito en
- 2023/2024
- Tipo
- Examen
- Contiene
- Preguntas y respuestas
