Problem 3 The Lock and Co Hatters produces two types of hats, the panama hat and baseball cap. Each first type of hat which is the panama hat requires twice as much as labor time as the baseball cap. If all hats are baseball only, the company can produce a total of 500 hats a day. The market limits daily sales of the panama hat and baseball cap to 150 and 350 hats respectively. Assuming that the profits per hat are Rs. 8 for panama hat and Rs. 5 for baseball cap. Formulate the problem as a linear programming model in order to determine the number of hats to be produced of each type so as to maximize the profit. Solution: Data Summary Chart Market Demand Variable Labor Profit per Hat Resource Unit Time Hats (Rs.) Limit 150 (max) 250 (max) Panama Hat 150 8 Baseball Cap 1 250 Decision Variables: x, = Panama Hat x, = Baseball Cap Objective Functions: Maximize (z) = 8x, + 5x, Constraints: Market Constraints: 2x, + x, s 500 Panama Hat Sales Constraints: X, s 150 Baseball Cap Sales Constraints: X, s 250 Non- Negativity: where: x,, X, 2 0
Problem 3 The Lock and Co Hatters produces two types of hats, the panama hat and baseball cap. Each first type of hat which is the panama hat requires twice as much as labor time as the baseball cap. If all hats are baseball only, the company can produce a total of 500 hats a day. The market limits daily sales of the panama hat and baseball cap to 150 and 350 hats respectively. Assuming that the profits per hat are Rs. 8 for panama hat and Rs. 5 for baseball cap. Formulate the problem as a linear programming model in order to determine the number of hats to be produced of each type so as to maximize the profit. Solution: Data Summary Chart Market Demand Variable Labor Profit per Hat Resource Unit Time Hats (Rs.) Limit 150 (max) 250 (max) Panama Hat 150 8 Baseball Cap 1 250 Decision Variables: x, = Panama Hat x, = Baseball Cap Objective Functions: Maximize (z) = 8x, + 5x, Constraints: Market Constraints: 2x, + x, s 500 Panama Hat Sales Constraints: X, s 150 Baseball Cap Sales Constraints: X, s 250 Non- Negativity: where: x,, X, 2 0
Advanced Engineering Mathematics
10th Edition
ISBN:9780470458365
Author:Erwin Kreyszig
Publisher:Erwin Kreyszig
Chapter2: Second-order Linear Odes
Section: Chapter Questions
Problem 1RQ
Related questions
Question
100%
*** Please only respond when all the problem will be answered ***
Solve the optimization problem using linear programming. Find the optimal solution with graph.
![Problem 3
The Lock and Co Hatters produces two types of hats, the panama hat and baseball cap. Each
first type of hat which is the panama hat requires twice as much as labor time as the baseball cap. If
all hats are baseball only, the company can produce a total of 500 hats a day. The market limits daily
sales of the panama hat and baseball cap to 150 and 350 hats respectively. Assuming that the
profits per hat are Rs. 8 for panama hat and Rs. 5 for baseball cap. Formulate the problem as a
linear programming model in order to determine the number of hats to be produced of each type so
as to maximize the profit.
Solution:
Data Summary Chart
Market Demand
Variable
Labor
Profit per Hat
Resource
Unit
Time
Hats
(Rs.)
Limit
150 (max)
250 (max)
Panama Hat
150
8
Baseball Cap
1
250
Decision Variables:
x, = Panama Hat
x, = Baseball Cap
Objective Functions:
Maximize (z) = 8x, + 5x,
Constraints:
Market Constraints:
2x, + x, s 500
Panama Hat Sales Constraints:
X, s 150
Baseball Cap Sales Constraints:
X, s 250
Non- Negativity:
where: x,, X, 2 0](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2F70c7de92-02bc-4182-b6e1-b451aeff8c3e%2F4f708878-5d58-4dae-8abb-e604f91cd72b%2F0ys96m_processed.png&w=3840&q=75)
Transcribed Image Text:Problem 3
The Lock and Co Hatters produces two types of hats, the panama hat and baseball cap. Each
first type of hat which is the panama hat requires twice as much as labor time as the baseball cap. If
all hats are baseball only, the company can produce a total of 500 hats a day. The market limits daily
sales of the panama hat and baseball cap to 150 and 350 hats respectively. Assuming that the
profits per hat are Rs. 8 for panama hat and Rs. 5 for baseball cap. Formulate the problem as a
linear programming model in order to determine the number of hats to be produced of each type so
as to maximize the profit.
Solution:
Data Summary Chart
Market Demand
Variable
Labor
Profit per Hat
Resource
Unit
Time
Hats
(Rs.)
Limit
150 (max)
250 (max)
Panama Hat
150
8
Baseball Cap
1
250
Decision Variables:
x, = Panama Hat
x, = Baseball Cap
Objective Functions:
Maximize (z) = 8x, + 5x,
Constraints:
Market Constraints:
2x, + x, s 500
Panama Hat Sales Constraints:
X, s 150
Baseball Cap Sales Constraints:
X, s 250
Non- Negativity:
where: x,, X, 2 0
Expert Solution
![](/static/compass_v2/shared-icons/check-mark.png)
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
This is a popular solution!
Trending now
This is a popular solution!
Step by step
Solved in 4 steps with 4 images
![Blurred answer](/static/compass_v2/solution-images/blurred-answer.jpg)
Recommended textbooks for you
![Advanced Engineering Mathematics](https://www.bartleby.com/isbn_cover_images/9780470458365/9780470458365_smallCoverImage.gif)
Advanced Engineering Mathematics
Advanced Math
ISBN:
9780470458365
Author:
Erwin Kreyszig
Publisher:
Wiley, John & Sons, Incorporated
![Numerical Methods for Engineers](https://www.bartleby.com/isbn_cover_images/9780073397924/9780073397924_smallCoverImage.gif)
Numerical Methods for Engineers
Advanced Math
ISBN:
9780073397924
Author:
Steven C. Chapra Dr., Raymond P. Canale
Publisher:
McGraw-Hill Education
![Introductory Mathematics for Engineering Applicat…](https://www.bartleby.com/isbn_cover_images/9781118141809/9781118141809_smallCoverImage.gif)
Introductory Mathematics for Engineering Applicat…
Advanced Math
ISBN:
9781118141809
Author:
Nathan Klingbeil
Publisher:
WILEY
![Advanced Engineering Mathematics](https://www.bartleby.com/isbn_cover_images/9780470458365/9780470458365_smallCoverImage.gif)
Advanced Engineering Mathematics
Advanced Math
ISBN:
9780470458365
Author:
Erwin Kreyszig
Publisher:
Wiley, John & Sons, Incorporated
![Numerical Methods for Engineers](https://www.bartleby.com/isbn_cover_images/9780073397924/9780073397924_smallCoverImage.gif)
Numerical Methods for Engineers
Advanced Math
ISBN:
9780073397924
Author:
Steven C. Chapra Dr., Raymond P. Canale
Publisher:
McGraw-Hill Education
![Introductory Mathematics for Engineering Applicat…](https://www.bartleby.com/isbn_cover_images/9781118141809/9781118141809_smallCoverImage.gif)
Introductory Mathematics for Engineering Applicat…
Advanced Math
ISBN:
9781118141809
Author:
Nathan Klingbeil
Publisher:
WILEY
![Mathematics For Machine Technology](https://www.bartleby.com/isbn_cover_images/9781337798310/9781337798310_smallCoverImage.jpg)
Mathematics For Machine Technology
Advanced Math
ISBN:
9781337798310
Author:
Peterson, John.
Publisher:
Cengage Learning,
![Basic Technical Mathematics](https://www.bartleby.com/isbn_cover_images/9780134437705/9780134437705_smallCoverImage.gif)
![Topology](https://www.bartleby.com/isbn_cover_images/9780134689517/9780134689517_smallCoverImage.gif)