Question 1

The first step in formulating a linear programming problem is

Accepted Answer

A)  Identify any upper or lower bounds on the decision variables. 
B)  State the constraints as linear combinations of the decision variables. 
C)  Understand the problem. 
D)  Identify the decision variables. 
E)  State the objective function as a linear combination of the decision variables. 
A)  Identify any upper or lower bounds on the decision variables. 
B)  State the constraints as linear combinations of the decision variables. 
C)  Understand the problem. 
D)  Identify the decision variables. 
E)  State the objective function as a linear combination of the decision variables.

Question 2

Which of the following fields of management science finds the optimal method of using resources to achieve the objectives of a business?

Accepted Answer

A)  Simulation 
B)  Regression 
C)  Mathematical programming 
D)  Discriminant analysis 
A)  Simulation 
B)  Regression 
C)  Mathematical programming 
D)  Discriminant analysis

Question 3

The Big Bang explosives company produces customized blasting compounds for use in the mining industry. The two ingredients for these explosives are agent A and agent B. Big Bang just received an order for 1400 pounds of explosive. Agent A costs $5 per pound and agent B costs $6 per pound. The customer's mixture must contain at least 20% agent A and at least 50% agent B. The company wants to provide the least expensive mixture which will satisfy the customers requirements.
a.
Formulate the LP model for this problem.
b.
Solve the problem using the graphical method.

Accepted Answer

The answer of The Big Bang explosives company produces customized...

Question 4

A common objective when manufacturing printed circuit boards is

Accepted Answer

A)  maximizing the number of holes drilled. 
B)  maximizing the number of drill bit changes. 
C)  minimizing the number of holes drilled. 
D)  minimizing the total distance the drill bit must be moved. 
A)  maximizing the number of holes drilled. 
B)  maximizing the number of drill bit changes. 
C)  minimizing the number of holes drilled. 
D)  minimizing the total distance the drill bit must be moved.

Question 5

The Byte computer company produces two models of computers, Plain and Fancy. It wants to plan how many computers to produce next month to maximize profits. Producing these computers requires wiring, assembly and inspection time. Each computer produces a certain level of profits but faces a limited demand. There are a limited number of wiring, assembly and inspection hours available next month. The data for this problem is summarized in the following table.
 $\begin{array} { l c c c c c } 
&&\text { Maximum } &&\text { Assembly }&\text { Inspection } \
\text { Computer } &\text { Profit per }&\text { demand for }&\text { Wiring Hours }  &\text { Hours } &\text { Hours }  \
\text { Model }&\text { Model (\$)}&\text { product }&\text { Required }&\text { Required }&\text { Required }\
\hline \text { Plain } & 30 & 80 & .4 & .5 & .2 \
\text { Fancy } & 40 & 90 & .5 & .4 & .3 \
\hline & & \text { Hours Available } & 50 & 50 & 22
\end{array}$
 
a.
Formulate the LP model for this problem.
b.
Solve the problem using the graphical method.

Accepted Answer

The answer of The Byte computer company produces two models...

Question 6

Solve the following LP problem graphically using level curves.
 $$\begin{array} { l l } 
\text { MAX: } & 5 X _ { 1 } + 3 X _ { 2 } \
\text { Subject to: } & 2 X _ { 1 } - 1 X _ { 2 } \leq 2 \
& 6 X _ { 1 } + 6 X _ { 2 } \geq 12 \
& 1 X _ { 1 } + 3 X _ { 2 } \leq 5 \
& X _ { 1 } X _ { 2 } \geq 0
\end{array}$$

Accepted Answer

Obj = 11.2

Question 7

When do alternate optimal solutions occur in LP models?

Accepted Answer

A)  When a binding constraint is parallel to a level curve. 
B)  When a non-binding constraint is perpendicular to a level curve. 
C)  When a constraint is parallel to another constraint. 
D)  Alternate optimal solutions indicate an infeasible condition. 
A)  When a binding constraint is parallel to a level curve. 
B)  When a non-binding constraint is perpendicular to a level curve. 
C)  When a constraint is parallel to another constraint. 
D)  Alternate optimal solutions indicate an infeasible condition.

Question 8

The following linear programming problem has been written to plan the production of two products. The company wants to maximize its profits. X1 = number of product 1 produced in each batch
X2 = number of product 2 produced in each batch
$$\begin{array} { l l } 
\text { MAX: } & 150 X _ { 1 } + 250 X _ { 2 } \
\text { Subject to: } & 2 X _ { 1 } + 5 X _ { 2 } \leq 200 - \text { resource 1 } \
& 3 X _ { 1 } + 7 X _ { 2 } \leq 175 - \text { resource } 2 \
& X _ { 1 } , X _ { 2 } \geq 0
\end{array}$$ How many units of resource 1 are consumed by each unit of product 1 produced?

