Question 1

To specify that $X _ { 1 }$
Must be at most 75% of the blend of $X _ { 1 } , X _ { 2 } , \text { and } X _ { 3 }$
We must have a constraint of the form

Accepted Answer

A) 
$X _ { 1 } \geq 0.75 \left( X _ { 2 } + X _ { 3 } \right)$ 
B) 
$X _ { 1 } \leq 0.25 \left( X _ { 1 } + X _ { 2 } + X _ { 3 } \right)$ 
C) 
$X _ { 1 } \leq 0.75 \left( X _ { 1 } + X _ { 2 } + X _ { 3 } \right)$ 
D) 
$0.75 X _ { 1 } \geq X _ { 1 } + X _ { 2 } + X _ { 3 }$ 
E) 
$.25 X _ { 1 } \geq 0.75 \left( X _ { 2 } + X _ { 3 } \right)$ 
A) 
$X _ { 1 } \geq 0.75 \left( X _ { 2 } + X _ { 3 } \right)$ 
B) 
$X _ { 1 } \leq 0.25 \left( X _ { 1 } + X _ { 2 } + X _ { 3 } \right)$ 
C) 
$X _ { 1 } \leq 0.75 \left( X _ { 1 } + X _ { 2 } + X _ { 3 } \right)$ 
D) 
$0.75 X _ { 1 } \geq X _ { 1 } + X _ { 2 } + X _ { 3 }$ 
E) 
$.25 X _ { 1 } \geq 0.75 \left( X _ { 2 } + X _ { 3 } \right)$

Question 2

In a network representation of a transportation problem,the arcs generally represent:

Accepted Answer

A)  warehouses 
B)  geographic locations 
C)  flows 
D)  capacities 
A)  warehouses 
B)  geographic locations 
C)  flows 
D)  capacities

Question 3

A local optimal solution is better than all nearby solutions,but a solution far away might be better than it.

Accepted Answer

A) True 
 B)False

Question 4

The decision variables in transportation problems are:

Accepted Answer

A)  profits 
B)  costs 
C)  flows 
D)  capacities 
A)  profits 
B)  costs 
C)  flows 
D)  capacities

Question 5

The LP relaxation of an integer programming (IP)problem is the same model as the IP model except that some integer constraints are omitted.

Accepted Answer

A) True 
 B)False

Question 6

In aggregate planning models,which of the following statements are correct?

Accepted Answer

A)  The number of workers available influences the possible production levels 
B)  We allow the workforce level to be modified each month through the hiring and firing of workers 
C)  We eventually allow demand to be backlogged;that is,demand need not be met on time 
D)  All of these options 
A)  The number of workers available influences the possible production levels 
B)  We allow the workforce level to be modified each month through the hiring and firing of workers 
C)  We eventually allow demand to be backlogged;that is,demand need not be met on time 
D)  All of these options

Question 7

The objective in transportation problems is typically to:

Accepted Answer

A)  maximize profits 
B)  maximize revenue 
C)  minimize costs 
D)  maximize feasibility 
A)  maximize profits 
B)  maximize revenue 
C)  minimize costs 
D)  maximize feasibility

Question 8

A 0-1 variable,also called a binary variable,is a variable that must equal 0 or 1.

Accepted Answer

A) True 
 B)False

Question 9

The optimal solution to an LP problem was $X _ { 1 }$ 
3.69 and $X _ { 2 }$ 
1.21.If $X _ { 1 }$ 
and $X _ { 2 }$ 
were restricted to be integers,then $X _ { 1 }$ 
= 4 and $X _ { 2 } =$ 
1 will be a feasible solution,but not necessarily an optimal solution to the IP problem.

Accepted Answer

A) True 
 B)False

Question 10

Which of the following is not a required input for a typical transportation problem?

Accepted Answer

A)  Capacities (or supplies) 
B)  Demands 
C)  Unit shipping (and possibly production)costs 
D)  Distance from origins to destinations 
A)  Capacities (or supplies) 
B)  Demands 
C)  Unit shipping (and possibly production)costs 
D)  Distance from origins to destinations

Question 11

The problem which deals with the direct distribution of products from supply locations to demand locations is called a(n)

Accepted Answer

A)  transportation problem 
B)  assignment problem 
C)  network problem 
D)  transshipment problem 
A)  transportation problem 
B)  assignment problem 
C)  network problem 
D)  transshipment problem

Question 12

A typical transportation problem requires which of the following sets of input numbers:

Accepted Answer

A)  Capacities,demands and flows 
B)  Capacities,demands and unit shipping costs 
C)  Supplies,demands and flows 
D)  Supplies,demands and arcs 
A)  Capacities,demands and flows 
B)  Capacities,demands and unit shipping costs 
C)  Supplies,demands and flows 
D)  Supplies,demands and arcs

Question 13

In formulating a transportation problem as linear programming model,which of the following statements are correct?

Accepted Answer

A)  There is one constraint for each supply location 
B)  There is one constraint for each demand location 
C)  The sum of decision variables out of a supply location is constrained by the supply at that location 
D)  The sum of decision variables out of all supply locations to a specific demand location is constrained by the demand at that location 
E)  All of these options 
A)  There is one constraint for each supply location 
B)  There is one constraint for each demand location 
C)  The sum of decision variables out of a supply location is constrained by the supply at that location 
D)  The sum of decision variables out of all supply locations to a specific demand location is constrained by the demand at that location 
E)  All of these options

Question 14

