Exam 2: Linear Programming: Basic Concepts

A local bagel shop produces bagels (B) and croissants (C). Each bagel requires 6 ounces of flour, 1 gram of yeast, and 2 tablespoons of sugar. A croissant requires 3 ounces of flour, 1 gram of yeast, and 4 tablespoons of sugar. The company has 6,600 ounces of flour, 1,400 grams of yeast, and 4,800 tablespoons of sugar available for today's baking. Bagel profits are 20 cents each and croissant profits are 30 cents each. -What is the daily profit when producing the optimal amounts?

Free

(Multiple Choice)

4.9/5

(35)

Question 1

Correct Answer:

Verified

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

Free

(True/False)

4.9/5

(32)

Question 2

Correct Answer:

Verified

True

What is the optimal solution for the following problem?

Free

(Multiple Choice)

5.0/5

(36)

Question 3

Correct Answer:

Verified

Given the following 2 constraints,which solution is a feasible solution for a minimization problem? (1))14x₁ + 6x₂ $\ge$ 42 (2))x₁ + 3x₂ $\ge$ 6

(Multiple Choice)

4.8/5

(40)

Question 4

Linear programming problems can be formulated both algebraically and on spreadsheets.

(True/False)

4.8/5

(31)

Question 5

Linear programming models can have either $\le$ or $\ge$ inequality constraints but not both in the same problem.

(True/False)

4.8/5

(32)

Question 6

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 weekly profit when producing the optimal amounts?

(Multiple Choice)

4.9/5

(36)

Question 7

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. -What is the storage space constraint?

(Multiple Choice)

4.8/5

(40)

Question 8

A local bagel shop produces bagels (B) and croissants (C). Each bagel requires 6 ounces of flour, 1 gram of yeast, and 2 tablespoons of sugar. A croissant requires 3 ounces of flour, 1 gram of yeast, and 4 tablespoons of sugar. The company has 6,600 ounces of flour, 1,400 grams of yeast, and 4,800 tablespoons of sugar available for today's baking. Bagel profits are 20 cents each and croissant profits are 30 cents each. -Which of the following is not a feasible solution?

(Multiple Choice)

4.8/5

(32)

Question 9

The equation 3xy = 9 is linear.

(True/False)

4.8/5

(34)

Question 10

A maximization problem can generally be characterized by having all $\ge$ constraints.

(True/False)

4.9/5

(35)

Question 11

An infeasible solution violates all of the constraints of the problem.

(True/False)

4.9/5

(34)

Question 12

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

(Multiple Choice)

4.9/5

(37)

Question 13

When solving a minimization problem graphically,it is generally the goal to move the objective function line out,away from the origin,as far as possible. Multiple Choice Questions

(True/False)

4.8/5

(45)

Question 14

Solving linear programming problems graphically,

(Multiple Choice)

4.8/5

(36)

Question 15

When formulating a linear programming problem on a spreadsheet,which of the following is true?

(Multiple Choice)

4.8/5

(32)

Question 16

What is the optimal solution for the following problem?

(Multiple Choice)

4.9/5

(31)

Question 17

The production planner for a private label soft drink maker is planning the production of two soft drinks: root beer (R)and sassafras soda (S).There are at most 12 hours per day of production time and 1500 gallons per day of carbonated water available.A case of root beer requires 2 minutes of time and 5 gallons of water to produce,while a case of sassafras soda requires 3 minutes of time and 5 gallons of water.Profits for the root beer are $6.00 per case,and profits for the sassafras soda are $4.00 per case. -What is the objective function?

(Multiple Choice)

4.7/5

(30)

Question 18

When solving a maximization problem graphically,it is generally the goal to move the objective function line out,away from the origin,as far as possible.

(True/False)

4.8/5

(27)

Question 19

If a single optimal solution exists while using the graphical method to solve a linear programming problem,it will exist at a corner point.

(True/False)

4.9/5

(34)

Question 20

Showing 1 - 20 of 83

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

What is the optimal solution for the following problem?

