Question 1

Solver provides many options for the solution process. For LPs, the two most commonly used are:

Accepted Answer

A)  assume linear model, assume negative 
B)  assume non-linear model, assume negative 
C)  assume non-linear model, assume non-negative 
D)  assume linear model, assume non-negative 
A)  assume linear model, assume negative 
B)  assume non-linear model, assume negative 
C)  assume non-linear model, assume non-negative 
D)  assume linear model, assume non-negative

Question 2

In the Excel Solver "Add Constraint" box, what two additional choices are available under the relationship operator list besides ≤, ≥, and =?

Accepted Answer

A)  gin and bin 
B)  int and gin 
C)  big and int 
D)  inf and bin 
E)  int and bin 
A)  gin and bin 
B)  int and gin 
C)  big and int 
D)  inf and bin 
E)  int and bin

Question 3

Given a Linear Program with a minimization objective, the optimal objective function value may decrease if a ≥ constraint is added to the program.

Accepted Answer

A) True 
 B)False

Question 4

With Excel Solver, the Target Cell can contain either a formula or a value.

Accepted Answer

A) True 
 B)False

Question 5

The algebraic formulation of an optimization problem states the decision variables, objective function, and constraints in algebraic form.

Accepted Answer

A) True 
 B)False

Question 6

The algebraic formulation of an optimization problem must state what three things?

Accepted Answer

A)  decision variables, random variables, and parameters 
B)  decision variables, random variables, and constraints 
C)  decision variables, random variables, and objective function 
D)  random variables, parameters, and objective function 
E)  decision variables, objective function, and constraints 
A)  decision variables, random variables, and parameters 
B)  decision variables, random variables, and constraints 
C)  decision variables, random variables, and objective function 
D)  random variables, parameters, and objective function 
E)  decision variables, objective function, and constraints

Question 7

At the optimal solution of a Linear Program, the difference between the right-hand-side value and the left-hand-side value of a constraint is the ____________________.

Accepted Answer

A)  shadow 
B)  difference 
C)  shortfall 
D)  slack 
E)  cushion 
A)  shadow 
B)  difference 
C)  shortfall 
D)  slack 
E)  cushion

Question 8

Slack values for non-binding constraints are equal to 0.

Accepted Answer

A) True 
 B)False

Question 9

What is the optimal solution (X, Y, Z) to the following linear program?
Max 2X + 4Y + 6Z
Subject to
Z ≤ 0
X + Y + Z ≤ 20
X, Y, Z ≥ 0

Accepted Answer

A)  (0, 0, 20) 
B)  (20, 0, 0) 
C)  (0, 20, 0) 
D)  (20, 20, 20) 
E)  the solution is unbounded 
A)  (0, 0, 20) 
B)  (20, 0, 0) 
C)  (0, 20, 0) 
D)  (20, 20, 20) 
E)  the solution is unbounded

Question 10

Describe the primary advantage of optimization modeling.

Accepted Answer

It can simultaneously consider

Question 11

Consider the following three functions:
G(x, y) = 4x - 9y2
H(x, y, z) = 13x + y + 3z -6
I(y, z) = z - y
Which of the following is true regarding the linearity of the functions?

Accepted Answer

A)  none of the functions is linear 
B)  all three functions are linear 
C)  h is linear, but g and i are not linear 
D)  i is linear, but g and h are not linear 
E)  h and i are linear, but g is not linear 
A)  none of the functions is linear 
B)  all three functions are linear 
C)  h is linear, but g and i are not linear 
D)  i is linear, but g and h are not linear 
E)  h and i are linear, but g is not linear

Question 12

Consider the following constraints from a two-variable Linear Program.
(1) X ≥ 0
(2) Y ≥ 0
(3) 10X + 4Y ≤ 110
(4) 5X - Y ≤ 40
If constraints (3) and (4) are binding, what is the optimal solution (X, Y)?

Accepted Answer

A)  (11, 0) 
B)  (0, 27.5) 
C)  (0, -40) 
D)  (9, 5) 
E)  not enough information is provided to answer the problem 
A)  (11, 0) 
B)  (0, 27.5) 
C)  (0, -40) 
D)  (9, 5) 
E)  not enough information is provided to answer the problem

Question 13

An optimal solution to an optimization problem is always feasible.

Accepted Answer

A) True 
 B)False

Question 14

Not-equals-to constraints (≠) are allowable in optimization problems.

Accepted Answer

A) True 
 B)False

Question 15

A formulation is a formal, ____________ statement of a constrained optimization problem

Accepted Answer

The answer of A formulation is a formal, ____________ statement...

Question 16

Explain what differentiates a Linear Program from a Nonlinear Program.

Accepted Answer

All of the relationships among the decis

Question 17

There is no single way to set up a Linear Program in a spreadsheet.

Accepted Answer

A) True 
 B)False

Question 18

When formulating optimization problems, which of the following represent the typical sequence?

Accepted Answer

A)  (1) text-based formulation, (2) diagram, (3) algebraic formulation 
B)  (1) text-based formulation, (2) algebraic formulation, (3) diagram 
C)  (1) diagram, (2) algebraic formulation, (3) text-based formulation 
D)  (1) diagram, (2) text-based formulation, (3) algebraic formulation 
E)  (1) algebraic formulation, (2) diagram, (3) text-based formulation 
A)  (1) text-based formulation, (2) diagram, (3) algebraic formulation 
B)  (1) text-based formulation, (2) algebraic formulation, (3) diagram 
C)  (1) diagram, (2) algebraic formulation, (3) text-based formulation 
D)  (1) diagram, (2) text-based formulation, (3) algebraic formulation 
E)  (1) algebraic formulation, (2) diagram, (3) text-based formulation