A global optimal solution is not necessarily the best solution overall.

Accepted Answer

A) True 
 B)False

Question 15

A common characteristic of integer programming models is that they:

Accepted Answer

A)  are easy to solve graphically 
B)  produce the same answer and standard linear programming models 
C)  often produce multiple optimal solutions 
D)  all of these options 
A)  are easy to solve graphically 
B)  produce the same answer and standard linear programming models 
C)  often produce multiple optimal solutions 
D)  all of these options

Question 16

In transportation problems,shipping costs are often nonlinear due to quantity discounts.

Accepted Answer

A) True 
 B)False

Question 17

Workforce scheduling problems are often integer programming models,which means that they have:

Accepted Answer

A)  an integer objective function 
B)  integer decision variables 
C)  integer constraints 
D)  all of these options 
A)  an integer objective function 
B)  integer decision variables 
C)  integer constraints 
D)  all of these options

Question 18

For some types of integer programming problems,their LP relaxation solutions are optimal.

Accepted Answer

A) True 
 B)False

Question 19

A good shipping plan uses as many cheap routes as possible,but ultimately is constrained by capacities and demands.

Accepted Answer

A) True 
 B)False

Question 20

The transportation model is a special case of the minimum cost network flow model (MCNFM).

Accepted Answer

A) True 
 B)False

To specify that $X _ { 1 }$ Must be at most 75% of the blend of $X _ { 1 } , X _ { 2 } , \text { and } X _ { 3 }$ We must have a constraint of the form

In a network representation of a transportation problem,the arcs generally represent:

A local optimal solution is better than all nearby solutions,but a solution far away might be better than it.

The decision variables in transportation problems are:

The LP relaxation of an integer programming (IP)problem is the same model as the IP model except that some integer constraints are omitted.

In aggregate planning models,which of the following statements are correct?

The objective in transportation problems is typically to:

A 0-1 variable,also called a binary variable,is a variable that must equal 0 or 1.

The optimal solution to an LP problem was $X _ { 1 }$ 3.69 and $X _ { 2 }$ 1.21.If $X _ { 1 }$ and $X _ { 2 }$ were restricted to be integers,then $X _ { 1 }$ = 4 and $X _ { 2 } =$ 1 will be a feasible solution,but not necessarily an optimal solution to the IP problem.

Which of the following is not a required input for a typical transportation problem?

The problem which deals with the direct distribution of products from supply locations to demand locations is called a(n)

A typical transportation problem requires which of the following sets of input numbers:

In formulating a transportation problem as linear programming model,which of the following statements are correct?

A global optimal solution is not necessarily the best solution overall.

A common characteristic of integer programming models is that they:

In transportation problems,shipping costs are often nonlinear due to quantity discounts.

Workforce scheduling problems are often integer programming models,which means that they have:

For some types of integer programming problems,their LP relaxation solutions are optimal.

A good shipping plan uses as many cheap routes as possible,but ultimately is constrained by capacities and demands.

The transportation model is a special case of the minimum cost network flow model (MCNFM).

Introduction to Data Analysis and Decision Making

Describing the Distribution of a Single Variable

Finding Relationships Among Variables

Probability and Probability Distributions

Normal, Binomial, Poisson, and Exponential 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

Introduction to Optimization Modeling

Introduction to Simulation Modeling

Simulation Models

Data Mining

Importing Data Into Excel

Analysis of Variance and Experimental Design

Statistical Process Control

Filters

Exam 14: Optimization Models

To specify that X1X _ { 1 }X1​ Must be at most 75% of the blend of X1,X2, and X3X _ { 1 } , X _ { 2 } , \text { and } X _ { 3 }X1​,X2​, and X3​ We must have a constraint of the form

In a network representation of a transportation problem,the arcs generally represent:

A local optimal solution is better than all nearby solutions,but a solution far away might be better than it.

The decision variables in transportation problems are:

The LP relaxation of an integer programming (IP)problem is the same model as the IP model except that some integer constraints are omitted.

In aggregate planning models,which of the following statements are correct?

The objective in transportation problems is typically to:

A 0-1 variable,also called a binary variable,is a variable that must equal 0 or 1.

Which of the following is not a required input for a typical transportation problem?

The problem which deals with the direct distribution of products from supply locations to demand locations is called a(n)

A typical transportation problem requires which of the following sets of input numbers:

In formulating a transportation problem as linear programming model,which of the following statements are correct?

A global optimal solution is not necessarily the best solution overall.

A common characteristic of integer programming models is that they:

In transportation problems,shipping costs are often nonlinear due to quantity discounts.

Workforce scheduling problems are often integer programming models,which means that they have:

For some types of integer programming problems,their LP relaxation solutions are optimal.

A good shipping plan uses as many cheap routes as possible,but ultimately is constrained by capacities and demands.

The transportation model is a special case of the minimum cost network flow model (MCNFM).

Introduction to Data Analysis and Decision Making

Describing the Distribution of a Single Variable

Finding Relationships Among Variables

Probability and Probability Distributions

Normal, Binomial, Poisson, and Exponential 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

Introduction to Optimization Modeling

Introduction to Simulation Modeling

Simulation Models

Data Mining

Importing Data Into Excel

Analysis of Variance and Experimental Design

Statistical Process Control

Filters

To specify that $X _ { 1 }$ Must be at most 75% of the blend of $X _ { 1 } , X _ { 2 } , \text { and } X _ { 3 }$ We must have a constraint of the form