In: Operations Management

For the given transportation problem, formulate a linear program with objective function and constraints. Solve using the excel sleeve, provide the optimal transport cost.

Imagine that we have three bakeries and three stores. the three stores require 23 dozen, 17 dozen, and 20 dozen loaves of bread, respectively, while the three bakeries can supply 18 dozen, 15 dozen, and 22 dozen loaves, respectively. The unit transportation costs are provided in the table below:

Store 1 | Store 2 | Store 3 | |

Bakery 1 | 8 | 9 | 3 |

Bakery 2 | 15 | 2 | 12 |

Bakery 3 | 4 | 7 | 8 |

Provide the LP formulation (only the objective function and one supply and one demand constraint) and solve to optimal using Excel.

Total demand>Total supply.Hence,we add a dummy bakery with cost=0 and supply=5.

LP formulation:

Let Cij be the cost from bakery i to store j .

Let Xij be the number of units transported from bakery i to store j .

Objective function =Z= **Min** i
j
(Xij * Cij ) ,where i=1,2 ,3,4 and j=1,2,3

(i=4 for dummy bakery)

Supply constraint:

X11+X12+X13<=18

Demand constraint:

X11+X21+X31+X41=23

Using excel solver,we find the optimal solution as shown below:

Min cost=Min SUMPRODUCT(B3:D6,B9:D12)=$ **172**

In excel,

B17=SUM(B9:D9)

B18=SUM(B10:D10)

B19=SUM(B11:D11)

B20=SUM(B12:D12)

B21=SUM(B9:B12)

B22=SUM(C9:C12)

B23=SUM(D9:D12)

The optimal shipping pattern is highlighted in yellow:

Find the objective function and the constraints, and then solve
the problem by using the simplex method. A confectioner has 600
pounds of chocolate, 100 pounds of nuts, and 50 pounds of fruits in
inventory with which to make three types of candy: Sweet Tooth,
Sugar Dandy, and Dandy Delite. A box of Sweet Tooth uses 3 pounds
of chocolate, 1 pound of nuts, and 1 pound of fruit and sells for
$8. A box of Sugar Dandy requires 4...

Consider the following transportation problem. Formulate this
problem as a linear programming model and solve it using the MS
Excel Solver tool.
Shipment Costs ($), Supply, and
Demand:
Destinations
Sources
1
2
3
Supply
A
6
9
100
130
B
12
3
5
70
C
4
8
11
100
Demand
80
110
60
(4 points) Volume Shipped from Source A __________
(4 points) Volume Shipped from Source B __________
(4 points) Volume Shipped from Source C __________
(3 points) Minimum...

Formulate the situation as a linear programming problem by
identifying the variables, the objective function, and the
constraints. Be sure to state clearly the meaning of each variable.
Determine whether a solution exists, and if it does, find it. State
your final answer in terms of the original question. A rancher
raises goats and llamas on his 400-acre ranch. Each goat needs 2
acres of land and requires $100 of veterinary care per year, and
each llama needs 5 acres...

Solve the linear program below with python.
OBJECTIVE FUNCTION::
Maximize Contribution Z=40X+26Y+66Z
CONSTRAINTS:
Cutting Capacity =1800min.
4X+8Y+4Z< or =1800
Stitching Capacity =2100 min
6X+6Y+4Z< or=2100
Pressing Capacity=1500 min.
6X+8Y+6Z< or =1500
Maximize : Z=40X+26Y+66Z
Constraints:
4X+8Y+4Z< or =1800
6X+6Y+4Z< or=2100
6X+8Y+6Z< or =1500

Solve this linear programming (LP) problem using the
transportation method. Find the optimal transportation plan and the
minimum cost. (Leave no cells blank - be certain to enter
"0" wherever required. Omit the "$" sign in your
response.)
Minimize
8x11
+
2x12 + 5x13 +
2x21 + x22
+ 3x23 +
7x31 + 2x32 +
6x33
Subject to
x11 + x12 +
x13
=
90
x21 + x22 +
x23
=
105
x31 + x32 +
x33
=
105
x11...

Solve for the following Linear Programming problems. Your
solutions should include:
Objective
Function
Constraints
Graph complete with labels of points
and lines, and shaded feasible region
Corner point
approach
Optimal
solution
Maximum
profit
Problem 1: In
1969, the two leading dietary drinks available in the market are
Bandade and Firstade. These drinks supply protein and carbohydrates
lost during physical activity. Bandade provides 1 unit of protein
and 3 units of carbohydrates in each liter. Firstade supplies 2
units of protein...

Use the simplex method to solve the linear programming
problem.
Maximize objective function: Z= 6x1 + 2x2
Subject to constraints:
3x1 + 2x2 <=9
x1 + 3x2 <= 5
when x1, x2 >=0

Solve using the graphical method. Choose your variables,
identify the objective function and the constraints, graph the
constraints, shade the feasibility region, identify all corner
points, and determine the solution that optimizes the objective
function. Use this information to answer the following 8-part
question:A city council voted to conduct a study on inner-city community
problems using sociologists and research assistants from UMUC.
Allocation of time and costs per week are given in the following
table:Labor hours - SociologistLabor hours –...

Find both the maximum and minimum of the objective function
y − 8x given these constraints. (If an answer
does not exist, enter DNE.)
5x-2y≤13
y≥-4
y-7x≤31
2x+7y≤13

Formulate but do not solve the following exercise as a linear
programming problem. Kane Manufacturing has a division that
produces two models of fireplace grates, x units of model A and y
units of model B. To produce each model A requires 2 lb of cast
iron and 8 min of labor. To produce each model B grate requires 5
lb of cast iron and 5 min of labor. The profit for each model A
grate is $2.50, and the...

ADVERTISEMENT

ADVERTISEMENT

Latest Questions

- 1. Write a for loop that will display all of the multiples of 3, one per...
- Using JAVA Resource: "Analyze and Document JDBC API Calls" text file ** PASTED BELOW** For this...
- Consider requirements gathering. Tell us 3 challenges of requirements engineering and project management. Why were they...
- You have been hired as a consultant for Pristine Urban-Tech Zither, Inc. (PUTZ), manufacturers of fine...
- C++: (I need this program to output in a certain format I will post the "needed...
- Define Strategic CSR in your own words. What are the signs you would look for to...
- Define the difference between current and long term liabilities. Creditors use several measures to assess a...

ADVERTISEMENT