Question 1

In linear programming, a statement such as "maximize contribution" becomes a constraint when the problem is formulated.

Accepted Answer

A) True 
 B)False

Question 2

For the following constraints, which point is in the feasible region of this minimization problem? (1) 14x + 6y ≥ 42 (2) x - y ≥ 5

Accepted Answer

A)  x = -1, y = 1 
B)  x = 0, y = 4 
C)  x = 2, y = 1 
D)  x = 5, y = 1 
E)  x = 6, y = 0 
A)  x = -1, y = 1 
B)  x = 0, y = 4 
C)  x = 2, y = 1 
D)  x = 5, y = 1 
E)  x = 6, y = 0

Question 3

Two methods of solving linear programming problems by hand include the corner-point method and the ________.

Accepted Answer

iso-profit

Question 4

Riker Co. is considering which of 4 different projects to undertake in order to maximize its net present value (NPV). Define Xi as a binary variable that equals 1 if project i is undertaken and 0 otherwise, for i = 1, 2, 3, 4. The NPV and required capital (in millions) for each project are listed below.   Which of the following represents the constraint(s) stating that project 1 must be undertaken and at least one of the other projects must be undertaken?

Accepted Answer

A)  X1 + X2 ≤ 1, and X1 + X3 ≤ 1, and X1 + X4 ≤ 1 
B)  X1 ≥1, and X2 + X3 + X4 ≥ 1 
C)  X1 + X2 ≥ 1, and X1 + X3 ≥ 1, and X1 + X4 ≥ 1 
D)  X1 ≥ 1, and X2 + X3 + X4 ≤ 3 
E)  X1 + X2 + X3 + X4 ≥= 2 
A)  X1 + X2 ≤ 1, and X1 + X3 ≤ 1, and X1 + X4 ≤ 1 
B)  X1 ≥1, and X2 + X3 + X4 ≥ 1 
C)  X1 + X2 ≥ 1, and X1 + X3 ≥ 1, and X1 + X4 ≥ 1 
D)  X1 ≥ 1, and X2 + X3 + X4 ≤ 3 
E)  X1 + X2 + X3 + X4 ≥= 2

Question 5

What is the region that satisfies all of the constraints in linear programming called?

Accepted Answer

A)  area of optimal solutions 
B)  area of feasible solutions 
C)  profit maximization space 
D)  region of optimality 
E)  region of non-negativity 
A)  area of optimal solutions 
B)  area of feasible solutions 
C)  profit maximization space 
D)  region of optimality 
E)  region of non-negativity

Question 6

Explain how to use the iso-profit line in a graphical solution to maximization problem.

Accepted Answer

The iso-profit line is moved up in a max

Question 7

Riker Co. is considering which of 4 different projects to undertake in order to maximize its net present value (NPV). Define Xi as a binary variable that equals 1 if project i is undertaken and 0 otherwise, for i = 1, 2, 3, 4. The NPV and required capital (in millions) for each project are listed below.   What is the proper objective function?

Accepted Answer

A)  Max X1 + X2 + X3 + X4 
B)  Min 60X1 + 50X2 + 40X3 + 20X4 
C)  Max 60X1 + 50X2 + 40X3 + 20X4 
D)  Max 7X1 + 10X2 + 6X3 + 3X4 
E)  Max 170(X1 + X2 + X3 + X4) 
A)  Max X1 + X2 + X3 + X4 
B)  Min 60X1 + 50X2 + 40X3 + 20X4 
C)  Max 60X1 + 50X2 + 40X3 + 20X4 
D)  Max 7X1 + 10X2 + 6X3 + 3X4 
E)  Max 170(X1 + X2 + X3 + X4)

Question 8

The property manager of a city government issues chairs, desks, and other office furniture to city buildings from a centralized distribution center. Like most government agencies, it operates to minimize its costs of operations. In this distribution center, there are two types of standard office chairs, Model A and Model B. Model A is considerably heavier than Model B, and costs $20 per chair to transport to any city building; each model B costs $14 to transport. The distribution center has on hand 400 chairs-200 each of A and B.
The requirements for shipments to each of the city's buildings are as follows:
Building 1 needs at least 100 of A
Building 2 needs at least 150 of B.
Building 3 needs at least 100 chairs, but they can be of either type, mixed.
Building 4 needs 40 chairs, but at least as many B as A.
Formulate this problem as a linear program.

Accepted Answer

Let the variables be A1, A2, A3, and A4

Question 9

Linear programming is an appropriate problem-solving technique for decisions that have no alternative courses of action.

Accepted Answer

A) True 
 B)False

Question 10

The feasible region in the diagram below is consistent with which one of the following constraints?

Accepted Answer

A)  8X1 + 4X2 ≤ 160 
B)  8X1 + 4X2 ≥ 160 
C)  4X1 + 8X2 ≤ 160 
D)  8X1 - 4X2 ≤ 160 
E)  4X1 - 8X2 ≤ 160 
A)  8X1 + 4X2 ≤ 160 
B)  8X1 + 4X2 ≥ 160 
C)  4X1 + 8X2 ≤ 160 
D)  8X1 - 4X2 ≤ 160 
E)  4X1 - 8X2 ≤ 160

Question 11

What is the simplex method?

Accepted Answer

The simplex method i

Question 12

In linear programming, if there are three constraints, each representing a resource that can be used up, the optimal solution may not use up all of each of the three resources.

Accepted Answer

A) True 
 B)False

Question 13

________ are restrictions that limit the degree to which a manager can pursue an objective.

Accepted Answer

The answer of ________ are restrictions that limit the degree...

Question 14

Computer software provides a simple way to guarantee only integer solutions to linear programming problems.

Accepted Answer

A) True 
 B)False

Question 15

A linear programming problem contains a restriction that reads "the quantity of Q must be no smaller than the sum of R, S, and T." Formulate this as a linear programming constraint.

Accepted Answer

A)  Q + R + S + T ≤ 4 
B)  Q ≥ R + S + T 
C)  Q - R - S - T ≤ 0 
D)  Q / (R + S + T) ≤ 0 
E)  Q ≤ R + Q ≤ S + Q ≤ T 
A)  Q + R + S + T ≤ 4 
B)  Q ≥ R + S + T 
C)  Q - R - S - T ≤ 0 
D)  Q / (R + S + T) ≤ 0 
E)  Q ≤ R + Q ≤ S + Q ≤ T

Question 16

A linear programming problem contains a restriction that reads "the quantity of Q must be at most as large as the sum of R, S, and T." Formulate this as a linear programming constraint.

Accepted Answer

Q ≤ R + S

Question 17

A linear programming problem has two constraints 2X + 4Y ≥ 100 and 1X + 8Y ≤ 100, plus nonnegativity constraints on X and Y. Which of the following statements about its feasible region is TRUE?

Accepted Answer

A)  There are four corner points including (50, 0) and (0, 12.5). 
B)  The two corner points are (0, 0) and (50, 12.5). 
C)  The graphical origin (0, 0) is in the feasible region. 
D)  The feasible region is triangular in shape, bounded by (50, 0), (33.3333, 8.3333), and (100, 0). 
E)  The feasible region cannot be determined without knowing whether the problem is to be minimized or maximized. 
A)  There are four corner points including (50, 0) and (0, 12.5). 
B)  The two corner points are (0, 0) and (50, 12.5). 
C)  The graphical origin (0, 0) is in the feasible region. 
D)  The feasible region is triangular in shape, bounded by (50, 0), (33.3333, 8.3333), and (100, 0). 
E)  The feasible region cannot be determined without knowing whether the problem is to be minimized or maximized.

Question 18

What combination of a and b will yield the optimum for this problem? Maximize $6a + $15b, subject to (1) 4a + 2b ≤ 16 and (2) 5a + 2b ≤ 20 and (3) a, b ≥ 0.

Accepted Answer

A)  a = 0, b = 0 
B)  a = 3, b = 3 
C)  a = 0, b = 6 
D)  a = 6, b = 0 
E)  a = 0, b = 8 
A)  a = 0, b = 0 
B)  a = 3, b = 3 
C)  a = 0, b = 6 
D)  a = 6, b = 0 
E)  a = 0, b = 8

Question 19

A stereo mail order center has 9,000 cubic feet available for storage of its private label loudspeakers. The ZAR3 speakers cost $255 each and require 6 cubic feet of space; the ZAR2ax speakers cost $120 each and require 3 cubic feet of space; and the ZAR4 model costs $60 and requires 1 cubic foot of space. The demand for the ZAR3 is at most 30 units per month. The wholesaler has $100,000 to spend on loudspeakers this month. Each ZAR3 contributes $125, each ZAR2ax contributes $55, and each ZAR4 contributes $25. The objective is to maximize total contribution. Formulate this problem as a linear program.

Accepted Answer

Maximize contribution = 125 ZA

Question 20

A linear programming problem contains a restriction that reads "the quantity of S must be no more than one-fourth as large as T and U combined." Formulate this as a linear programming constraint.

Accepted Answer

S ≤ .25 T + .25U; al

