Thanks to visit codestin.com
Credit goes to www.scribd.com

Scribd
Upload
91 views2 pages

Machine A B C Capacity Minimiz e Cost 1 2 3 Orders

The Ace Manufacturing Company has orders for three products and three machines available to produce the products. The production rate is the same for all machines but the unit costs vary depending on defect rates for each product on each machine. The problem is to develop the minimum cost production schedule for the products across the machines using a transportation model and linear programming formulation.

Uploaded by

Urbi Roy Barman
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
91 views2 pages

Machine A B C Capacity Minimiz e Cost 1 2 3 Orders

The Ace Manufacturing Company has orders for three products and three machines available to produce the products. The production rate is the same for all machines but the unit costs vary depending on defect rates for each product on each machine. The problem is to develop the minimum cost production schedule for the products across the machines using a transportation model and linear programming formulation.

Uploaded by

Urbi Roy Barman
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 2

The Ace Manufacturing Company has orders for three similar products:

Three machines are available for the manufacturing operations. All three machines can produce all the products at the same production rate. However, due
to varying defect percentages of each product on each machine, the unit costs of the products vary depending on the machine used. Machine capacities for
the next week and the unit costs are as follows:

Use the transportation model to develop the minimum cost production schedule for the products and machines. Show the linear programming formulation.

Solution:

LHS RHS
Data
Minimiz
Machine A B C Capacity cost
e
1 1 1.2 0.9 1500 s.t.
x11+x12+x13<=150
2 1.3 1.4 1.2 1500 0
x21+x22+x23<=150
3 1.1 1 1.2 1000 0
Orders 2000 500 1200 x31+x32+x33<=100
0
x11+x21+x31=2000
Model x12+x22+x32=500
j=1 j=2 j=3 Capacity x13+x23+x33=1200
Machine,
1500
i=1 300 0 1200
Machine,
1500
i=2 1200 0 0
Machine,
1000
i=3 500 500 0
Orders 2000 500 1200

Objective 3990

Subject to LHS RHS


x11+x12+x13<=150
1500 1500
<= 0
x21+x22+x23<=150
1200 1500
<= 0
x31+x32+x33<=100
1000 1000
<= 0
2000 = 2000 x11+x21+x31=2000
500 = 500 x12+x22+x32=500
1200 = 1200 x13+x23+x33=1200

You might also like