Scribd
Upload
62 views9 pages

Exercise

The document contains several examples of linear programming problems with variables, constraints and objectives. Example 1 shows calculations with variables X and Y. Example 2 is a transportation problem with supply and demand constraints. Example 3 is another linear programming problem with multiple variables and constraints. The last example is a production planning problem to maximize profit under capacity constraints.

Uploaded by

Pyae Thinzar Mone
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
62 views9 pages

Exercise

The document contains several examples of linear programming problems with variables, constraints and objectives. Example 1 shows calculations with variables X and Y. Example 2 is a transportation problem with supply and demand constraints. Example 3 is another linear programming problem with multiple variables and constraints. The last example is a production planning problem to maximize profit under capacity constraints.

Uploaded by

Pyae Thinzar Mone
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

Example 1

X Y calculation
2 3
obj 6 5 27

constraints milk 1 1 5 5
choco 3 2 12 12

Example 2
M1 M2 M3 M4 Supply
S1 10 2 20 11 15
S2 12 7 9 20 25
S3 4 14 16 18 10
Demand 5 15 15 15

assume number of units demand should be equal supply should be equal or less than
M1 M2 M3 M4 Supply
S1 0 5 0 10 15
S2 0 10 15 0 25
S3 5 0 0 5 10
Demand 5 15 15 15

Min Cost 435

Example
F1 F2 F3 Supply
D1 5 8 5 2000
D2 7 6 4 2000
D3 9 4 3 1000
Demand 1000 1500 2500 5000

F1 F2 F3 Supply
D1 1000 0 1000 2000
D2 0 500 1500 2000
D3 0 1000 0 1000
Demand 1000 1500 2500 5000
Min Cost 23000

Example 3
P1 P2 C1 C2 C3
W1 0 4 3 4 5
W2 5 2 2 1 3
Demand 18000 6000 50,000 80,000 50,000

P1+P2 to each W P1 P2 C1 C2 C3
0 W1 0 0 0 0 0
0 W2 0 0 0 0 0
Demand 0 0 0 0 0

Min Cost 0
e equal or less than
Total demand C1/2/3
0
0
Total Cost 47 Variable, Cost of strategy implementation
Budget 50

St1 St2 St3 St4


1 0 1 1
Strategy Importance/ Strategic score 4.7 3.85 3.3 3.9
Cost of strategy implementation 20 14 10 17

Obj 11.9
Variable, Strategic score

Constraints Variables should be Binary/ equal either 0 or 1


Total cost <= Budget

Total Cost 150


Budget 150
St1 St2 St3 St4
0 1 1 1
Importance weights 0.897 0.954 0.693 0.93
Costs 100 40 20 40

Obj 3.72
f strategy implementation

St5 St6 St7 St8 St9 St10


0 0 1 0 0 1
0.423 0.428 0.369 1.008 0.501 0.774
80 70 30 50 38 20
P1 P2 Max daily Demand of two products
1st 20 units 10 units 35 units
2nd 12 units 25 units
Profit 10 12

Solution
X1 = Production unit for product 1 (decsion variable)
X2 = Production unit for product 2 (decsion variable)
Y=1 if the first setting is selected otherwise 0 (two production setting/ need

Decision Variable
Constriants Max Profit = 10 X1 + 12 X2 Obj
Changing cell
P1 X1 + X2 <= 35 units Constraint 1
P2 X1 (1st) - 8 Y =< 12 (2nd) Constraint 2
X2 (1st) + 15 Y =< 25 (2nd) Constraint 3
20 units - 8 (1) = 12 units
10 units + 15 (1) = 25 units
Y = 0,1
X1, X2 >= 0
d of two products

csion variable)
csion variable)
o production setting/ need to choose one/ decision variable)

X1 X2 Y Total Limit
10 12 0 0
0 0 0
1 1 0 0 35
1 0 -8 0 12
0 1 15 0 25
Goal Programing (constriants are variable)

Type Small Medium Large


Size 400 750 1050
Cost 18000 33000 45150

Constriants Small Medium Large Total Size Total Cost/ Budget


Real
Under
Over
Real total
Target

Deviation

You might also like