Question 1

Which is not required for a problem to be in tableau form?

Accepted Answer

A) Each constraint must be written as an equation. 
B) Each of the original decision variables must have a coefficient of 1 in one equation and 0 in every other equation. 
C) There is exactly one basic variable in each constraint. 
D) The right-hand side of each constraint must be nonnegative. 
A) Each constraint must be written as an equation. 
B) Each of the original decision variables must have a coefficient of 1 in one equation and 0 in every other equation. 
C) There is exactly one basic variable in each constraint. 
D) The right-hand side of each constraint must be nonnegative.

Question 2

A minimization problem with four decision variables, two greater-than-or-equal-to constraints, and one equality constraint will have

Accepted Answer

A) 2 surplus variables, 3 artificial variables, and 3 variables in the basis. 
B) 4 surplus variables, 2 artificial variables, and 4 variables in the basis. 
C) 3 surplus variables, 3 artificial variables, and 4 variables in the basis. 
D) 2 surplus variables, 2 artificial variables, and 3 variables in the basis. 
A) 2 surplus variables, 3 artificial variables, and 3 variables in the basis. 
B) 4 surplus variables, 2 artificial variables, and 4 variables in the basis. 
C) 3 surplus variables, 3 artificial variables, and 4 variables in the basis. 
D) 2 surplus variables, 2 artificial variables, and 3 variables in the basis.

Question 3

We recognize infeasibility when one or more of the artificial variables do not remain in the solution at a positive value.

Accepted Answer

A) True 
 B)False

Question 4

Solve the following problem by the simplex method.
Max
14x1 + 14.5x2 + 18x3
s.t.
x1 + 2x2 + 2.5x3 $\le$ 50
x1 + x2 + 1.5x3 $\le$ 30
x1 , x2 , x3 $\ge$ 0

Accepted Answer

None

Question 5

Algebraic methods such as the simplex method are used to solve

Accepted Answer

A) nonlinear programming problems. 
B) any size linear programming problem. 
C) programming problems under uncertainty. 
D) graphical models. 
A) nonlinear programming problems. 
B) any size linear programming problem. 
C) programming problems under uncertainty. 
D) graphical models.

Question 6

Unit columns are used to identify

Accepted Answer

A) the tableau. 
B) the c row. 
C) the b column. 
D) the basic variables. 
A) the tableau. 
B) the c row. 
C) the b column. 
D) the basic variables.

Which is not required for a problem to be in tableau form?

A minimization problem with four decision variables, two greater-than-or-equal-to constraints, and one equality constraint will have

We recognize infeasibility when one or more of the artificial variables do not remain in the solution at a positive value.

Solve the following problem by the simplex method. Max 14x₁ + 14.5x₂ + 18x₃ s.t. x₁ + 2x₂ + 2.5x₃ $\le$ 50 x₁ + x₂ + 1.5x₃ $\le$ 30 x₁ , x₂ , x₃ $\ge$ 0

Algebraic methods such as the simplex method are used to solve

Unit columns are used to identify

Introduction

An Introduction to Linear Programming

Linear Programming: Sensitivity Analysis and Interpretation of Solution

Linear Programming Applications in Marketing, Finance and Operations Management

Advanced Linear Programming Applications

Distribution and Network Problems

Integer Linear Programming

Nonlinear Optimization Models

Project Scheduling: Pertcpm

Inventory Models

Waiting Line Models

Simulation

Decision Analysis

Multicriteria Decisions

Forecasting

Markov Processes

Simplex-Based Sensitivity Analysis and Duality

Solution Procedures for Transportation and Assignment Problems

Minimal Spanning Tree

Dynamic Programming

Filters

Exam 17: Linear Programming: Simplex Method

Which is not required for a problem to be in tableau form?

A minimization problem with four decision variables, two greater-than-or-equal-to constraints, and one equality constraint will have

We recognize infeasibility when one or more of the artificial variables do not remain in the solution at a positive value.

Solve the following problem by the simplex method. Max 14x1 + 14.5x2 + 18x3 s.t. x1 + 2x2 + 2.5x3 ≤\le≤ 50 x1 + x2 + 1.5x3 ≤\le≤ 30 x1 , x2 , x3 ≥\ge≥ 0

Algebraic methods such as the simplex method are used to solve

Unit columns are used to identify

Introduction

An Introduction to Linear Programming

Linear Programming: Sensitivity Analysis and Interpretation of Solution

Linear Programming Applications in Marketing, Finance and Operations Management

Advanced Linear Programming Applications

Distribution and Network Problems

Integer Linear Programming

Nonlinear Optimization Models

Project Scheduling: Pertcpm

Inventory Models

Waiting Line Models

Simulation

Decision Analysis

Multicriteria Decisions

Forecasting

Markov Processes

Simplex-Based Sensitivity Analysis and Duality

Solution Procedures for Transportation and Assignment Problems

Minimal Spanning Tree

Dynamic Programming

Filters

Solve the following problem by the simplex method. Max 14x₁ + 14.5x₂ + 18x₃ s.t. x₁ + 2x₂ + 2.5x₃ $\le$ 50 x₁ + x₂ + 1.5x₃ $\le$ 30 x₁ , x₂ , x₃ $\ge$ 0