Scribd
Upload
24 views

Class 1-2

The document contains multiple examples of linear programming problems with decision variables, objective functions, and constraints. The problems involve optimization of variables like production quantities, staffing levels, and resource allocation under capacity limits.

Uploaded by

Deadpool
Copyright
© © All Rights Reserved
Available Formats
Download as XLSX, PDF, TXT or read online on Scribd
24 views

Class 1-2

The document contains multiple examples of linear programming problems with decision variables, objective functions, and constraints. The problems involve optimization of variables like production quantities, staffing levels, and resource allocation under capacity limits.

Uploaded by

Deadpool
Copyright
© © All Rights Reserved
Available Formats
Download as XLSX, PDF, TXT or read online on Scribd
You are on page 1/ 9

Tables(T) Chairs(C)

Decision var 320 360


Objective fun. (Profit) 7 5 4040
Constraints
Carpentary 3 4 2400 <= 2400
Painting 2 1 1000 <= 1000
Chairs 0 1 360 <= 450
No. of Table 1 0 320 >= 100

x y
decision var 7 1.5
Max profit eqn 4 5 35.5
Contraints
5 2 38 <= 40
3 6 30 <= 30
1 7 <= 7
2 -1 12.5 >= 3
1 1 8.5 >= 0

x1 x2

decision var 0 10
Equ 3 2 20
Constraints
1 1 10 >= 10
1 0 0 >= 0
0 1 10 >= 0
1 1 10 <= 20
0 1 10 <= 10
1 0 0 <= 18

17 inch 19 inch

decision var 0 240


Max profit eqn 300 250 60000
Contraints
30 10 2400 <= 2400
1 1 240 >= 40

x y
decision var
Max profit eqn
Contraints

Fuel Solvent

decision var 2.5 2


max profit eqn 40 30 160
constraints
mat1 4 5 20 <= 20
mat2 2 4 <= 5
mat3 6 3 21 <= 21

silk poly b1 b2

decision var 7000 13625 13100 8500


max profit eqn 3.45 2.32 2.81 3.25 120196
constraints
silk 0.125 0 0 0 875
poly 0 0.08 0.05 0.03 2000
cotton 0 0 0.05 0.07 1250
1 0 0 0 7000
0 1 0 0 13625
0 0 1 0 13100
0 0 0 1 8500
1 0 0 0 7000
0 1 0 0 13625
0 0 1 0 13100
0 0 0 1 8500

Age<=30 NM Age 31-50 NM Age>=51NM Age<=30 FM Age 31-50 FM

decision var 0 600 140 1000 0


min eqn 7.5 6.8 5.5 6.9 7.25
constraints
1 1 1 1 1
1 1
1 1
1 1 1
1
1

SA & Su Sa & Tue TUE & Wed MON & thu Tues & frid

Staff 10 7 20 0 0
wages 350 375 400 425 425
Cons
mon 1 1 1 1
tues 1 1
wed 1 1 1 1
thu 1 1 1 1
fri 1 1 1 1
sat 1 1 1
sun 1 1 1 1
75 % con 1 1
50% weekend 1 1

v s t d

0 380 0 1060
29 32 72 54 69400
cons
3 4 4 3 4700
2 2 4 3 3940
1 1 3 2 2500
1 0
1 380
1 0
1 1060

Decision Var T1 T2 R1 R2 N1

10 5 15 18 20
Ads Placed 90 55 25 20 10

Constraints
1
1
1
10000 10000 3000 3000 1000
1 1
3000 3000
-2 -2 1 1
10000 10000
1000

x11 x12 x13 x21 x22

200 0 300 200 200


coeff 10 20 15 12 15
cons
1 1 1
1 1
1 1
1 1
1
1
1
1
1
1

x1 x2

50 40
constraints
3 5 <= 150
1 <= 20
8 5 <= 300

x1 x2 x3

6 10 8 0

constraints
3 2 2 0 <=
0 4 5 0 <=
Tables(T) Chairs(C) Tables(T)
Decision va 500 0 Decision va 320
Objective f 11 5 5500 Objective f 9
Constraints 0 Constraints
Carpentary 3 4 1500 <= 2400 Carpentary 3
Painting 2 1 1000 <= 1000 Painting 2
Chairs 0 1 0 <= 450 Chairs 0
No. of Tabl 1 0 500 >= 100 No. of Tabl 1
<= 1000
<= 2000
<= 1250
<= 7000
<= 14000
<= 16000
<= 8500
>= 6000
>= 10000
>= 13000
>= 6000

Age>=51 FM

560
6.1 15166

1 2300 >= 2300


1000 >= 1000
600 >= 600
740 >= 345
1000 >= 500
140 <= 140

Thu & fri Sun & Thu Sun & Wed

0 3 0
400 375 375 15250
0
1 1 1 40 >= 22
1 1 1 13 >= 13
1 1 20 >= 15
1 37 >= 20
1 1 40 >= 18
1 1 1 23 >= 23
1 27 >= 27
1 30 >= 30
1 1 20 >= 20

< 4700
< 4500
< 2500
> 0
> 0
> 0
> 0

N2

10
5 2160

10 < 10
15 < 15
20 < 20
1000 279000 < 279000
15 < 20
99000 < 99000
3> 0
150000 > 140000
1000 30000 > 30000

x23

0
18 11900
500 <= 500
1 400 <= 400
400 = 400
200 = 200
1 300 = 300
200 >= 0
0 >= 0
300 >= 0
200 >= 0
200 >= 0
1 0 >= 0

y1 y2

50 80 0

3 0 6 >= 6
50 2 4 10 >= 10
80 2 5 8 >= 8
Chairs(C)
360
5 4680
0
4 2400 <= 2400
1 1000 <= 1000
1 360 <= 450
0 320 >= 100

You might also like