Question 1

To retain model flexibility while using Solver you must:

Accepted Answer

A) use appropriate color codes 
B) enter specific values 
C) ensure the inputs and outputs are separated 
D) use only cell references 
E) use Slack 
A) use appropriate color codes 
B) enter specific values 
C) ensure the inputs and outputs are separated 
D) use only cell references 
E) use Slack

Question 2

What are the allowable constraint relationship types in optimization problems?

Accepted Answer

A) , = 
B) , =, ≤, ≥ 
C) =, ≤, ≥ 
D) , ≤, ≥ 
E) ≠, =, ≤, ≥ 
A) , = 
B) , =, ≤, ≥ 
C) =, ≤, ≥ 
D) , ≤, ≥ 
E) ≠, =, ≤, ≥

Question 3

What in Excel Solver corresponds to the objective function in the algebraic model?

Accepted Answer

A) Optimization Cell 
B) Target Cell 
C) Changing Cell 
D) Constraint Cell 
E) Parameter Cell 
A) Optimization Cell 
B) Target Cell 
C) Changing Cell 
D) Constraint Cell 
E) Parameter Cell

Question 4

One step in solving optimization problems is to write a problem _______________ in words.

Accepted Answer

The answer of One step in solving optimization problems is...

Question 5

Formulate the following as a linear programming problem.
Jan lives in the country and is having a garage sale tomorrow. She has decided to sell some fresh baked goods in conjunction with the sale. She has excellent recipes for apple pie and for apple turnovers. She has 20.83 pounds of apples. Each pie will require 1.6 pounds of apples and each turnover will require 0.22 pounds of apples. She has discovered that she is short of both flour and sugar and does not want to make another trip to the store tonight. She has 5.7 pounds of flour and 200 grams of sugar. Each pie will require 0.6 pounds of flour and 11 grams of sugar. Each turnover will require .02 pounds of flour and 3 grams of sugar. She will sell pies for $6 each and turnovers for $0.75 each. She has decided to make 8 pies at most, because she is concerned about how well they will sell.

Accepted Answer

Let x1 = number of apple pies

Question 6

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 7

Which of the following statements is correct?

Accepted Answer

A)  Given a Linear Program with a maximization objective, the optimal objective function value  may increase if a ? constraint is added to the program. 
B)  Given a Linear Program with a maximization objective, the optimal objective function value  may increase if a ? constraint is added to the program. 
C)  Given a Linear Program with a minimization objective, the optimal objective function value cannot increase if a ? constraint is added to the program. 
D)  Given a Linear Program with a minimization objective, the optimal objective function value cannot increase if a ? constraint is added to the program. 
E)  Given a Linear Program with a maximization objective, the optimal objective function value may decrease if a ? constraint is added to the program. 
A)  Given a Linear Program with a maximization objective, the optimal objective function value  may increase if a ? constraint is added to the program. 
B)  Given a Linear Program with a maximization objective, the optimal objective function value  may increase if a ? constraint is added to the program. 
C)  Given a Linear Program with a minimization objective, the optimal objective function value cannot increase if a ? constraint is added to the program. 
D)  Given a Linear Program with a minimization objective, the optimal objective function value cannot increase if a ? constraint is added to the program. 
E)  Given a Linear Program with a maximization objective, the optimal objective function value may decrease if a ? constraint is added to the program.

Question 8

In Linear Programming models, over what quantities do you have control?

Accepted Answer

A) decision variables 
B) parameters 
C) constraints 
D) objective variables 
E) coefficients 
A) decision variables 
B) parameters 
C) constraints 
D) objective variables 
E) coefficients

Question 9

How can the following Linear Program be characterized?
 Min X + Y
Subject to
X ? 20
Y ? 5
X + Y ? 40
X, Y ? 0

Accepted Answer

A) bounded and feasible 
B) unbounded and feasible 
C) bounded and infeasible 
D) unbounded and infeasible 
E) this is not a Linear Program 
A) bounded and feasible 
B) unbounded and feasible 
C) bounded and infeasible 
D) unbounded and infeasible 
E) this is not a Linear Program

Question 10

What are the steps involved in solving optimization problems?

Accepted Answer

(1)Understand the problem, perhaps by dr

Question 11

The management at Highly Technical Services (HTS)wants to develop a model that will help allocate technicians' time between service calls to government contract customers, private industry contract customers, and new customers. A maximum of 80 hours of technician time is available over the 2-week planning period. To satisfy cash-flow requirements, at least $1000 in revenue (per technician)must be generated during the 2-week period. Technician time for government customers generates $40 per hour, while time for private industry customers generates $30 per hour, and technician time for new customers only generates an average of $5 per hour because in many cases a new customer contact does not provide billable services. To ensure that the new customer contacts are being maintained, the number of new customer contacts must be at least 45% of the government and private industry contract contacts. For the revenue and policy requirements stated, HTS would like to determine how to allocate technician time between regular customers and new customers in order to maximize the total number of customers contacted during the 2-week period. Technicians require an average of 45 minutes for each contract contact and 1 hour for each new customer contact. Develop a linear programming model that will enable HTS to optimally allocate technician time between regular customers and new customers.

Accepted Answer

Let Xn = the number of hours spent on ne

Question 12

An optimal solution to an optimization problem is always feasible.

Accepted Answer

A) True 
 B)False

Question 13

