Академический Документы
Профессиональный Документы
Культура Документы
200x1
s s
1 1
1000
100 x1 400 x2 s
s 1200
2 2
250x2 s3 s3 800
1500x1 3000x2 15000
x ,s ,s 0
i
s
i i
Goal Programming Algorithms
Minimize Gi i=1,2….n
The combined objective function used in the weights
method is defined as
Minimize Z= w1G1 w2G2 .... wnGn
The parameters wi i=1,2,…n represents positive
Weights that reflect the decision maker’s preferences
regarding the relative importance of each goal.
Problem 2 Problem set 8.2 A page 353
Gi 1 G2 2 ..... Gn n
Set i =1.
Step i
G1 G2 G3
solution G1 -problem
Minimize G1 s1
Subject to the constraints
200x1 s1 s1 1000
100 x1 400 x2 s2 s2 1200
250x2 s3 s3 800
1500x1 3000x2 15000
Solving we get
s 0, s 0, s 362.5, x1 5, x2 1.75
1 2 3
200 x1 s s 1 1 1000
100 x1 400 x2 s s 2 2 1200
250 x2 s3 s3 800
1500 x1 3000 x2 15000
s
1 0
s 2 0
Solving we get
s 175, x1 5, x2 2.5
3