Question 1

One requirement of a linear programming problem is that the objective function must be expressed as a linear equation.

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

Accepted Answer

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

Question 3

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

Accepted Answer

A) True 
 B)False

Question 4

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 not in the feasible region. 
D) The feasible region includes all points that satisfy one constraint,the other,or both. 
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 not in the feasible region. 
D) The feasible region includes all points that satisfy one constraint,the other,or both. 
E) The feasible region cannot be determined without knowing whether the problem is to be minimized or maximized.

Question 5

________ is an analysis that projects how much a solution might change if there were changes in the variables or input data.

Accepted Answer

Sensitivit

Question 6

What is linear programming?

Accepted Answer

Linear programming is a mathem

Question 7

Suppose that the shadow price for assembly time is $5/hour.The allowable increase for the assembly time constraint is 40 hours,and the allowable decrease is 30 hours.If all assembly hours were used under the initial LP solution and workers normally make $4/hour but can work overtime for $6/hour,what should management do?

Accepted Answer

A) do not change available hours for assembly time 
B) decrease available hours for assembly time by 30 hours 
C) increase available hours for assembly time by 40 hours 
D) decrease available hours for assembly time by 5 hours 
E) increase available hours for assembly time by 5 hours 
A) do not change available hours for assembly time 
B) decrease available hours for assembly time by 30 hours 
C) increase available hours for assembly time by 40 hours 
D) decrease available hours for assembly time by 5 hours 
E) increase available hours for assembly time by 5 hours

Question 8

Suppose that the feasible region of a maximization LP problem has corners of (0,0),(10,0),(5,5),and (0,7).If profit is given to be $X + $2Y what is the maximum profit the company can earn?

Accepted Answer

A) $0 
B) $10 
C) $15 
D) $14 
E) $24 
A) $0 
B) $10 
C) $15 
D) $14 
E) $24

Question 9

Which of the following sets of constraints results in an unbounded maximization problem?

Accepted Answer

A) X + Y ≥ 100 and X + Y ≤ 50 
B) X + Y ≥ 15 and X - Y ≤ 10 
C) X + Y ≤ 10 and X ≥ 5 
D) X ≤ 10 and Y ≤ 20 
E) All of the above have a bounded maximum. 
A) X + Y ≥ 100 and X + Y ≤ 50 
B) X + Y ≥ 15 and X - Y ≤ 10 
C) X + Y ≤ 10 and X ≥ 5 
D) X ≤ 10 and Y ≤ 20 
E) All of the above have a bounded maximum.

Question 10

Which of the following is an algorithm for solving linear programming problems of all sizes?

Accepted Answer

A) duplex method 
B) multiplex method 
C) shadow price method 
D) simplex method 
E) decision tree method 
A) duplex method 
B) multiplex method 
C) shadow price method 
D) simplex method 
E) decision tree method

Question 11

A linear programming problem contains a restriction that reads "the quantity of X must be at least three times as large as the quantity of Y." Which of the following inequalities is the proper formulation of this constraint?

Accepted Answer

A) 3X ≥ Y 
B) X ≤ 3Y 
C) X + Y ≥ 3 
D) X - 3Y ≥ 0 
E) 3X ≤ Y 
A) 3X ≥ Y 
B) X ≤ 3Y 
C) X + Y ≥ 3 
D) X - 3Y ≥ 0 
E) 3X ≤ Y

Question 12

Solving a linear programming problem with the iso-profit line solution method requires that we move the iso-profit line to each corner of the feasible region until the optimum is identified.

Accepted Answer

A) True 
 B)False

Question 13

The optimal solution to a linear programming problem lies within the feasible region.

Accepted Answer

A) True 
 B)False

Question 14

What is the simplex method?

Accepted Answer

The simplex method i

Question 15

What is the feasible region in a linear programming problem?

Accepted Answer

The feasible region

Question 16

Using the iso-profit line solution method to solve a maximization problem requires that we:

Accepted Answer

A) find the value of the objective function at the origin. 
B) move the iso-profit line away from the origin until it barely touches some part of the feasible region. 
C) move the iso-cost line to the lowest level that still touches some part of the feasible region. 
D) test the objective function value of every corner point in the feasible region. 
E) none of the above 
A) find the value of the objective function at the origin. 
B) move the iso-profit line away from the origin until it barely touches some part of the feasible region. 
C) move the iso-cost line to the lowest level that still touches some part of the feasible region. 
D) test the objective function value of every corner point in the feasible region. 
E) none of the above

Question 17

An iso-profit line:

Accepted Answer

A) can be used to help solve a profit maximizing linear programming problem. 
B) is parallel to all other iso-profit lines in the same problem. 
C) is a line with the same profit at all points. 
D) all of the above 
E) none of the above 
A) can be used to help solve a profit maximizing linear programming problem. 
B) is parallel to all other iso-profit lines in the same problem. 
C) is a line with the same profit at all points. 
D) all of the above 
E) none of the above

Question 18

A synonym for shadow price is ________.

Accepted Answer

The answer of A synonym for shadow price is ________....

Question 19

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 20

In terms of linear programming,the fact that the solution is infeasible implies that the "profit" can increase without limit.

Accepted Answer

A) True 
 B)False

Exam 23: Linear Programming

One requirement of a linear programming problem is that the objective function must be expressed as a linear equation.

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

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

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?

________ is an analysis that projects how much a solution might change if there were changes in the variables or input data.

What is linear programming?

Suppose that the feasible region of a maximization LP problem has corners of (0,0),(10,0),(5,5),and (0,7).If profit is given to be $X + $2Y what is the maximum profit the company can earn?

Which of the following sets of constraints results in an unbounded maximization problem?

Which of the following is an algorithm for solving linear programming problems of all sizes?

A linear programming problem contains a restriction that reads "the quantity of X must be at least three times as large as the quantity of Y." Which of the following inequalities is the proper formulation of this constraint?

Solving a linear programming problem with the iso-profit line solution method requires that we move the iso-profit line to each corner of the feasible region until the optimum is identified.

The optimal solution to a linear programming problem lies within the feasible region.

What is the simplex method?

What is the feasible region in a linear programming problem?

Using the iso-profit line solution method to solve a maximization problem requires that we:

An iso-profit line:

A synonym for shadow price is ________.

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

In terms of linear programming,the fact that the solution is infeasible implies that the "profit" can increase without limit.

Operations and Productivity

Operations Strategy in a Global Environment

Project Management

Forecasting

Design of Goods and Services

Managing Quality

Process Strategy

Capacity and Constraint Management

Location Strategies

Layout Strategies

Human Resources, job Design, and Work Measurement

Supply Chain Management

Inventory Management

Aggregate Planning and Sop

Material Requirements Planning Mrpand Erp

Short-Term Scheduling

Jit, tps, and Lean Operations

Maintenance and Reliability

Sustainability in the Supply Chain

Statistical Process Control

Supply Chain Management Analytics

Decision-Making Tools

Transportation Models

Waiting-Line Models

Learning Curves

Simulation

Filters