If the solution to an optimization problem violates two constraints but satisfies three, it is a(an)________.

Accepted Answer

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

Question 14

Sausage and Cheese Ltd. prepares three gift packages containing sausages and cheeses. The "Tasters," "Succulent," and "Gourmet" gift packages contain 3 sausages and 6 cheeses, 5 sausages and 4 cheeses, and 6 sausages and 5 cheeses, respectively. There are 2500 sausages and 3000 cheeses available for packing, and demand is unlimited. Profits are $2.50, $3.50, and $4.00 for the "Tasters," "Succulent," and "Gourmet" gift packages, respectively. The goal is to maximize profits. Let T, S, and G represent the number of gift packages produced of type "Tasters," "Succulent," and "Gourmet," respectively. What is the constraint describing the sausage capacity?

Accepted Answer

A) 2.5T + 3.5S + 4G ≤ 2500 
B) 3T + 5S + 6G ≥ 2500 
C) 9T + 9S + 11G ≤ 2500 
D) 0.8333T + 1.9444S + 2.1818G ≤ 2500 
E) 3T + 5S + 6G ≤ 2500 
A) 2.5T + 3.5S + 4G ≤ 2500 
B) 3T + 5S + 6G ≥ 2500 
C) 9T + 9S + 11G ≤ 2500 
D) 0.8333T + 1.9444S + 2.1818G ≤ 2500 
E) 3T + 5S + 6G ≤ 2500

Question 15

In Linear Programming models, what do you want to do with the objective?

Accepted Answer

A) upsize or downsize 
B) rightsize or wrongsize 
C) maximize or minimize 
D) memorize 
E) popularize 
A) upsize or downsize 
B) rightsize or wrongsize 
C) maximize or minimize 
D) memorize 
E) popularize

Question 16

The Answer Report Target Cell, Adjustable Cell, and Constraint sections all include:

Accepted Answer

A) base value, original value 
B) original value, final value 
C) base value, final value 
D) original value, test value 
E) bounded value, un-bounded value 
A) base value, original value 
B) original value, final value 
C) base value, final value 
D) original value, test value 
E) bounded value, un-bounded value

Question 17

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 18

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

Accepted Answer

A) True 
 B)False

Question 19

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

Accepted Answer

A) (0, 20) 
B) (20, 0) 
C) (10, 10) 
D) (0, 14) 
E) (35, 0) 
A) (0, 20) 
B) (20, 0) 
C) (10, 10) 
D) (0, 14) 
E) (35, 0)

Question 20

A constraint in Excel Solver consists of what three pieces of information?

Accepted Answer

A) Target Cell, relationship operator, and Constraint 
B) Target Cell, Changing Cells, and Constraint 
C) Cell Reference, relationship operator, and Constraint 
D) Cell Reference, Changing Cells, and Constraint 
E) Target Cell, Changing Cells, and Cell Reference 
A) Target Cell, relationship operator, and Constraint 
B) Target Cell, Changing Cells, and Constraint 
C) Cell Reference, relationship operator, and Constraint 
D) Cell Reference, Changing Cells, and Constraint 
E) Target Cell, Changing Cells, and Cell Reference

To retain model flexibility while using Solver you must:

What are the allowable constraint relationship types in optimization problems?

What in Excel Solver corresponds to the objective function in the algebraic model?

One step in solving optimization problems is to write a problem _______________ in words.

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

Which of the following statements is correct?

In Linear Programming models, over what quantities do you have control?

How can the following Linear Program be characterized? Min X + Y Subject to X ? 20 Y ? 5 X + Y ? 40 X, Y ? 0

What are the steps involved in solving optimization problems?

An optimal solution to an optimization problem is always feasible.

If the solution to an optimization problem violates two constraints but satisfies three, it is a(an)________.

In Linear Programming models, what do you want to do with the objective?

The Answer Report Target Cell, Adjustable Cell, and Constraint sections all include:

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

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

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

A constraint in Excel Solver consists of what three pieces of information?

Introduction to Operations Management

Operations Strategy and Competitiveness

Product Design and Process Selection

E-Commerce and 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

Independent Demand 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 17: Spreadsheet Modeling: an Introduction

To retain model flexibility while using Solver you must:

What are the allowable constraint relationship types in optimization problems?

What in Excel Solver corresponds to the objective function in the algebraic model?

One step in solving optimization problems is to write a problem _______________ in words.

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

Which of the following statements is correct?

In Linear Programming models, over what quantities do you have control?

How can the following Linear Program be characterized? Min X + Y Subject to X ? 20 Y ? 5 X + Y ? 40 X, Y ? 0

What are the steps involved in solving optimization problems?

An optimal solution to an optimization problem is always feasible.

If the solution to an optimization problem violates two constraints but satisfies three, it is a(an)________.

In Linear Programming models, what do you want to do with the objective?

The Answer Report Target Cell, Adjustable Cell, and Constraint sections all include:

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

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

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

A constraint in Excel Solver consists of what three pieces of information?

Introduction to Operations Management

Operations Strategy and Competitiveness

Product Design and Process Selection

E-Commerce and 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

Independent Demand Inventory Management

Aggregate Planning

Resource Planning

Scheduling

Project Management

Spreadsheet Modeling: an Introduction

Waiting Line Models

Master Scheduling and Rough-Cut Capacity Planning

Filters