Better Products, Inc., manufactures three products on two machines. In a typical week, 40 hours are available on each machine. The profit contribution and production time in hours per unit are as follows: Category Product 1 Product 2 Product 3
Profit/unit $30 $50 $20
Machine 1 time/unit 0.5 2.0 0.75
Machine 2 time/unit 1.0 1.0 0.5
Two operators are required for machine 1; thus, 2 hours of labor must be scheduled for each hour of machine 1 time. Only one operator is required for machine 2. A maximum of 100 labor-hours is available for assignment to the machines during the coming week. Other production requirements are that product 1 cannot account for more than 50% of the units produced and that product 3 must account for at least 20% of the units produced.
How many units of each product should be produced to maximize the total profit contribution?
Product # of units
1
2
3
What is the projected weekly profit associated with your solution?
Profit = $
How many hours of production time will be scheduled on each machine? If required, round your answers to two decimal places.
Machine Hours Schedule:
Machine 1 Hours
Machine 2 Hours
What is the value of an additional hour of labor? If required, round your answers to two decimal places.
$
Assume that labor capacity can be increased to 120 hours. Develop the optimal product mix, assuming that the extra hours are made available.
Product # of units
1
2
3
Profit = $
Would you be interested in using the additional 20 hours available for this resource?

z (max)  =  1250 $

x₁  = 25    x₂  =  0   x₃  =  25

Step-by-step explanation:

                                Profit $    mach. 1      mach. 2

Product 1     ( x₁ )       30             0.5              1

Product 2    ( x₂ )       50             2                  1

Product 3    ( x₃ )       20             0.75             0.5

Machinne 1 require  2 operators

Machine   2 require  1  operator

Amaximum of  100 hours of labor available

Then Objective Function:

z  =  30*x₁  +  50*x₂  +  20*x₃      to maximize

Constraints:

1.-Machine 1 hours available  40

In machine 1    L-H  we will need

0.5*x₁  +  2*x₂  + 0.75*x₃  ≤  40

2.-Machine 2   hours available  40

1*x₁  +  1*x₂   + 0.5*x₃   ≤  40

3.-Labor-hours available   100

Machine 1     2*( 0.5*x₁ +  2*x₂  +  0.75*x₃ )

Machine  2       x₁   +   x₂   +  0.5*x₃  

Total labor-hours   :  

2*x₁  +  5*x₂  +  2*x₃  ≤  100

4.- Production requirement:

x₁  ≤  0.5 *( x₁ +  x₂  +  x₃ )     or   0.5*x₁  -  0.5*x₂  -  0.5*x₃  ≤ 0

5.-Production requirement:

x₃  ≥  0,2 * ( x₁  +  x₂   +  x₃ )  or    -0.2*x₁  - 0.2*x₂ + 0.8*x₃   ≥  0

General constraints:

x₁  ≥   0       x₂    ≥   0       x₃     ≥   0           all integers

The model is:

z  =  30*x₁  +  50*x₂  +  20*x₃      to maximize

Subject to:

0.5*x₁  +  2*x₂  + 0.75*x₃  ≤  40

1*x₁  +  1*x₂   + 0.5*x₃       ≤  40

2*x₁  +  5*x₂  +  2*x₃        ≤  100

0.5*x₁  -  0.5*x₂  -  0.5*x₃  ≤ 0

-0.2*x₁  - 0.2*x₂ + 0.8*x₃   ≥  0

x₁  ≥   0       x₂    ≥   0       x₃     ≥   0           all integers

After 6 iterations with the help of the on-line solver AtomZmaths we find

z (max)  =  1250 $

x₁  = 25    x₂  =  0   x₃  =  25

answer: i think it is (1,-2)

answer: 34rtyj,jkhtyetwrhyjeuiejnbhdfknbkguxfrbhkfdbjvkmbd,kvbsd.kxjvbhjnfbgjxdfn

step-by-step explanation: