0% found this document useful (0 votes)
45 views20 pages

Group 6

The document presents a linear programming model to optimize the production of cream cheese and cottage cheese. It defines decision variables for the amounts of different types of milk used in each product and in producing cream. The objective is to maximize profit by minimizing costs and maximizing revenue. The model is subject to constraints on milk and cream inputs, output quantities, and production capacities. It provides the variable values, cost, revenue and objective function for an optimal solution that satisfies all constraints.

Uploaded by

Linh Chi
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as XLSX, PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
45 views20 pages

Group 6

The document presents a linear programming model to optimize the production of cream cheese and cottage cheese. It defines decision variables for the amounts of different types of milk used in each product and in producing cream. The objective is to maximize profit by minimizing costs and maximizing revenue. The model is subject to constraints on milk and cream inputs, output quantities, and production capacities. It provides the variable values, cost, revenue and objective function for an optimal solution that satisfies all constraints.

Uploaded by

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

Denote:

Xij is the selection of route from i to j


Dij is the distance from i to j 
Objective function:
Max Z= Σ Xij*Dij
Constraints
X12+X13+X14 <= 1
X12 -X25 -X26 -X27 >= 0
X13 -X35 -X36 -X37 >= 0
X14 -X45 -X46 -X47 >= 0
X25 +X35 +X45 -X58 -X59 >= 0
X26 +X36 +X46 -X68 -X69 >= 0
X27 +X37 +X47 -X78 -X79 >= 0
X58 +X68 +X78 -X810 >= 0
X59 +X69 +X79 -X910 >= 0
X810 +X910 >=1
Xij >= 0

VARIABLE DECISION X12 X13 X14 X25


1 0 0 1
TOTAL DISTANCES 550 900 770 680
OBJECTIVE FUNCTION 2870
CONSTRAINTS
1 -1 -1 -1
2 1 -1
3 1
4 1
5 1
6
7
8
9
10
X26 X27 X35 X36 X37 X45 X46
0 0 0 0 0 0 0
790 1050 580 760 660 510 700

-1 -1
-1 -1 -1
-1 -1
1 1
1 1 1
1 1
X47 X58 X59 X68 X69 X78 X79
0 1 0 0 0 0 0
830 610 790 540 940 790 270

-1
-1 -1
-1 -1
1 -1 -1
1 1 1
1 1 1
X810 X910
1 0
1030 1390

0 ≥ -1
0 ≥ 0
0 ≥ 0
0 ≥ 0
0 ≥ 0
0 ≥ 0
0 ≥ 0
-1 0 ≥ 0
-1 0 ≥ 0
1 1 0 ≥ 1
Denote: Xij: is the selection of travelling from i to j
             Cij: is income received when going  from i to j = Income at J - Cost from i to j
Objective function:    MAX I = Σ Cij*Xij 
Constraints:
X12+X13 +X14 <= 1
X12 -X25 -X26 -X27 >= 0
X13 -X35 -X36 -X37 >= 0
X14 -X45 -X46 -X47 >= 0
X25 +X35 +X45 -X58 -X59 -X510 >= 0
X26 +X36 +X46 -X68 -X69 -X610 >= 0
X27 +X37 +X47 -X78 -X79 -X710 >= 0
X58 +X68 +X78 -X811 >= 0
X59 +X69 +X79 -X911>= 0
X510 +X610 +X710 -X1011>= 1
Xij >= 0

VARIABLE DECISION X12 X13 X14


1 0 0
INCOME 16 10 7
OBJECTIVE FUNCTION 43
1 -1 -1 -1
2 1
3 1
4 1
5
6
7
8
9
10
11
ncome at J - Cost from i to j

X25 X26 X27 X35 X36 X37


1 0 0 0 0 0
16 10 7 9 17 10

-1 -1 -1
-1 -1 -1

