Question 1

A 12-month rolling planning horizon is a single model where the decision in the first period is implemented.

Accepted Answer

A) True 
 B)False  False

Question 2

All optimization problems include decision variables,one objective function,and two constraints.

Accepted Answer

A) True 
 B)False  False

Question 3

Conditions that must be satisfied in an optimization model are

Accepted Answer

A) values of the objective function. 
B) constraints. 
C) shadow prices. 
D) intercepts. 
A) values of the objective function. 
B) constraints. 
C) shadow prices. 
D) intercepts. B

Question 4

There are two primary ways to formulate a linear programming problem: the traditional algebraic way and with spreadsheets.

Accepted Answer

A) True 
 B)False

Question 5

In determining the optimal solution to a linear programming problem graphically,if the goal is to maximize the objective,we pull the objective function line down until it contacts the feasible region.

Accepted Answer

A) True 
 B)False

Question 6

When formulating a linear programming spreadsheet model,we specify the constraints in a Solver dialog box,since Excel does not show the constraints directly.

Accepted Answer

A) True 
 B)False

Question 7

In some cases,a linear programming problem can be formulated such that the objective can become infinitely large (for a maximization problem)or infinitely small (for a minimization problem).This type of problem is said to be

Accepted Answer

A) infeasible. 
B) inconsistent. 
C) unbounded. 
D) redundant. 
A) infeasible. 
B) inconsistent. 
C) unbounded. 
D) redundant.

Question 8

There are generally two steps in solving an optimization problem: model development and optimization.

Accepted Answer

A) True 
 B)False

Question 9

The optimal solution to any linear programming model is the

Accepted Answer

A) maximum objective function line. 
B) minimum objective function line. 
C) corner point of a polygon. 
D) maximum or minimum of a parabola. 
A) maximum objective function line. 
B) minimum objective function line. 
C) corner point of a polygon. 
D) maximum or minimum of a parabola.

Question 10

A rolling planning horizon is a multiperiod model where only the decision in the first period is implemented,and then a new multiperiod model is solved in succeeding periods.

Accepted Answer

A) True 
 B)False

Question 11

Suppose the allowable increase and decrease for an objective coefficient of a decision variable that has a current value of $50 are $25 (increase)and $10 (decrease).If the coefficient were to change from $50 to $60,the optimal value of the objective function would not change.

Accepted Answer

A) True 
 B)False

Question 12

Linear programming models have three important properties

Accepted Answer

A) optimality,additivity,and sensitivity. 
B) optimality,linearity,and divisibility. 
C) divisibility,linearity,and nonnegativity. 
D) proportionality,additivity,and divisibility. 
A) optimality,additivity,and sensitivity. 
B) optimality,linearity,and divisibility. 
C) divisibility,linearity,and nonnegativity. 
D) proportionality,additivity,and divisibility.

Question 13

A Solver's sensitivity report shows sensitivity to objective coefficients and right sides of the constraints.

Accepted Answer

A) True 
 B)False

Question 14

When formulating a linear programming spreadsheet model,there is a set of designated cells that play the role of the decision variables.These are called the objective cells.

Accepted Answer

A) True 
 B)False

Question 15

In most cases,when solving linear programming problems,we want the decision variables to be

Accepted Answer

A) equal to zero. 
B) nonnegative. 
C) nonpositive. 
D) continuous. 
A) equal to zero. 
B) nonnegative. 
C) nonpositive. 
D) continuous.

Question 16

When the proportionality property of LP models is violated,we generally must use non-linear optimization.

Accepted Answer

A) True 
 B)False

Question 17

In an optimization model,there can only be one

Accepted Answer

A) decision variable. 
B) constraint. 
C) objective function. 
D) shadow price. 
A) decision variable. 
B) constraint. 
C) objective function. 
D) shadow price.

Question 18

The additivity property of linear programming implies that the contribution of any decision variable to the objective is of/on the levels of the other decision variables.

Accepted Answer

A) Dependent 
B) Independent 
C) Conditional 
D) The sum 
A) Dependent 
B) Independent 
C) Conditional 
D) The sum

Question 19

A linear programming problem with _____decision variable(s)can be solved by a graphical solution method.

Accepted Answer

A) two 
B) three 
C) four 
D) five 
A) two 
B) three 
C) four 
D) five

Question 20

Consider the following linear programming problem: Maximize   Subject to:       The above linear programming problem

Accepted Answer

A) has only one optimal solution. 
B) has more than one optimal solution. 
C) exhibits infeasibility. 
D) exhibits unboundedness. 
A) has only one optimal solution. 
B) has more than one optimal solution. 
C) exhibits infeasibility. 
D) exhibits unboundedness.

A 12-month rolling planning horizon is a single model where the decision in the first period is implemented.