Given the following 2 constraints,which solution is a feasible solution for a minimization problem? (1))14x₁ + 6x₂ $\ge$ 42 (2))x₁ + 3x₂ $\ge$ 6

Linear programming problems can be formulated both algebraically and on spreadsheets.

Linear programming models can have either $\le$ or $\ge$ inequality constraints but not both in the same problem.

The equation 3xy = 9 is linear.

A maximization problem can generally be characterized by having all $\ge$ constraints.

An infeasible solution violates all of the constraints of the problem.

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

When solving a minimization problem graphically,it is generally the goal to move the objective function line out,away from the origin,as far as possible. Multiple Choice Questions

Solving linear programming problems graphically,

When formulating a linear programming problem on a spreadsheet,which of the following is true?

What is the optimal solution for the following problem?

When solving a maximization problem graphically,it is generally the goal to move the objective function line out,away from the origin,as far as possible.

If a single optimal solution exists while using the graphical method to solve a linear programming problem,it will exist at a corner point.

Introduction

Linear Programming: Formulation and Applications

The Art of Modeling With Spreadsheets

What-If Analysis for Linear Programming

Network Optimization Problems

Using Binary Integer Programming to Deal With Yes-Or-No Decisions

Nonlinear Programming

Decision Analysis

Cd Supplement - Decision Analysis

Forecasting

Queueing Models

CD Supplement - Additional Queueing Models

Computer Simulation: Basic Concepts

CD Supplement - the Inverse Transformation Method for Generating Random Observations

Computer Simulation With Crystal Ball

CD - Solution Concepts for Linear Programming

CD - Transportation and Assignment Problems

CD - Pertcpm Models for Project Management

CD - Goal Programming

CD - Inventory Management With Known Demand

CD - Inventory Management With Uncertain Demand

Filters

Exam 2: Linear Programming: Basic Concepts

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

What is the optimal solution for the following problem?

Given the following 2 constraints,which solution is a feasible solution for a minimization problem? (1))14x1 + 6x2 ≥\ge≥ 42 (2))x1 + 3x2 ≥\ge≥ 6

Linear programming problems can be formulated both algebraically and on spreadsheets.

Linear programming models can have either ≤\le≤ or ≥\ge≥ inequality constraints but not both in the same problem.

The equation 3xy = 9 is linear.

A maximization problem can generally be characterized by having all ≥\ge≥ constraints.

An infeasible solution violates all of the constraints of the problem.

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

When solving a minimization problem graphically,it is generally the goal to move the objective function line out,away from the origin,as far as possible. Multiple Choice Questions

Solving linear programming problems graphically,

When formulating a linear programming problem on a spreadsheet,which of the following is true?

What is the optimal solution for the following problem?

When solving a maximization problem graphically,it is generally the goal to move the objective function line out,away from the origin,as far as possible.

If a single optimal solution exists while using the graphical method to solve a linear programming problem,it will exist at a corner point.

Introduction

Linear Programming: Formulation and Applications

The Art of Modeling With Spreadsheets

What-If Analysis for Linear Programming

Network Optimization Problems

Using Binary Integer Programming to Deal With Yes-Or-No Decisions

Nonlinear Programming

Decision Analysis

Cd Supplement - Decision Analysis

Forecasting

Queueing Models

CD Supplement - Additional Queueing Models

Computer Simulation: Basic Concepts

CD Supplement - the Inverse Transformation Method for Generating Random Observations

Computer Simulation With Crystal Ball

CD - Solution Concepts for Linear Programming

CD - Transportation and Assignment Problems

CD - Pertcpm Models for Project Management

CD - Goal Programming

CD - Inventory Management With Known Demand

CD - Inventory Management With Uncertain Demand

Filters

Given the following 2 constraints,which solution is a feasible solution for a minimization problem? (1))14x₁ + 6x₂ $\ge$ 42 (2))x₁ + 3x₂ $\ge$ 6

Linear programming models can have either $\le$ or $\ge$ inequality constraints but not both in the same problem.

A maximization problem can generally be characterized by having all $\ge$ constraints.