Question 1

Given the following 2 constraints,which solution is a feasible solution for a maximization problem?

Accepted Answer

A) (x1,x2 )= (1,5) 
B) (x1,x2 )= (5,1) 
C) (x1,x2 )= (4,4) 
D) (x1,x2 )= (2,1) 
E) (x1,x2 )= (2,6) 
A) (x1,x2 )= (1,5) 
B) (x1,x2 )= (5,1) 
C) (x1,x2 )= (4,4) 
D) (x1,x2 )= (2,1) 
E) (x1,x2 )= (2,6) D

Question 2

The graphical method can handle problems that involve any number of decision variables

Accepted Answer

A) True 
 B)False  False

Question 3

A manager should know the following things about linear programming

Accepted Answer

A) What it is 
B) When it should be used 
C) When it should not be used 
D) How to interpret the results of a study 
E) All of the above 
A) What it is 
B) When it should be used 
C) When it should not be used 
D) How to interpret the results of a study 
E) All of the above E

Question 4

Given the following 2 constraints,which solution is a feasible solution for a minimization problem?

Accepted Answer

A) (x1 ,x2 )= (0 5,5) 
B) (x1 ,x2 )= (0,4) 
C) (x1 ,x2 )= (2,5) 
D) (x1 ,x2 )= (1,2) 
E) (x1 ,x2 )= (2,1) 
A) (x1 ,x2 )= (0 5,5) 
B) (x1 ,x2 )= (0,4) 
C) (x1 ,x2 )= (2,5) 
D) (x1 ,x2 )= (1,2) 
E) (x1 ,x2 )= (2,1)

Question 5

Which objective function has the same slope as this one: 4x + 2y = 20

Accepted Answer

A) 2x +4y = 20 
B) 2x - 4y = 20 
C) 4x - 2y = 20 
D) 8x + 8y = 20 
E) 4x + 2y = 10 
A) 2x +4y = 20 
B) 2x - 4y = 20 
C) 4x - 2y = 20 
D) 8x + 8y = 20 
E) 4x + 2y = 10

Question 6

The equation 5x + 7y = 10 is linear

Accepted Answer

A) True 
 B)False

Question 7

The operations manager for the Blue Moon Brewing Co. produces two beers: Lite (L) and Dark (D). He can only get 675 gallons of malt extract per day for brewing and his brewing hours are limited to 8 hours per day. To produce a keg of Lite beer requires 2 minutes of time and 5 gallons of malt extract. Each keg of Dark beer needs 4 minutes of time and 3 gallons of malt extract. Profits for Lite beer are $3.00 per keg and profits for Dark beer are $2.00 per keg.
-Which of the following is not a feasible solution?

Accepted Answer

A) (L,
D) = (0,0) 
B) (L,
D) = (0,120) 
C) (L,
D) = (90,75) 
D) (L,
D) = (135,0) 
E) (L,
D) = (135,120) 
A) (L,
D) = (0,0) 
B) (L,
D) = (0,120) 
C) (L,
D) = (90,75) 
D) (L,
D) = (135,0) 
E) (L,
D) = (135,120)

Question 8

The operations manager of a mail order house purchases double (D) and twin (T) beds for resale. Each double bed costs $500 and requires 100 cubic feet of storage space. Each twin bed costs $300 and requires 90 cubic feet of storage space. The manager has $75,000 to invest in beds this week, and her warehouse has 18,000 cubic feet available for storage. Profit for each double bed is $300 and for each twin bed is $150.
-Which of the following is not a feasible solution?

Accepted Answer

A) (D,T)= (0,0) 
B) (D,T)= (0,250) 
C) (D,T)= (150,0) 
D) (D,T)= (90,100) 
E) (D,T)= (0,200) 
A) (D,T)= (0,0) 
B) (D,T)= (0,250) 
C) (D,T)= (150,0) 
D) (D,T)= (90,100) 
E) (D,T)= (0,200)

Question 9

The equation 3xy = 9 is linear

Accepted Answer

A) True 
 B)False

Question 10

An objective function represents a family of parallel lines

Accepted Answer

A) True 
 B)False

Question 11

All constraints in a linear programming problem are either ≤ or ≥ inequalities

Accepted Answer

A) True 
 B)False

Question 12

When formulating a linear programming problem on a spreadsheet,objective cells will show the levels of activities for the decisions being made

Accepted Answer

A) True 
 B)False

Question 13

The owner of Crackers, Inc. produces both Deluxe (D) and Classic (C) crackers. She only has 4,800 ounces of sugar, 9,600 ounces of flour, and 2,000 ounces of salt for her next production run. A box of Deluxe crackers requires 2 ounces of sugar, 6 ounces of flour, and 1 ounce of salt to produce. A box of Classic crackers requires 3 ounces of sugar, 8 ounces of flour, and 2 ounces of salt to produce. Profits are 40 cents for a box of Deluxe crackers and 50 cents for a box of Classic crackers.
-Which of the following is not a feasible solution?

Accepted Answer