Accepted Answer

A)  1 
B)  2 
C)  3 
D)  5 
A)  1 
B)  2 
C)  3 
D)  5

Question 9

Why do we study the graphical method of solving LP problems?

Accepted Answer

A)  Lines are easy to draw on paper. 
B)  To develop an understanding of the linear programming strategy. 
C)  It is faster than computerized methods. 
D)  It provides better solutions than computerized methods. 
A)  Lines are easy to draw on paper. 
B)  To develop an understanding of the linear programming strategy. 
C)  It is faster than computerized methods. 
D)  It provides better solutions than computerized methods.

Question 10

Solve the following LP problem graphically using level curves.
 MIN: $\quad 8 \mathrm { X } _ { 1 } + 12 \mathrm { X } _ { 2 }$
Subject to:
$$\begin{array} { l } 
2 \mathrm { X } _ { 1 } + 1 \mathrm { X } _ { 2 } \geq 16 \
2 \mathrm { X } _ { 1 } + 3 \mathrm { X } _ { 2 } \geq 36 \
7 \mathrm { X } _ { 1 } + 8 \mathrm { X } _ { 2 } \geq 112 \
\mathrm { X } _ { 1 } , \mathrm { X } _ { 2 } \geq 0
\end{array}$$

Accepted Answer

Alternate optima sol

Question 11

Linear programming problems have

Accepted Answer

A)  linear objective functions, non-linear constraints. 
B)  non-linear objective functions, non-linear constraints. 
C)  non-linear objective functions, linear constraints. 
D)  linear objective functions, linear constraints. 
A)  linear objective functions, non-linear constraints. 
B)  non-linear objective functions, non-linear constraints. 
C)  non-linear objective functions, linear constraints. 
D)  linear objective functions, linear constraints.

Question 12

A common objective in the product mix problem is

Accepted Answer

A)  maximizing cost. 
B)  maximizing profit. 
C)  minimizing production time. 
D)  maximizing production volume. 
A)  maximizing cost. 
B)  maximizing profit. 
C)  minimizing production time. 
D)  maximizing production volume.

Question 13

The constraint for resource 1 is 5 X1 + 4 X2 $\ge$200. If X2 = 20, what it the minimum value for X1?

Accepted Answer

A)  20 
B)  24 
C)  40 
D)  50 
A)  20 
B)  24 
C)  40 
D)  50

Question 14

Level curves are used when solving LP models using the graphical method. To what part of the model do level curves relate?

Accepted Answer

A)  constraints 
B)  boundaries 
C)  right hand sides 
D)  objective function 
A)  constraints 
B)  boundaries 
C)  right hand sides 
D)  objective function

Question 15

If constraints are added to an LP model the feasible solution space will generally

Accepted Answer

A)  decrease. 
B)  increase. 
C)  remain the same. 
D)  become more feasible. 
A)  decrease. 
B)  increase. 
C)  remain the same. 
D)  become more feasible.

Question 16

Which of the following is the general format of an objective function?

Accepted Answer

A)  f(X1, X2, ..., Xn) $\le$ b 
B)  f(X1, X2, ..., Xn) $\ge$ b 
C)  f(X1, X2, ..., Xn) = b 
D)  f(X1, X2, ..., Xn) 
A)  f(X1, X2, ..., Xn) $\le$ b 
B)  f(X1, X2, ..., Xn) $\ge$ b 
C)  f(X1, X2, ..., Xn) = b 
D)  f(X1, X2, ..., Xn)

Question 17

Mathematical programming is referred to as

Accepted Answer

A)  optimization. 
B)  satisficing. 
C)  approximation. 
D)  simulation. 
A)  optimization. 
B)  satisficing. 
C)  approximation. 
D)  simulation.

Question 18

The constraint for resource 1 is 5 X1 + 4 X2 $\le$ 200. If X1 = 20, what it the maximum value for X2?

Accepted Answer

A)  20 
B)  25 
C)  40 
D)  50 
A)  20 
B)  25 
C)  40 
D)  50

Question 19

A set of values for the decision variables that satisfy all the constraints and yields the best objective function value is

Accepted Answer

A)  a feasible solution. 
B)  an optimal solution. 
C)  a corner point solution. 
D)  both (a) and (c). 
A)  a feasible solution. 
B)  an optimal solution. 
C)  a corner point solution. 
D)  both (a) and (c).

Question 20

What is the goal in optimization?

Accepted Answer

A)  Find the decision variable values that result in the best objective function and satisfy all constraints. 
B)  Find the values of the decision variables that use all available resources. 
C)  Find the values of the decision variables that satisfy all constraints. 
D)  None of these. 
A)  Find the decision variable values that result in the best objective function and satisfy all constraints. 
B)  Find the values of the decision variables that use all available resources. 
C)  Find the values of the decision variables that satisfy all constraints. 
D)  None of these.

The first step in formulating a linear programming problem is

Which of the following fields of management science finds the optimal method of using resources to achieve the objectives of a business?

A common objective when manufacturing printed circuit boards is

Solve the following LP problem graphically using level curves. MAX: 5+3 Subject to: 2-1\leq2 6+6\geq12 1+3\leq5 \geq0

When do alternate optimal solutions occur in LP models?

Why do we study the graphical method of solving LP problems?

Solve the following LP problem graphically using level curves. MIN: $\quad 8 \mathrm { X } _ { 1 } + 12 \mathrm { X } _ { 2 }$ Subject to: 2+1\geq16 2+3\geq36 7+8\geq112 ,\geq0

Linear programming problems have

A common objective in the product mix problem is

The constraint for resource 1 is 5 X₁ + 4 X₂ $\ge$ 200. If X₂ = 20, what it the minimum value for X₁?

Level curves are used when solving LP models using the graphical method. To what part of the model do level curves relate?

If constraints are added to an LP model the feasible solution space will generally

Which of the following is the general format of an objective function?

Mathematical programming is referred to as

The constraint for resource 1 is 5 X₁ + 4 X₂ $\le$ 200. If X₁ = 20, what it the maximum value for X₂?

A set of values for the decision variables that satisfy all the constraints and yields the best objective function value is

What is the goal in optimization?

Introduction to Modeling and Decision Analysis

Modeling and Solving Lp Problems in a Spreadsheet

Sensitivity Analysis and the Simplex Method

Network Modeling

Integer Linear Programming

Goal Programming and Multiple Objective Optimization

Nonlinear Programming and Evolutionary Optimization

Regression Analysis

Discriminant Analysis

Time Series Forecasting

Introduction to Simulation Using Risk Solver Platform

Queuing Theory

Decision Analysis

Project Management Online

Filters

Exam 2: Introduction to Optimization and Linear Programming

The first step in formulating a linear programming problem is

Which of the following fields of management science finds the optimal method of using resources to achieve the objectives of a business?

A common objective when manufacturing printed circuit boards is

Solve the following LP problem graphically using level curves. MAX: 5+3 Subject to: 2-1\leq2 6+6\geq12 1+3\leq5 \geq0

When do alternate optimal solutions occur in LP models?

Why do we study the graphical method of solving LP problems?

Solve the following LP problem graphically using level curves. MIN: 8X1+12X2\quad 8 \mathrm { X } _ { 1 } + 12 \mathrm { X } _ { 2 }8X1​+12X2​ Subject to: 2+1\geq16 2+3\geq36 7+8\geq112 ,\geq0

Linear programming problems have

A common objective in the product mix problem is

The constraint for resource 1 is 5 X1 + 4 X2 ≥\ge≥ 200. If X2 = 20, what it the minimum value for X1?

Level curves are used when solving LP models using the graphical method. To what part of the model do level curves relate?

If constraints are added to an LP model the feasible solution space will generally

Which of the following is the general format of an objective function?

Mathematical programming is referred to as

The constraint for resource 1 is 5 X1 + 4 X2 ≤\le≤ 200. If X1 = 20, what it the maximum value for X2?

A set of values for the decision variables that satisfy all the constraints and yields the best objective function value is

What is the goal in optimization?

Introduction to Modeling and Decision Analysis

Modeling and Solving Lp Problems in a Spreadsheet

Sensitivity Analysis and the Simplex Method

Network Modeling

Integer Linear Programming

Goal Programming and Multiple Objective Optimization

Nonlinear Programming and Evolutionary Optimization

Regression Analysis

Discriminant Analysis

Time Series Forecasting

Introduction to Simulation Using Risk Solver Platform

Queuing Theory

Decision Analysis

Project Management Online

Filters

Solve the following LP problem graphically using level curves. MIN: $\quad 8 \mathrm { X } _ { 1 } + 12 \mathrm { X } _ { 2 }$ Subject to: 2+1\geq16 2+3\geq36 7+8\geq112 ,\geq0

The constraint for resource 1 is 5 X₁ + 4 X₂ $\ge$ 200. If X₂ = 20, what it the minimum value for X₁?

The constraint for resource 1 is 5 X₁ + 4 X₂ $\le$ 200. If X₁ = 20, what it the maximum value for X₂?