Question 1

Whenever all the constraints in a linear program are expressed as equalities, the linear program is said to be written in

Accepted Answer

A)  standard form. 
B)  bounded form. 
C)  feasible form. 
D)  alternative form. 
A)  standard form. 
B)  bounded form. 
C)  feasible form. 
D)  alternative form.

Question 2

All linear programming problems have all of the following properties EXCEPT

Accepted Answer

A)  a linear objective function that is to be maximized or minimized. 
B)  a set of linear constraints. 
C)  alternative optimal solutions. 
D)  variables that are all restricted to nonnegative values. 
A)  a linear objective function that is to be maximized or minimized. 
B)  a set of linear constraints. 
C)  alternative optimal solutions. 
D)  variables that are all restricted to nonnegative values.

Question 3

Slack

Accepted Answer

A)  is the difference between the left and right sides of a constraint. 
B)  is the amount by which the left side of a $\le$ constraint is smaller than the right side. 
C)  is the amount by which the left side of a $\ge$ constraint is larger than the right side. 
D)  exists for each variable in a linear programming problem. 
A)  is the difference between the left and right sides of a constraint. 
B)  is the amount by which the left side of a $\le$ constraint is smaller than the right side. 
C)  is the amount by which the left side of a $\ge$ constraint is larger than the right side. 
D)  exists for each variable in a linear programming problem.

Question 4

Which of the following special cases does not require reformulation of the problem in order to obtain a solution?

Accepted Answer

A)  alternate optimality 
B)  infeasibility 
C)  unboundedness 
D)  each case requires a reformulation. 
A)  alternate optimality 
B)  infeasibility 
C)  unboundedness 
D)  each case requires a reformulation.

Question 5

Decision variables

Accepted Answer

A)  tell how much or how many of something to produce, invest, purchase, hire, etc. 
B)  represent the values of the constraints. 
C)  measure the objective function. 
D)  must exist for each constraint. 
A)  tell how much or how many of something to produce, invest, purchase, hire, etc. 
B)  represent the values of the constraints. 
C)  measure the objective function. 
D)  must exist for each constraint.

Question 6

The constraint 5x1 -2x2 $\le$ 0 passes through the point (20, 50).

Accepted Answer

A) True 
 B)False

Whenever all the constraints in a linear program are expressed as equalities, the linear program is said to be written in

All linear programming problems have all of the following properties EXCEPT

Slack

Which of the following special cases does not require reformulation of the problem in order to obtain a solution?

Decision variables

The constraint 5x₁ -2x₂ $\le$ 0 passes through the point (20, 50).

Introduction

Linear Programming: Sensitivity Analysis and Interpretation of Solution

Linear Programming Applications in Marketing, Finance, and Operations Management

Advanced Linear Programming Applications

Distribution and Network Models

Integer Linear Programming

Nonlinear Optimization Models

Project Scheduling: Pertcpm

Inventory Models

Waiting Line Models

Simulation

Decision Analysis

Multicriteria Decisions

Forecasting

Markov Processes

Filters

Exam 2: An Introduction to Linear Programming

Whenever all the constraints in a linear program are expressed as equalities, the linear program is said to be written in

All linear programming problems have all of the following properties EXCEPT

Slack

Which of the following special cases does not require reformulation of the problem in order to obtain a solution?

Decision variables

The constraint 5x1 -2x2 ≤\le≤ 0 passes through the point (20, 50).

Introduction

Linear Programming: Sensitivity Analysis and Interpretation of Solution

Linear Programming Applications in Marketing, Finance, and Operations Management

Advanced Linear Programming Applications

Distribution and Network Models

Integer Linear Programming

Nonlinear Optimization Models

Project Scheduling: Pertcpm

Inventory Models

Waiting Line Models

Simulation

Decision Analysis

Multicriteria Decisions

Forecasting

Markov Processes

Filters

The constraint 5x₁ -2x₂ $\le$ 0 passes through the point (20, 50).