A) (D,
C) = (0,0) 
B) (D,
C) = (0,1000) 
C) (D,
C) = (800,600) 
D) (D,
C) = (1600,0) 
E) (D,
C) = (0,1,200) 
A) (D,
C) = (0,0) 
B) (D,
C) = (0,1000) 
C) (D,
C) = (800,600) 
D) (D,
C) = (1600,0) 
E) (D,
C) = (0,1,200)

Question 14

A feasible point on the optimal objective function line is an optimal solution

Accepted Answer

A) True 
 B)False

Question 15

A circle would be an example of a feasible region for a linear programming problem

Accepted Answer

A) True 
 B)False

Question 16

When solving linear programming problems graphically,there are an infinite number of possible objective function lines

Accepted Answer

A) True 
 B)False

Question 17

An electronics firm produces two models of pocket calculators: the A-100 (A) and the B-200 (B). Each model uses one circuit board, of which there are only 2,500 available for this week's production. In addition, the company has allocated a maximum of 800 hours of assembly time this week for producing these calculators. Each A-100 requires 15 minutes to produce while each B-200 requires 30 minutes to produce. The firm forecasts that it could sell a maximum of 4,000 of the A-100s this week and a maximum of 1,000 B-200s. Profits for the A-100 are $1.00 each and profits for the B-200 are $4.00 each.
-What is the time constraint?

Accepted Answer

A) 1A + 1B ≤ 800 
B) 0 25A + 0 5B ≤ 800 
C) 0 5A + 0 25B ≤ 800 
D) 1A + 0 5B ≤ 800 
E) 0 25A + 1B ≤ 800 
A) 1A + 1B ≤ 800 
B) 0 25A + 0 5B ≤ 800 
C) 0 5A + 0 25B ≤ 800 
D) 1A + 0 5B ≤ 800 
E) 0 25A + 1B ≤ 800

Question 18

What is the weekly profit when producing the optimal amounts?

Accepted Answer

A) $0 
B) $400 
C) $700 
D) $800 
E) $900 
A) $0 
B) $400 
C) $700 
D) $800 
E) $900

Question 19

A linear programming problem can have multiple optimal solutions

Accepted Answer

A) True 
 B)False

Question 20

Linear programming problems may have multiple goals or objectives specified

Accepted Answer

A) True 
 B)False

Given the following 2 constraints,which solution is a feasible solution for a maximization problem?

The graphical method can handle problems that involve any number of decision variables

A manager should know the following things about linear programming

Given the following 2 constraints,which solution is a feasible solution for a minimization problem?

Which objective function has the same slope as this one: 4x + 2y = 20

The equation 5x + 7y = 10 is linear

The equation 3xy = 9 is linear

An objective function represents a family of parallel lines

All constraints in a linear programming problem are either ≤ or ≥ inequalities

When formulating a linear programming problem on a spreadsheet,objective cells will show the levels of activities for the decisions being made

A feasible point on the optimal objective function line is an optimal solution

A circle would be an example of a feasible region for a linear programming problem

When solving linear programming problems graphically,there are an infinite number of possible objective function lines

What is the weekly profit when producing the optimal amounts?

A linear programming problem can have multiple optimal solutions

Linear programming problems may have multiple goals or objectives specified

Introduction

Linear programming: Formulation and applications

Theart of modeling with spread sheets

What-If Analysis for linear programming

Network optimization problems

Using binary integer programming to deal withy es-Or-No decisions

Non linear programming

Decision Analysis

Forecasting

Queuing models

Computer simulation: Basic Concepts

Computer simulation with risks olver platform

Solution concepts for linear programming

Transportation and assignment problems

Pert CPM models for project management

Goal programming

Inventory management with known demand

Inventory management with uncertain demand

Computer simulation with crystal ball

Filters

Exam 2: Linear programming: Basic Concepts

Given the following 2 constraints,which solution is a feasible solution for a maximization problem?

The graphical method can handle problems that involve any number of decision variables

A manager should know the following things about linear programming

Given the following 2 constraints,which solution is a feasible solution for a minimization problem?

Which objective function has the same slope as this one: 4x + 2y = 20

The equation 5x + 7y = 10 is linear

The equation 3xy = 9 is linear

An objective function represents a family of parallel lines

All constraints in a linear programming problem are either ≤ or ≥ inequalities

When formulating a linear programming problem on a spreadsheet,objective cells will show the levels of activities for the decisions being made

A feasible point on the optimal objective function line is an optimal solution

A circle would be an example of a feasible region for a linear programming problem

When solving linear programming problems graphically,there are an infinite number of possible objective function lines

What is the weekly profit when producing the optimal amounts?

A linear programming problem can have multiple optimal solutions

Linear programming problems may have multiple goals or objectives specified

Introduction

Linear programming: Formulation and applications

Theart of modeling with spread sheets

What-If Analysis for linear programming

Network optimization problems

Using binary integer programming to deal withy es-Or-No decisions

Non linear programming

Decision Analysis

Forecasting

Queuing models

Computer simulation: Basic Concepts

Computer simulation with risks olver platform

Solution concepts for linear programming

Transportation and assignment problems

Pert CPM models for project management

Goal programming

Inventory management with known demand

Inventory management with uncertain demand

Computer simulation with crystal ball

Filters