Slick Oil Company has 3 warehouses from which it can ship to 4 retailers. The monthly demand at retailer 1 is 350 drums, at retailer 2 it is 100, at retailer 3 it is 50 and at retailer 4 it is 150 drums. Warehouse 1 has an inventory of 250 units, Warehouse 2 has an inventory of 150 units, and Warehouse 3 has an inventory of 300 units. Given the costs below, they need to determine how product should be shipped between the warehous and the retailers. From To Retailer Warehouse 1 2 3 4 1. $6 $3 $8 $6 2 $8 $2 $7 $8 3 $3 $5 $4 $11 The linear programing formulation for this problem is provided below: Variables: Sij: Number of units to ship from warehouse i to customer j Objective Function: Minimize the total cost of all our shipments. Minimize: 6 S11+3 S12 + 8S13...+ 11 S34 Constraints: S11+S12+S13+S14 < 250 S11+S21+S31=350 S12+S22+S32=100 S21+S22+S23+S24< 150 S31+S32+S33+S34 < 300 S13+S23+S33=50 S14+S24+S34=150 Restrictions: Sij 2 0, integer WHAT IS THE MINIMUM TRANSPORTATION COST POSSIBL O $2,650 O $2,225 O $2,975

Linear Algebra: A Modern Introduction
4th Edition
ISBN:9781285463247
Author:David Poole
Publisher:David Poole
Chapter2: Systems Of Linear Equations
Section2.4: Applications
Problem 27EQ
icon
Related questions
Question

Help me please

Slick Oil Company has 3 warehouses from which it can ship to 4 retailers.
The monthly demand at retailer 1 is 350 drums, at retailer 2 it is 100, at
retailer 3 it is 50 and at retailer 4 it is 150 drums. Warehouse 1 has an
inventory of 250 units, Warehouse 2 has an inventory of 150 units, and
Warehouse 3 has an inventory of 300 units. Given the costs below, they
need to determine how product should be shipped between the warehouses
and the retailers.
From
To Retailer
Warehouse
1
2
3
4
1.
$6
$3
$8
$6
2
$8
$2
$7
$8
3
$3
$5
$4
$11
The linear programing formulation for this problem is provided below:
Variables:
Sij:
Number of units to ship from warehouse i to customer j
Objective Function:
Minimize the total cost of all our shipments.
Minimize: 6 S11 + 3 S12 + 8S13..+ 11 S34
Constraints:
S11+S12+S13+S14 < 250
S11+S21+S31=350
S21+S22+S23+S24< 150
S12+S22+S32=100
S31+S32+S33+S34 < 300
S13+S23+S33=50
S14+S24+S34=150
Restrictions:
Sij > 0, integer
WHAT IS THE MINIMUM TRANSPORTATION COST POSSIBLE?
O $2,650
O $2,225
O $2,975
Transcribed Image Text:Slick Oil Company has 3 warehouses from which it can ship to 4 retailers. The monthly demand at retailer 1 is 350 drums, at retailer 2 it is 100, at retailer 3 it is 50 and at retailer 4 it is 150 drums. Warehouse 1 has an inventory of 250 units, Warehouse 2 has an inventory of 150 units, and Warehouse 3 has an inventory of 300 units. Given the costs below, they need to determine how product should be shipped between the warehouses and the retailers. From To Retailer Warehouse 1 2 3 4 1. $6 $3 $8 $6 2 $8 $2 $7 $8 3 $3 $5 $4 $11 The linear programing formulation for this problem is provided below: Variables: Sij: Number of units to ship from warehouse i to customer j Objective Function: Minimize the total cost of all our shipments. Minimize: 6 S11 + 3 S12 + 8S13..+ 11 S34 Constraints: S11+S12+S13+S14 < 250 S11+S21+S31=350 S21+S22+S23+S24< 150 S12+S22+S32=100 S31+S32+S33+S34 < 300 S13+S23+S33=50 S14+S24+S34=150 Restrictions: Sij > 0, integer WHAT IS THE MINIMUM TRANSPORTATION COST POSSIBLE? O $2,650 O $2,225 O $2,975
Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 4 steps with 3 images

Blurred answer