1 1
1 1
1 1
X45 X46 X47 X58 X59 X510 X68
0 0 0 1 0 0 0
11 15 12 16 10 7 9

-1 -1 -1
1 -1 -1 -1
1 -1
1
1 1
1
1
X69 X610 X78 X79 X710 X811 X911
0 0 0 0 0 1 0
17 10 11 15 12 -5 -2

-1 -1
-1 -1 -1
1 -1
1 1 -1
1 1
1 1
X1011
0
0

-1 ≥ -1
0 ≥ 0
0 ≥ 0
0 ≥ 0
0 ≥ 0
0 ≥ 0
0 ≥ 0
0 ≥ 0
0 ≥ 0
-1 0 ≥ 0
1 1 ≥ 1
Denote:
a, b, c, d: The amount of ounces sold of product A, B, C, D
x,y: The amount of material producing input1 and input2
Objective:
Revenue= 18a +24b +11c +7d
Cost= a +8b +4c +5d +8x +10y
Profit= 17a +16b +7c +2d -8x -10y
Constrains:
a≤5000
b≤5000
2c -x +2a +b=0
2d -y +a +2b=0
0.8c +1.2d -a -0.8b ≤0
a +0.8b -0.8c -1.2d ≤1000
2x +2y +2a +3b +c +d ≤6000
a,b,c, d, x, y ≥0

VARIABLE DECISION a b c d
1158.4158 0 198.0198 0
17 16 7 2
OBJECTIVE FUNCTION 6366.34
CONSTRAINS
1 1
2 1
3 -1 -0.8 0.8 1.2
4 2 3 1 1
5 1 0.8 -0.8 -1.2
6 2 1 2
7 1 2 2
Input1 Input2
Raw material x y
Inputs Processing time 2x 2y
Outputs Oz of input 2x 3y
Processing cost 2x 4y
Cost Material cost 6x 6y
Process1 Process2
Product A B
Quantity of product a b
Outputs Produced waste a 0.8b
Input1 2a b
Input2 a 2b
Inputs Run processing time 2a 3b
Cost Runing cost a 8b
Product C Product D
Outputs Quantity of product c d
Input1 2c
Input2 2d
Liquid Waste 0.8c 1.2d
Inputs Processing time c d
Cost Producing cost 4c 5d
x y
1356.43564356436 386.138613861386
-8 -10

0 <=
0 <=
0 <=
2 2 0 <=
0 <=
-2 0 =
-3 0 =
5000
5000
0
6000
1000
0
0
Denote: 
X1: the amount of high-fat milk used to cream cheese product
X2: the amount of low- fat milk used to cream cheese product
X3: the amount of high-fat milk used to produce cream to cream cheese
X4: the amount of low-fat milk used to produce cream to cream cheese
Y1: the amount of high-fat milk used to cottage cheese product
Y2: the amount of low-fat milk used to cottage cheese product
Y3: the amount of high-fat milk used to produce cream to cottage cheese
Y4: the amount of low-fat milk used to produce cream to cottage cheese

Cream cheese Cottage cheese


High- fat milk X1 Y1
Low- fat milk X2 Y2
High-fat milk → cream X3 → 0,6X3 Y3 → 0,6Y3
Low-fat milk → cream X4 → 0,3X4 Y4 → 0,3Y4
Milk X1+X2 Y1+Y2
Cream  0,6X3+0,3X4 0,6Y3+0,3Y4
Inputs= Milk + Cream X1+ X2+ 0,6X3+ Y1+Y2+0,6Y3+0,3Y4
Output  X1+ X2+ 0,6X3+ 0,9*(Y1+Y2+0,6Y3+0,3Y4)

