Part 1 Rework problem 1 in section 1 of Chapter 7 of your textbook, about Sam's Deli, using the following data. Assume that each small sandwich uses 4 inches of bread and 4 ounces of meat, and that each large sandwich uses 12 inches of bread and 6 ounces of meat. Assume also that the Deli has on hand each day 90 feet of bread and 25 pounds of meat. Assume also that the profit on each small sandwich is $0.90 and the profit on each large sandwich is $1.50. How many sandwiches of each size should the Deli make in order maximize its profit? When you formulate a linear programming problem to solve this problem, how many variables, how many constraints (both implicit and explicit), and how many objective functions should you have? Number of variables: 2 Number of constraints: 4 Number of objective functions: 1 (Note: The textbook's version of this problem was solved (as part of the mini-lecture) on The Finite Show. You can view the streaming video of this solution at TFS solution. Part 2 • Part 3 Formulate the linear programming problem for this situation. (Enter either the word Maximize or the word Minimize in the first blank. Type the symbols <= wherever you want a "less than or equal" inequality, i.e., <, and type the symbols >= wherever you what a "greater than or equal" inequality, i.e., 2.) Maximize 0.90 x+ 1.50 y (in dollars) subject to the constraints >= >= bread used (in inches): x + meat used (in ounces): x +

College Algebra (MindTap Course List)
12th Edition
ISBN:9781305652231
Author:R. David Gustafson, Jeff Hughes
Publisher:R. David Gustafson, Jeff Hughes
Chapter6: Linear Systems
Section6.8: Linear Programming
Problem 5SC: If during the following year it is predicted that each comedy skit will generate 30 thousand and...
icon
Related questions
Topic Video
Question
• Part 1
Rework problem 1 in section 1 of Chapter 7 of your textbook, about Sam's Deli, using the following data. Assume that each small sandwich uses 4 inches of
bread and 4 ounces of meat, and that each large sandwich uses 12 inches of bread and 6 ounces of meat. Assume also that the Deli has on hand each day
90 feet of bread and 25 pounds of meat. Assume also that the profit on each small sandwich is $0.90 and the profit on each large sandwich is $1.50. How
many sandwiches of each size should the Deli make in order maximize its profit?
When you formulate a linear programming problem to solve this problem, how many variables, how many constraints (both implicit and explicit), and how
many objective functions should you have?
Number of variables: 2
Number of constraints: 4
Number of objective functions:
1
(Note: The textbook's version of this problem was solved (as part of the mini-lecture) on The Finite Show. You can view the streaming video of this solution at
TFS solution.
• Part 2
• Part 3
Formulate the linear programming problem for this situation. (Enter either the word Maximize or the word Minimize in the first blank. Type the symbols <=
wherever you want a "less than or equal" inequality, i.e., <, and type the symbols >= wherever you what a "greater than or equal" inequality, i.e., 2.)
Maximize
0.90
x+ 1.50
y (in dollars)
subject to the constraints
>=
bread used (in inches):
meat used (in ounces):
x +
<ニ
నా
Transcribed Image Text:• Part 1 Rework problem 1 in section 1 of Chapter 7 of your textbook, about Sam's Deli, using the following data. Assume that each small sandwich uses 4 inches of bread and 4 ounces of meat, and that each large sandwich uses 12 inches of bread and 6 ounces of meat. Assume also that the Deli has on hand each day 90 feet of bread and 25 pounds of meat. Assume also that the profit on each small sandwich is $0.90 and the profit on each large sandwich is $1.50. How many sandwiches of each size should the Deli make in order maximize its profit? When you formulate a linear programming problem to solve this problem, how many variables, how many constraints (both implicit and explicit), and how many objective functions should you have? Number of variables: 2 Number of constraints: 4 Number of objective functions: 1 (Note: The textbook's version of this problem was solved (as part of the mini-lecture) on The Finite Show. You can view the streaming video of this solution at TFS solution. • Part 2 • Part 3 Formulate the linear programming problem for this situation. (Enter either the word Maximize or the word Minimize in the first blank. Type the symbols <= wherever you want a "less than or equal" inequality, i.e., <, and type the symbols >= wherever you what a "greater than or equal" inequality, i.e., 2.) Maximize 0.90 x+ 1.50 y (in dollars) subject to the constraints >= bread used (in inches): meat used (in ounces): x + <ニ నా
Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 2 steps with 2 images

Blurred answer
Knowledge Booster
Optimization
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, advanced-math and related others by exploring similar questions and additional content below.
Recommended textbooks for you
College Algebra (MindTap Course List)
College Algebra (MindTap Course List)
Algebra
ISBN:
9781305652231
Author:
R. David Gustafson, Jeff Hughes
Publisher:
Cengage Learning
Functions and Change: A Modeling Approach to Coll…
Functions and Change: A Modeling Approach to Coll…
Algebra
ISBN:
9781337111348
Author:
Bruce Crauder, Benny Evans, Alan Noell
Publisher:
Cengage Learning
Intermediate Algebra
Intermediate Algebra
Algebra
ISBN:
9780998625720
Author:
Lynn Marecek
Publisher:
OpenStax College