kelson sporting equipment, inc., makes two different types of baseball gloves: a regular model and a catcher's model. the firm has 900 hours of production time available in its cutting and sewing department, 240 hours available in its finishing department, and 100 hours available in its packaging and shipping department. the production time requirements and the profit contribution per glove are given in the following table:
production time (hours)
cutting packaging
model and sewing finishing and shipping profit/glove
regular model 1 1/2 1/8 $8
catcher's model 3/2 1/3 1/2 $4
assuming that the company is interested in maximizing the total profit contribution, answer the following:
a. what is the linear programming model for this problem? if your answer is zero, enter "0". if you need a negative number, enter minus sign with it. if necessary, enter the numbers as a common fraction. if the constant is "1" it must be entered in the box.
let r = number of units of regular model.
c = number of units of catcher's model.
max r + c
s. t.
r + c ≤ cutting and sewing
r + c ≤ finishing
r + c ≤ packaging and shipping
r, c ≥
b. what is the total profit contribution kelson can earn with the given production quantities? if required, round your answer to the nearest dollar.
c. how many hours of production time will be scheduled in each department? if required, round your answer to the nearest whole number.
c & s
f
p & s
c. what is the slack time in each department? if required, round your answer to the nearest whole number. if no entry is required, enter "0".
department capacity usage slack
c & s hours
f hours
p & s hours

you should at least use a calculater

step-by-step explanation:

answer: 16

step-by-step explanation: first you would add 6+6 which equals 12 then add 2+2 which equals 4. then add 12 + 4 which is 16.

hope this ^_^

your exact question is kind of difficult to understand, so maybe an example will explain what you're supposed to do? i'll work through the first problem on the worksheet.

suppose you have a tray of 652 brownies, and you have 5 friends that you want to feed without picking favorites. how many brownies can you dole out to each of your friends in equal amounts? how many will be left over for you to eat?

what you're doing here is finding a way to arrange the number 652 as the sum of integer multiple of 5 and some remainder:

here ("q" for quotient) is the number of brownies each of your friends get, and is the remainder. that's the basic idea behind division.

we break up the number 652 into parts so that the leading digit stands on its own:

652 = 600 + 52

first we check if it's possible to hand out exactly 100 brownies to each friend. with 5 friends, this means we want to know if we can take out 500 brownies from the tray. we can do this 1 time because we have 600 brownies to take from, and when we do that we're left with 100 + 52 brownies to divvy up. so we know that

652 = 1*500 + 152

next we want to know if it's possible to hand out exactly 10 brownies per friend. if we can, we have to remove 50 brownies from the tray each time until we can't. we have 152 brownies left, and we know that 3(50) = 150, so

152 = 3*50 + 2

now we have 2 brownies left in the tray. is it possible to hand 1 out to each of your 5 friends? no, you'd need a minimum of 5 brownies to do that. so the last 2 are yours.

putting everything together, we found that

652 = 1*500 + 3*50 + 2

and we can rearrange this to write

652 = 5*100 + 5*30 + 2

652 = 5(100 + 30) + 2

652 = 5*130 + 2

so and .

you might be more accustomed to the table depicting the algorithm. that's just a compact way of organizing what we've done above. you can consult the image i've attached below.

question: match the eqaution with its graph -8x - 5y = 40

answer: 8 x 5 = 40

x= absiss

y= orderly

so you have a proportional graph

question answered by

(jacemorris04)