mat 540 week 10 homework latest n.
Download
Skip this Video
Loading SlideShow in 5 Seconds..
MAT 540 WEEK 10 HOMEWORK LATEST PowerPoint Presentation
Download Presentation
MAT 540 WEEK 10 HOMEWORK LATEST

Loading in 2 Seconds...

play fullscreen
1 / 2

MAT 540 WEEK 10 HOMEWORK LATEST - PowerPoint PPT Presentation


  • 2 Views
  • Uploaded on

\nVisit Below Link, To Download This Course:\n\nhttps://www.tutorialsservice.net/product/mat-540-week-10-homework-latest/\n\nOr \nEmail us on\nSUPPORT@TUTORIALSSERVICE.NET\n\nMAT 540 Week 10 Homework Latest\nMAT540\nMAT 540 Week 10 Homework Latest\nPage 1 of 2\n

loader
I am the owner, or an agent authorized to act on behalf of the owner, of the copyrighted work described.
capcha
Download Presentation

PowerPoint Slideshow about 'MAT 540 WEEK 10 HOMEWORK LATEST' - tutorialsservicesnet


An Image/Link below is provided (as is) to download presentation

Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author.While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server.


- - - - - - - - - - - - - - - - - - - - - - - - - - E N D - - - - - - - - - - - - - - - - - - - - - - - - - -
Presentation Transcript
mat 540 week 10 homework latest

MAT 540 WEEK 10 HOMEWORK LATEST

Visit Below Link, To Download This Course:

https://www.tutorialsservice.net/product/mat-540-week-10-homework-latest/

Or

Email us on

SUPPORT@TUTORIALSSERVICE.NET

MAT 540 Week 10 Homework Latest

MAT540

MAT 540 Week 10 Homework Latest

Page 1 of 2

Chapter 6

1. Consider the following transportation problem:

From

A

B

C

Demand

6

11

4

70

To (Cost)

2

150

85

125

Supply

1

5

8

10

100

5

9

7

80

3

Formulate this problem as a linear programming model and solve it by the using the computer.

2. Consider the following transportation problem:

From

A

B

C

Demand

8

6

9

110

To (Cost)

2

120

80

150

Supply

1

14

17

24

140

8

7

10

100

3

Solve it by using the computer.

3. World foods, Inc. imports food products such as meats, cheeses, and pastries to the United

States from warehouses at ports in Hamburg, Marseilles and Liverpool. Ships from these ports

deliver the products to norfolk new york

deliver the products to Norfolk, New York and Savannah, where they are stored in company

warehouses before being shipped to distribution centers in Dallas, St. Louis and Chicago. The

products are then distributed to specialty foods stores and sold through catalogs. The shipping

costs ($/1,000 lb.) from the European ports to the U.S. cities and the available supplies (1000 lb.)

at the European ports are provided in the following table:

4.

From

To (Cost)

Supply

1.

2.

3.

4. Norfolk

280

470

355

555

365

525

5. New York

75

85

40

6. Savannah

Hamburg

Marseilles

Liverpool

320

410

550

The transportation costs ($/1000 lb.) from each U.S. city of the three distribution centers and the

demands (1000 lb.) at the distribution centers are as follows:

4.

5.

6.

Warehouse

Norfolk

New York

Savannah

Demand

80

100

65

85

Distribution Center

85

95

90

65

7. Dallas

78

120

75

70

9. Chicago

8. St. Louis

Determine the optimal shipments between the European ports and the warehouses and the distribution

centers to minimize total transportation costs.

4. The Omega Pharmaceutical firm has five salespersons, whom the firm wants to assign to five

sales regions. Given their various previous contacts, the sales persons are able to cover the

regions in different amounts of time. The amount of time (days) required by each salesperson to

cover each city is shown in the following table:

5.

Region

(days)

Salesperson

A

10

10

13

12

15

12

18

19

14

19

B

10

11

11

22

26

C

22

15

14

16

23

D

E

1.

2.

3.

4.

5.

20

14

12

16

12

Which salesperson should be assigned to each region to minimize total time? Identify the optimal

assignments and compute total minimum time.

Download now