Question 19

For an optimization problem a(an) __________________ violates at least one of the constraints.

Accepted Answer

A)  infeasible solution 
B)  inoptimal solution 
C)  suboptimal solution 
D)  unbounded solution 
E)  simplex solution 
A)  infeasible solution 
B)  inoptimal solution 
C)  suboptimal solution 
D)  unbounded solution 
E)  simplex solution

Question 20

George Dantzig developed the Simplex Method in 1947.

Accepted Answer

A) True 
 B)False

Solver provides many options for the solution process. For LPs, the two most commonly used are:

In the Excel Solver "Add Constraint" box, what two additional choices are available under the relationship operator list besides ≤, ≥, and =?

Given a Linear Program with a minimization objective, the optimal objective function value may decrease if a ≥ constraint is added to the program.

With Excel Solver, the Target Cell can contain either a formula or a value.

The algebraic formulation of an optimization problem states the decision variables, objective function, and constraints in algebraic form.

The algebraic formulation of an optimization problem must state what three things?

At the optimal solution of a Linear Program, the difference between the right-hand-side value and the left-hand-side value of a constraint is the ____________________.

Slack values for non-binding constraints are equal to 0.

What is the optimal solution (X, Y, Z) to the following linear program? Max 2X + 4Y + 6Z Subject to Z ≤ 0 X + Y + Z ≤ 20 X, Y, Z ≥ 0

Describe the primary advantage of optimization modeling.

Consider the following three functions: G(x, y) = 4x - 9y² H(x, y, z) = 13x + y + 3z -6 I(y, z) = z - y Which of the following is true regarding the linearity of the functions?

Consider the following constraints from a two-variable Linear Program. (1) X ≥ 0 (2) Y ≥ 0 (3) 10X + 4Y ≤ 110 (4) 5X - Y ≤ 40 If constraints (3) and (4) are binding, what is the optimal solution (X, Y)?

An optimal solution to an optimization problem is always feasible.

Not-equals-to constraints (≠) are allowable in optimization problems.

A formulation is a formal, ____________ statement of a constrained optimization problem

Explain what differentiates a Linear Program from a Nonlinear Program.

There is no single way to set up a Linear Program in a spreadsheet.

When formulating optimization problems, which of the following represent the typical sequence?

For an optimization problem a(an) __________________ violates at least one of the constraints.

George Dantzig developed the Simplex Method in 1947.

Introduction to Operations Management

Operations Strategy and Competitiveness

Product Design and Process Selection

Supply Chain Management

Total Quality Management

Statistical Quality Control

Just-In-Time and Lean Systems

Forecasting

Capacity Planning and Facility Location

Facility Layout

Work System Design

Inventory Management

Aggregate Planning

Resource Planning

Scheduling

Project Management

Spreadsheet Modeling: An Introduction

Waiting Line Models

Master Scheduling and Rough-Cut Capacity Planning

Filters

Exam 18: Introduction to Optimization

Solver provides many options for the solution process. For LPs, the two most commonly used are:

In the Excel Solver "Add Constraint" box, what two additional choices are available under the relationship operator list besides ≤, ≥, and =?

Given a Linear Program with a minimization objective, the optimal objective function value may decrease if a ≥ constraint is added to the program.

With Excel Solver, the Target Cell can contain either a formula or a value.

The algebraic formulation of an optimization problem states the decision variables, objective function, and constraints in algebraic form.

The algebraic formulation of an optimization problem must state what three things?

At the optimal solution of a Linear Program, the difference between the right-hand-side value and the left-hand-side value of a constraint is the ____________________.

Slack values for non-binding constraints are equal to 0.

What is the optimal solution (X, Y, Z) to the following linear program? Max 2X + 4Y + 6Z Subject to Z ≤ 0 X + Y + Z ≤ 20 X, Y, Z ≥ 0

Describe the primary advantage of optimization modeling.

Consider the following three functions: G(x, y) = 4x - 9y2 H(x, y, z) = 13x + y + 3z -6 I(y, z) = z - y Which of the following is true regarding the linearity of the functions?

Consider the following constraints from a two-variable Linear Program. (1) X ≥ 0 (2) Y ≥ 0 (3) 10X + 4Y ≤ 110 (4) 5X - Y ≤ 40 If constraints (3) and (4) are binding, what is the optimal solution (X, Y)?

An optimal solution to an optimization problem is always feasible.

Not-equals-to constraints (≠) are allowable in optimization problems.

A formulation is a formal, ____________ statement of a constrained optimization problem

Explain what differentiates a Linear Program from a Nonlinear Program.

There is no single way to set up a Linear Program in a spreadsheet.

When formulating optimization problems, which of the following represent the typical sequence?

For an optimization problem a(an) __________________ violates at least one of the constraints.

George Dantzig developed the Simplex Method in 1947.

Introduction to Operations Management

Operations Strategy and Competitiveness

Product Design and Process Selection

Supply Chain Management

Total Quality Management

Statistical Quality Control

Just-In-Time and Lean Systems

Forecasting

Capacity Planning and Facility Location

Facility Layout

Work System Design

Inventory Management

Aggregate Planning

Resource Planning

Scheduling

Project Management

Spreadsheet Modeling: An Introduction

Waiting Line Models

Master Scheduling and Rough-Cut Capacity Planning

Filters

Consider the following three functions: G(x, y) = 4x - 9y² H(x, y, z) = 13x + y + 3z -6 I(y, z) = z - y Which of the following is true regarding the linearity of the functions?