All optimization problems include decision variables,one objective function,and two constraints.

Conditions that must be satisfied in an optimization model are

There are two primary ways to formulate a linear programming problem: the traditional algebraic way and with spreadsheets.

In determining the optimal solution to a linear programming problem graphically,if the goal is to maximize the objective,we pull the objective function line down until it contacts the feasible region.

When formulating a linear programming spreadsheet model,we specify the constraints in a Solver dialog box,since Excel does not show the constraints directly.

In some cases,a linear programming problem can be formulated such that the objective can become infinitely large (for a maximization problem)or infinitely small (for a minimization problem).This type of problem is said to be

There are generally two steps in solving an optimization problem: model development and optimization.

The optimal solution to any linear programming model is the

A rolling planning horizon is a multiperiod model where only the decision in the first period is implemented,and then a new multiperiod model is solved in succeeding periods.

Suppose the allowable increase and decrease for an objective coefficient of a decision variable that has a current value of $50 are $25 (increase)and $10 (decrease).If the coefficient were to change from $50 to $60,the optimal value of the objective function would not change.

Linear programming models have three important properties

A Solver's sensitivity report shows sensitivity to objective coefficients and right sides of the constraints.

When formulating a linear programming spreadsheet model,there is a set of designated cells that play the role of the decision variables.These are called the objective cells.

In most cases,when solving linear programming problems,we want the decision variables to be

When the proportionality property of LP models is violated,we generally must use non-linear optimization.

In an optimization model,there can only be one

The additivity property of linear programming implies that the contribution of any decision variable to the objective is of/on the levels of the other decision variables.

A linear programming problem with _____decision variable(s)can be solved by a graphical solution method.

Consider the following linear programming problem: Maximize Subject to: The above linear programming problem

Introduction to Business Analytics

Describing the Distribution of a Variable

Finding Relationships Among Variables

Business Intelligence Bifor Data Analysis

Probability and Probability Distributions

Decision Making Under Uncertainty

Sampling and Sampling Distributions

Confidence Interval Estimation

Hypothesis Testing

Regression Analysis: Estimating Relationships

Regression Analysis: Statistical Inference

Time Series Analysis and Forecasting

Optimization Models

Introduction to Simulation Modeling

Simulation Models

Data Mining

Analysis of Variance and Experimental Design

Statistical Process Control

Filters

Exam 13: Introduction to Optimization Modeling

A 12-month rolling planning horizon is a single model where the decision in the first period is implemented.

All optimization problems include decision variables,one objective function,and two constraints.

Conditions that must be satisfied in an optimization model are

There are two primary ways to formulate a linear programming problem: the traditional algebraic way and with spreadsheets.

In determining the optimal solution to a linear programming problem graphically,if the goal is to maximize the objective,we pull the objective function line down until it contacts the feasible region.

When formulating a linear programming spreadsheet model,we specify the constraints in a Solver dialog box,since Excel does not show the constraints directly.

In some cases,a linear programming problem can be formulated such that the objective can become infinitely large (for a maximization problem)or infinitely small (for a minimization problem).This type of problem is said to be

There are generally two steps in solving an optimization problem: model development and optimization.

The optimal solution to any linear programming model is the

A rolling planning horizon is a multiperiod model where only the decision in the first period is implemented,and then a new multiperiod model is solved in succeeding periods.

Suppose the allowable increase and decrease for an objective coefficient of a decision variable that has a current value of $50 are $25 (increase)and $10 (decrease).If the coefficient were to change from $50 to $60,the optimal value of the objective function would not change.

Linear programming models have three important properties

A Solver's sensitivity report shows sensitivity to objective coefficients and right sides of the constraints.

When formulating a linear programming spreadsheet model,there is a set of designated cells that play the role of the decision variables.These are called the objective cells.

In most cases,when solving linear programming problems,we want the decision variables to be

When the proportionality property of LP models is violated,we generally must use non-linear optimization.

In an optimization model,there can only be one

The additivity property of linear programming implies that the contribution of any decision variable to the objective is of/on the levels of the other decision variables.

A linear programming problem with _____decision variable(s)can be solved by a graphical solution method.

Consider the following linear programming problem: Maximize Subject to: The above linear programming problem

Introduction to Business Analytics

Describing the Distribution of a Variable

Finding Relationships Among Variables

Business Intelligence Bifor Data Analysis

Probability and Probability Distributions

Decision Making Under Uncertainty

Sampling and Sampling Distributions

Confidence Interval Estimation

Hypothesis Testing

Regression Analysis: Estimating Relationships

Regression Analysis: Statistical Inference

Time Series Analysis and Forecasting

Optimization Models

Introduction to Simulation Modeling

Simulation Models

Data Mining

Analysis of Variance and Experimental Design

Statistical Process Control

Filters