MODEL: 
Cost: 
0,8*( X1+Y1+X3+Y3)+ 0,4*( X2+X3+2X4+Y2+Y3+2Y4) + 0,4*( X1+X2+0,6X3+0,3X4)+ 0,36*
1,2X1+ 0,8X2+ 1,44X3+ 0,92X4+ 1,16Y1+ 0,76Y2+ 1,416Y3+ 0,908Y4
REVENUE: = 1,5*( X1+X2+0,6*X3+0,3*X4)+ 1,2*0,9*( Y1+Y2+0,6Y3+0,3Y4) 
Objective function: 
Max P :       =  Revenue- Cost
                  = 0,3X1+0,7X2-0,54X3-0,47X4 - 0,08Y1+0,32Y2-0,768Y3-0,584Y4
Constraints:  
0,6X1+0,3X2 >= 0,5( X1+X2)
0,6Y1+ 0,3Y2 >= 0,35( Y1+Y2) 
0,6X3+ 0,3X4 >= 0,4( X1+ X2+ 0,6X3+ 0,3X4)
0,6Y3+0,3Y4 >= 0,2( Y1+Y2+0,6Y3+0,3Y4)
X1+ X2+ 0,6X3+ 0,3X4 >= 1000
X1+ X2+ 0,6X3+ 0,3X4 <=1500
0,9(Y1+Y2+0,6Y3+0,3Y4 ) >= 1000
0,9( Y1+Y2+0,6Y3+0,3Y4) <= 2000
X3+X4+Y3+Y4 <= 2000
X1,X2,X3,X4,Y1,Y2, Y3, Y4 >= 0 

VARIABLE DECISION X1 X2 X3
400 200 666.66667
COST 2859.2592592593
REVENUE 2700
MAX -159.25926
CONSTRAINS
1 0.1 -0.2
2
3 0.4 0.4 -0.36
4
5 1 1 0.6
6 1 1 0.6
7 1 1 0.6
8
9
10 1
X3+0,3X4)+ 0,36* ( Y1+Y2+0,6Y3+0,3Y4) 
X4 Y1 Y2 Y3
0 148.148148148148 740.740740740741 370.37037

0.25 -0.05
-0.18
0.2 0.2 -0.48
0.3 1 1 0.6
0.3
0.3
0.9 0.9 0.54
0.9 0.9 0.54
1 1
Y4
0

0 >= 0
0 >= 0
0 <= 0
-0.24 0 <= 0
0.3 0 <= 3000
0 >= 1000
0 <= 1500
0.27 0 >= 1000
0.27 0 <= 2000
1 0 <= 2000
Denote:
Xt : number of sailboats are produce by regular-time labor during quarter t (t=1,2,3,4)
Yt  : number of sailboats are produce by over-time labor during quarter t (t=1,2,3,4)
It : inventory at quarter t
Dt: demand at quarter t 
Objective function:
min z= Cx*ΣXt + Cy*ΣYt + h*ΣIt = 400*(X1 + X2 + X3 + X4) + 450*(Y1 + Y2 + Y3 + Y
Constraints:
It= It-1 +Xt  + Yt - Dt 
I1 = 10+ X1 + Y1 -40
I2 = I1 + X2 + Y2 -60
I3 = I3+ X3 + Y3 -75
I4 = I3+ X4 + Y4 -25
Xt<= 40
Xt, Yt, It >= 0  

VARIABLE DECISION x1 x2 x3 x4
40 40 40 25
DEMAND 40 60 75 25
COST/SAILBOAT 400 400 400 400
OBJECTIVE FUNCTION 78450
CONSTRAINTS 1
1
1
1
(t=1,2,3,4)

2
+ Y3 + Y4) + 20*(I1 + I2 + I3 + I4) 

y1 y2 y3 y4 i1 i2 i3
0 10 35 0 10 0 0

450 450 450 450 20 20 20

1
1
1
1
1
1
1
i4
0

20

0 <= 40 <= 40
0 <= 40 <= 40
0 <= 40 <= 40
0 <= 25 <= 40
0 <= 0
0 <= 10
0 <= 35
0 <= 0
0 <= 10
0 <= 0
0 <= 0
1 0 <= 0

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy