Question 1

The constraint for resource 1 is 5 X1 + 4 X2 ≤ 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 2

Solve the following LP problem graphically by enumerating the corner points.

Accepted Answer

Obj = 50.

Question 3

Solve the following LP problem graphically using level curves.

Accepted Answer

Alternate optima solutions exi

Question 4

The constraint for resource 1 is 5 X1 + 4 X2 ≤ 200. If X1 = 20 and X2 = 5, how much of resource 1 is unused?

Accepted Answer

A)  0 
B)  80 
C)  100 
D)  200 
A)  0 
B)  80 
C)  100 
D)  200

Question 5

​An extreme point of the feasible region can include negative values of coordinates.

Accepted Answer

A) True 
 B)False

Question 6

The symbols X1, Z1, Dog are all examples of

Accepted Answer

A)  decision variables. 
B)  constraints. 
C)  objectives. 
D)  parameters. 
A)  decision variables. 
B)  constraints. 
C)  objectives. 
D)  parameters.

Question 7

Mathematical programming is an approach that involves determining how to allocate the resources in such a way as to maximize profits or minimize costs.

Accepted Answer

A) True 
 B)False

Question 8

If a problem has infinite number solutions, the objective function

Accepted Answer

A)  is parallel to one of the binding constraints. 
B)  goes through exactly one corner point of the feasible region. 
C)  cannot identify a feasible region. 
D)  is infeasible. 
A)  is parallel to one of the binding constraints. 
B)  goes through exactly one corner point of the feasible region. 
C)  cannot identify a feasible region. 
D)  is infeasible.

Question 9

The decisions in an optimization problem are often represented in a mathematical model by the symbols X1, X2, …, Xn.

Accepted Answer

A) True 
 B)False

Question 10

​The objective function coefficients represent per unit objective function contributions from one unit of the associated decision variables.

Accepted Answer

A) True 
 B)False

Question 11

A production optimization problem has 4 decision variables and resource 1 limits how many of the 4 products can be produced. Which of the following constraints reflects this fact?

Accepted Answer

A)  f(X1, X2, X3, X4) ≤ b1 
B)  f(X1, X2, X3, X4) ≥ b1 
C)  f(X1, X2, X3, X4) = b1 
D)  f(X1, X2, X3, X4) ≠ b1 
A)  f(X1, X2, X3, X4) ≤ b1 
B)  f(X1, X2, X3, X4) ≥ b1 
C)  f(X1, X2, X3, X4) = b1 
D)  f(X1, X2, X3, X4) ≠ b1

Question 12

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   How much profit is earned per each unit of product 2 produced?

Accepted Answer

A)  150 
B)  175 
C)  200 
D)  250 
A)  150 
B)  175 
C)  200 
D)  250

Question 13

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   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 14

Retail companies try to find

Accepted Answer

A)  the least costly method of transferring goods from warehouses to stores. 
B)  the most costly method of transferring goods from warehouses to stores. 
C)  the largest number of goods to transfer from warehouses to stores. 
D)  the least profitable method of transferring goods from warehouses to stores. 
A)  the least costly method of transferring goods from warehouses to stores. 
B)  the most costly method of transferring goods from warehouses to stores. 
C)  the largest number of goods to transfer from warehouses to stores. 
D)  the least profitable method of transferring goods from warehouses to stores.

Question 15

​The first step in formulating an LP model is determining the decision variables.

Accepted Answer

A) True 
 B)False

Question 16

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 17

The constraint for resource 1 is 5 X1 + 4 X2 ≥ 200. If X1 = 40 and X2 = 20, how many additional units, if any, of resource 1 are employed above the minimum of 200?

Accepted Answer

A)  0 
B)  20 
C)  40 
D)  80 
A)  0 
B)  20 
C)  40 
D)  80

Question 18

Suppose that a constraint 2x1+3x2 ≥ 900 is binding. Then, a constraint 4x1+6x2 ≥ 600 is

Accepted Answer

A)  redundant. 
B)  binding. 
C)  limiting. 
D)  infeasible. 
A)  redundant. 
B)  binding. 
C)  limiting. 
D)  infeasible.

Question 19

Which of the following actions would expand the feasible region of an LP model?

Accepted Answer

A)  Loosening the constraints. 
B)  Tightening the constraints. 
C)  Multiplying each constraint by 2. 
D)  Adding an additional constraint. 
A)  Loosening the constraints. 
B)  Tightening the constraints. 
C)  Multiplying each constraint by 2. 
D)  Adding an additional constraint.

Question 20

Which of the following fields of business analytics 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

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

Solve the following LP problem graphically by enumerating the corner points.

Solve the following LP problem graphically using level curves.

The constraint for resource 1 is 5 X₁ + 4 X₂ ≤ 200. If X₁ = 20 and X₂ = 5, how much of resource 1 is unused?

An extreme point of the feasible region can include negative values of coordinates.

The symbols X₁, Z₁, Dog are all examples of

Mathematical programming is an approach that involves determining how to allocate the resources in such a way as to maximize profits or minimize costs.

If a problem has infinite number solutions, the objective function

The decisions in an optimization problem are often represented in a mathematical model by the symbols X1, X2, …, Xn.

The objective function coefficients represent per unit objective function contributions from one unit of the associated decision variables.

A production optimization problem has 4 decision variables and resource 1 limits how many of the 4 products can be produced. Which of the following constraints reflects this fact?

Retail companies try to find

The first step in formulating an LP model is determining the decision variables.

A common objective when manufacturing printed circuit boards is

The constraint for resource 1 is 5 X₁ + 4 X₂ ≥ 200. If X₁ = 40 and X₂ = 20, how many additional units, if any, of resource 1 are employed above the minimum of 200?

Suppose that a constraint 2x₁+3x₂ ≥ 900 is binding. Then, a constraint 4x₁+6x₂ ≥ 600 is

Which of the following actions would expand the feasible region of an LP model?

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

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 Evolutionary Optimization

Regression Analysis

Data Mining

Time Series Forecasting

Introduction to Simulation Using Analytic Solver Platform

Queuing Theory

Decision Analysis

Project Management Online

Filters

Exam 2: Introduction to Optimization and Linear Programming

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

Solve the following LP problem graphically by enumerating the corner points.

Solve the following LP problem graphically using level curves.

The constraint for resource 1 is 5 X1 + 4 X2 ≤ 200. If X1 = 20 and X2 = 5, how much of resource 1 is unused?

​An extreme point of the feasible region can include negative values of coordinates.

The symbols X1, Z1, Dog are all examples of

Mathematical programming is an approach that involves determining how to allocate the resources in such a way as to maximize profits or minimize costs.

If a problem has infinite number solutions, the objective function

The decisions in an optimization problem are often represented in a mathematical model by the symbols X1, X2, …, Xn.

​The objective function coefficients represent per unit objective function contributions from one unit of the associated decision variables.

A production optimization problem has 4 decision variables and resource 1 limits how many of the 4 products can be produced. Which of the following constraints reflects this fact?

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 How much profit is earned per each unit of product 2 produced?

Retail companies try to find

​The first step in formulating an LP model is determining the decision variables.

A common objective when manufacturing printed circuit boards is

The constraint for resource 1 is 5 X1 + 4 X2 ≥ 200. If X1 = 40 and X2 = 20, how many additional units, if any, of resource 1 are employed above the minimum of 200?

Suppose that a constraint 2x1+3x2 ≥ 900 is binding. Then, a constraint 4x1+6x2 ≥ 600 is

Which of the following actions would expand the feasible region of an LP model?

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

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 Evolutionary Optimization

Regression Analysis

Data Mining

Time Series Forecasting

Introduction to Simulation Using Analytic Solver Platform

Queuing Theory

Decision Analysis

Project Management Online

Filters

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

The constraint for resource 1 is 5 X₁ + 4 X₂ ≤ 200. If X₁ = 20 and X₂ = 5, how much of resource 1 is unused?

An extreme point of the feasible region can include negative values of coordinates.

The symbols X₁, Z₁, Dog are all examples of

The objective function coefficients represent per unit objective function contributions from one unit of the associated decision variables.

The first step in formulating an LP model is determining the decision variables.

The constraint for resource 1 is 5 X₁ + 4 X₂ ≥ 200. If X₁ = 40 and X₂ = 20, how many additional units, if any, of resource 1 are employed above the minimum of 200?

Suppose that a constraint 2x₁+3x₂ ≥ 900 is binding. Then, a constraint 4x₁+6x₂ ≥ 600 is