The Kartick Company is trying to determine how much of each of two products to produce over the coming planning period. There are three departments, A, B, and C, with limited labor hours available in each department. Each product must be processed by each department and the per-unit requirements for each product, labor hours available, and per-unit profit are as shown below.   Labor required in each department   Product (hours/unit) Labor Hours Department Product 1 Product 2 Available A 1.00 0.30 100 B 0.30 0.12 36 C 0.15 0.56 50 Profit Contribution $33.00 $24.00     Let x1 = the amount of product 1 to produce   x2 = the amount of product 2 to produce                     Maximize  33 x1 + 24 x2                                                        s.t.                                 1.0 x1 + 0.30 x2 ≤  100          Department A                                 0.30 x1 + 0.12 x2 ≤ 36            Department B                                 0.15 x1 + 0.56 x2 ≤ 50            Department C                         x1, x2 ≥   0

Practical Management Science
6th Edition
ISBN:9781337406659
Author:WINSTON, Wayne L.
Publisher:WINSTON, Wayne L.
Chapter2: Introduction To Spreadsheet Modeling
Section: Chapter Questions
Problem 20P: Julie James is opening a lemonade stand. She believes the fixed cost per week of running the stand...
icon
Related questions
Question

The Kartick Company is trying to determine how much of each of two products to produce over the coming planning period. There are three departments, A, B, and C, with limited labor hours available in each department. Each product must be processed by each department and the per-unit requirements for each product, labor hours available, and per-unit profit are as shown below.

 

Labor required in each department

 

Product (hours/unit)

Labor Hours

Department

Product 1

Product 2

Available

A

1.00

0.30

100

B

0.30

0.12

36

C

0.15

0.56

50

Profit Contribution

$33.00

$24.00

 

 

Let

x1 = the amount of product 1 to produce

 

x2 = the amount of product 2 to produce

   


                Maximize  33 x1 + 24 x2                                       
                s.t.
                                1.0 x1 + 0.30 x2 ≤  100          Department A
                                0.30 x1 + 0.12 x2 ≤ 36            Department B
                                0.15 x1 + 0.56 x2 ≤ 50            Department C
                        x1, x2 ≥   0

Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 2 steps with 4 images

Blurred answer
Similar questions
Recommended textbooks for you
Practical Management Science
Practical Management Science
Operations Management
ISBN:
9781337406659
Author:
WINSTON, Wayne L.
Publisher:
Cengage,
Operations Management
Operations Management
Operations Management
ISBN:
9781259667473
Author:
William J Stevenson
Publisher:
McGraw-Hill Education
Operations and Supply Chain Management (Mcgraw-hi…
Operations and Supply Chain Management (Mcgraw-hi…
Operations Management
ISBN:
9781259666100
Author:
F. Robert Jacobs, Richard B Chase
Publisher:
McGraw-Hill Education
Business in Action
Business in Action
Operations Management
ISBN:
9780135198100
Author:
BOVEE
Publisher:
PEARSON CO
Purchasing and Supply Chain Management
Purchasing and Supply Chain Management
Operations Management
ISBN:
9781285869681
Author:
Robert M. Monczka, Robert B. Handfield, Larry C. Giunipero, James L. Patterson
Publisher:
Cengage Learning
Production and Operations Analysis, Seventh Editi…
Production and Operations Analysis, Seventh Editi…
Operations Management
ISBN:
9781478623069
Author:
Steven Nahmias, Tava Lennon Olsen
Publisher:
Waveland Press, Inc.