Tuesday

January 24, 2017
Posted by **Sharon** on Saturday, November 10, 2007 at 6:57pm.

Now:

(a) Formulate a linear program that can be used to determine the number of hours each graphic designer should be assigned to the project in order to minimize total cost.

(b) How many hours should each graphic designer be assigned to the project? What is the total cost?

(c) Suppose Lisa could be assigned more than 50hours. What effect would this have on the optimal solution? Explain

(d) If Sarah were not required to work a minimum number of hours on this project, would the optimal solution change? Explain

- Quantiative Methods -
**Writeacher**, Saturday, November 10, 2007 at 7:42pmPlease note that

**we don't do students' homework**for them. Our tutors try to give you the information to help you complete your assignment on your own. If there's not a tutor with this specialty online right now, be sure to go back into your textbook or use a good search engine. ( http://www.sou.edu/library/searchtools/ )

Once**YOU**have come up with attempted answers to**YOUR**questions, please re-post and let us know what you think. Then someone here will be happy to critique your work.

=) - Quantiative Methods -
**Dakshesh Patel**, Thursday, September 11, 2008 at 6:49pma.

Let L = # of hours assigned to Lisa

D = # of hours assigned to David

S = # of hours assigned to Sarah

Max 30L + 25D + 18S

s.t.

L + D + S = 100

0.6L - 0.4D >= 0

-0.15L - 0.15D + 0.85S >= 0

-0.25L - 0.25D + S <= 0

L <= 50 - Quantiative Methods -
**Dakshesh Patel**, Thursday, September 11, 2008 at 6:55pma).

Let L = # of hours assigned to Lisa

D = # of hours assigned to David

S = # of hours assigned to Sarah

Max 30L + 25D + 18S

s.t.

L + D + S = 100

0.6L - 0.4D >= 0

-0.15L - 0.15D + 0.85S >= 0

-0.25L - 0.25D + S <= 0

L <= 50

L , D , S >= 0

b).

L = 48 Hours

D = 72 Hours

S = 30 Hours

Total Cost = $3780

c).

The Dual Price for Constraint 5 is 0. Therefore, additional hours for Lisa will not change the solution

d).

The dual price for constraint 3 is 0. Because there is No Lower Limit on the right and side range, the optimal solution will not change. Resolving the problem without this constraint will also show that the solution obtained in (b) does not change. Constraint 3, therefore, is really a redundant constraint. - Quantiative Methods -
**Greg Long**, Thursday, February 9, 2012 at 10:05pmYou are supposed to minimize this problem, not maximize it.

L= 32

D= 48

S= 20

cost= $2,520 - Quantiative Methods -
**MAS**, Sunday, September 15, 2013 at 9:18pmNo Greg, the answer is 3780. You are supposed to minimize it though. That was the answer in the back of the book.