In linear programming, a statement such as "maximize contribution" becomes a constraint when the problem is formulated.

For the following constraints, which point is in the feasible region of this minimization problem? (1) 14x + 6y ≥ 42 (2) x - y ≥ 5

Two methods of solving linear programming problems by hand include the corner-point method and the ________.

What is the region that satisfies all of the constraints in linear programming called?

Explain how to use the iso-profit line in a graphical solution to maximization problem.

Linear programming is an appropriate problem-solving technique for decisions that have no alternative courses of action.

The feasible region in the diagram below is consistent with which one of the following constraints?

What is the simplex method?

In linear programming, if there are three constraints, each representing a resource that can be used up, the optimal solution may not use up all of each of the three resources.

________ are restrictions that limit the degree to which a manager can pursue an objective.

Computer software provides a simple way to guarantee only integer solutions to linear programming problems.

A linear programming problem contains a restriction that reads "the quantity of Q must be no smaller than the sum of R, S, and T." Formulate this as a linear programming constraint.

A linear programming problem contains a restriction that reads "the quantity of Q must be at most as large as the sum of R, S, and T." Formulate this as a linear programming constraint.

A linear programming problem has two constraints 2X + 4Y ≥ 100 and 1X + 8Y ≤ 100, plus nonnegativity constraints on X and Y. Which of the following statements about its feasible region is TRUE?

What combination of a and b will yield the optimum for this problem? Maximize $6a + $15b, subject to (1) 4a + 2b ≤ 16 and (2) 5a + 2b ≤ 20 and (3) a, b ≥ 0.

A linear programming problem contains a restriction that reads "the quantity of S must be no more than one-fourth as large as T and U combined." Formulate this as a linear programming constraint.

Operations and Productivity

Operations Strategy in a Global Environment

Project Management

Forecasting

Design of Goods and Services

Managing Quality

Process Strategies

Location Strategies

Human Resources, Job Design, and Work Measurement

Supply Chain Management

Inventory Management

Aggregate Planning and Sop

Material Requirements Planning Mrp and Erp

Short-Term Scheduling

Lean Operations

Maintenance and Reliability

Decision-Making Tools

Transportation Models

Waiting-Line Models

Learning Curves

Simulation

Applying Analytics to Big Data in Operations Management

Filters

Exam 18: Linear Programming

In linear programming, a statement such as "maximize contribution" becomes a constraint when the problem is formulated.

For the following constraints, which point is in the feasible region of this minimization problem? (1) 14x + 6y ≥ 42 (2) x - y ≥ 5

Two methods of solving linear programming problems by hand include the corner-point method and the ________.

What is the region that satisfies all of the constraints in linear programming called?

Explain how to use the iso-profit line in a graphical solution to maximization problem.

Linear programming is an appropriate problem-solving technique for decisions that have no alternative courses of action.

The feasible region in the diagram below is consistent with which one of the following constraints?

What is the simplex method?

In linear programming, if there are three constraints, each representing a resource that can be used up, the optimal solution may not use up all of each of the three resources.

________ are restrictions that limit the degree to which a manager can pursue an objective.

Computer software provides a simple way to guarantee only integer solutions to linear programming problems.

A linear programming problem contains a restriction that reads "the quantity of Q must be no smaller than the sum of R, S, and T." Formulate this as a linear programming constraint.

A linear programming problem contains a restriction that reads "the quantity of Q must be at most as large as the sum of R, S, and T." Formulate this as a linear programming constraint.

A linear programming problem has two constraints 2X + 4Y ≥ 100 and 1X + 8Y ≤ 100, plus nonnegativity constraints on X and Y. Which of the following statements about its feasible region is TRUE?

What combination of a and b will yield the optimum for this problem? Maximize $6a + $15b, subject to (1) 4a + 2b ≤ 16 and (2) 5a + 2b ≤ 20 and (3) a, b ≥ 0.

A linear programming problem contains a restriction that reads "the quantity of S must be no more than one-fourth as large as T and U combined." Formulate this as a linear programming constraint.

Operations and Productivity

Operations Strategy in a Global Environment

Project Management

Forecasting

Design of Goods and Services

Managing Quality

Process Strategies

Location Strategies

Human Resources, Job Design, and Work Measurement

Supply Chain Management

Inventory Management

Aggregate Planning and Sop

Material Requirements Planning Mrp and Erp

Short-Term Scheduling

Lean Operations

Maintenance and Reliability

Decision-Making Tools

Transportation Models

Waiting-Line Models

Learning Curves

Simulation

Applying Analytics to Big Data in Operations Management

Filters