Question 1

Suppose an objective function has the equation:   .
Then the slope of the objective function line is 2.

Accepted Answer

A) True 
 B)False

Question 2

The term nonnegativity refers to the condition in which the

Accepted Answer

A) objective function cannot be less than zero. 
B) decision variables cannot be less than zero. 
C) right hand side of the constraints cannot be greater than zero. 
D) reduced cost cannot be less than zero. 
A) objective function cannot be less than zero. 
B) decision variables cannot be less than zero. 
C) right hand side of the constraints cannot be greater than zero. 
D) reduced cost cannot be less than zero.

Question 3

There is often more than one objective in linear programming problems.

Accepted Answer

A) True 
 B)False

Question 4

An efficient algorithm for finding the optimal solution in a linear programming model is the _____ method.

Accepted Answer

A) spreadsheet 
B) solution mix 
C) complex 
D) simplex 
A) spreadsheet 
B) solution mix 
C) complex 
D) simplex

Question 5

In general,the complete solution of a linear programming problem involves three stages: formulating the model,invoking Solver to find the optimal solution,and performing sensitivity analysis.

Accepted Answer

A) True 
 B)False

Question 6

Linear programming problems can always be formulated algebraically,but not always on a spreadsheet.

Accepted Answer

A) True 
 B)False

Question 7

All optimization problems have

Accepted Answer

A) an objective function and decision variables. 
B) an objective function and constraints. 
C) decision variables and constraints. 
D) an objective function,decision variables and constraints. 
A) an objective function and decision variables. 
B) an objective function and constraints. 
C) decision variables and constraints. 
D) an objective function,decision variables and constraints.

Question 8

A decision support system is a user-friendly system where an end user can enter inputs to a model and see outputs,but need not be concerned with technical details.

Accepted Answer

A) True 
 B)False

Question 9

The proportionality property of LP models means that if the level of any activity is multiplied by a constant factor,then the contribution of this activity to the objective function,or to any of the constraints in which the activity is involved,is multiplied by the same factor.

Accepted Answer

A) True 
 B)False

Question 10

The value to be optimized in an optimization model (such as profit)is called the objective.

Accepted Answer

A) True 
 B)False

Question 11

If a solution to an LP problem satisfies all of the constraints,then it must be feasible.

Accepted Answer

A) True 
 B)False

Question 12

Unboundedness refers to the situation in which the LP model has been formulated in such a way that the objective function is unbounded - that is,it can be made as large (for maximization problems)or as small (for minimization problems)as we wish.

Accepted Answer

A) True 
 B)False

Question 13

All linear programming problems should have a unique solution,if they can be solved.

Accepted Answer

A) True 
 B)False

Question 14

The divisibility property of linear programming means that a solution can have both

Accepted Answer

A) integer and noninteger levels of an activity. 
B) linear and nonlinear relationships. 
C) positive and negative values. 
D) revenue and cost information in the model. 
A) integer and noninteger levels of an activity. 
B) linear and nonlinear relationships. 
C) positive and negative values. 
D) revenue and cost information in the model.

Question 15

What is the equation of the line representing this constraint?

Accepted Answer

A)    
B)    
C)    
D)    
A)    
B)    
C)    
D)

Question 16

Consider the following linear programming problem: Minimize:   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.

Question 17

Suppose a firm must at least meet minimum expected demands of 60 for product x and 80 of product y.An algebraic formulation of these constraints is

Accepted Answer

A)    . 
B)    . 
C)    . 
D)    . 
A)    . 
B)    . 
C)    . 
D)    .

Question 18

Reduced costs indicate how much the objective coefficient of a decision variable that is currently 0 or at its upper bound must change before that the value of that variable changes.

Accepted Answer

A) True 
 B)False

Question 19

A feasible solution is a solution that satisfies all of the constraints.

Accepted Answer

A) True 
 B)False

Question 20

A feasible solution does not have to satisfy any constraints as long as it is logical.

Accepted Answer

A) True 
 B)False

Suppose an objective function has the equation: . Then the slope of the objective function line is 2.

The term nonnegativity refers to the condition in which the

There is often more than one objective in linear programming problems.

An efficient algorithm for finding the optimal solution in a linear programming model is the _____ method.

In general,the complete solution of a linear programming problem involves three stages: formulating the model,invoking Solver to find the optimal solution,and performing sensitivity analysis.

Linear programming problems can always be formulated algebraically,but not always on a spreadsheet.

All optimization problems have

A decision support system is a user-friendly system where an end user can enter inputs to a model and see outputs,but need not be concerned with technical details.

The proportionality property of LP models means that if the level of any activity is multiplied by a constant factor,then the contribution of this activity to the objective function,or to any of the constraints in which the activity is involved,is multiplied by the same factor.

The value to be optimized in an optimization model (such as profit)is called the objective.

If a solution to an LP problem satisfies all of the constraints,then it must be feasible.

Unboundedness refers to the situation in which the LP model has been formulated in such a way that the objective function is unbounded - that is,it can be made as large (for maximization problems)or as small (for minimization problems)as we wish.

All linear programming problems should have a unique solution,if they can be solved.

The divisibility property of linear programming means that a solution can have both

What is the equation of the line representing this constraint?

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

Suppose a firm must at least meet minimum expected demands of 60 for product x and 80 of product y.An algebraic formulation of these constraints is

Reduced costs indicate how much the objective coefficient of a decision variable that is currently 0 or at its upper bound must change before that the value of that variable changes.

A feasible solution is a solution that satisfies all of the constraints.

A feasible solution does not have to satisfy any constraints as long as it is logical.

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

Suppose an objective function has the equation: . Then the slope of the objective function line is 2.

The term nonnegativity refers to the condition in which the

There is often more than one objective in linear programming problems.

An efficient algorithm for finding the optimal solution in a linear programming model is the _____ method.

In general,the complete solution of a linear programming problem involves three stages: formulating the model,invoking Solver to find the optimal solution,and performing sensitivity analysis.

Linear programming problems can always be formulated algebraically,but not always on a spreadsheet.

All optimization problems have

A decision support system is a user-friendly system where an end user can enter inputs to a model and see outputs,but need not be concerned with technical details.

The proportionality property of LP models means that if the level of any activity is multiplied by a constant factor,then the contribution of this activity to the objective function,or to any of the constraints in which the activity is involved,is multiplied by the same factor.

The value to be optimized in an optimization model (such as profit)is called the objective.

If a solution to an LP problem satisfies all of the constraints,then it must be feasible.

Unboundedness refers to the situation in which the LP model has been formulated in such a way that the objective function is unbounded - that is,it can be made as large (for maximization problems)or as small (for minimization problems)as we wish.

All linear programming problems should have a unique solution,if they can be solved.

The divisibility property of linear programming means that a solution can have both

What is the equation of the line representing this constraint?

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

Suppose a firm must at least meet minimum expected demands of 60 for product x and 80 of product y.An algebraic formulation of these constraints is

Reduced costs indicate how much the objective coefficient of a decision variable that is currently 0 or at its upper bound must change before that the value of that variable changes.

A feasible solution is a solution that satisfies all of the constraints.

A feasible solution does not have to satisfy any constraints as long as it is logical.

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