A company is selling computers. They have an order from their store in San Mateo for 5 Computers and an order from their store in San Francisco of 10 computers. They have 3 computers in their warehouse in Hillsdale and 20 in their warehouse in Mission. It costs $3 to ship a computer from Hillsdale to San Mateo and $15 to ship it from Mission to San Francisco. It costs $12 to ship a computer from Mission to San Mateo and $2 to ship it from Hillsdale to San Francisco. How many computers should be shipped from each warehouse to each store in order to fill these order at the minimum shipping cost?
I know it is Linear Programming Problem
What have you done so far?
@brendafn ?
I have found the unknowns and the objective
Can you post them, please?
@mathmate Let X=# of computers from Hillsdale to San Mateo Y=# of computers from Hillsdale to San Francisco Z=# of computers from Mission to San Mateo W=# of computers from Mission to San Francisco Objective Minimize Shipping Cost 3x + 15y + 12z + 2w
Good, that's a good start. Have you worked on the constraints?
that's the part of the problem i am stuck on
|dw:1422931851556:dw|
I'm summarizing the data so we can check easily. Can you complete the graph?
What graph?
Join our real-time social learning platform and learn together with your friends!