Scribd
Upload
20 views9 pages

B 16

Uploaded by

Trương Mỹ Hạnh

The document describes a linear programming problem with 4 variables (x1, x2, x3, x4) and 4 constraints. The objective is to maximize Z = 50x1 + 80x3. The optimal solution is x1 = 3, x3 = 2, x2 = x4 = 0, with an objective value of 310. This satisfies all constraints and maximizes the objective function.

Copyright:

© All Rights Reserved
Download as XLSX, PDF, TXT or read online from Scribd
Download as xlsx, pdf, or txt

B 16

Uploaded by

Trương Mỹ Hạnh
20 views9 pages
The document describes a linear programming problem with 4 variables (x1, x2, x3, x4) and 4 constraints. The objective is to maximize Z = 50x1 + 80x3. The optimal solution is x1 = 3, x3 = 2, x2 = x4 = 0, with an objective value of 310. This satisfies all constraints and maximizes the objective function.

Original Title

b16

Copyright

© © All Rights Reserved

Available Formats

XLSX, PDF, TXT or read online from Scribd

Did you find this document useful?

Is this content inappropriate?

The document describes a linear programming problem with 4 variables (x1, x2, x3, x4) and 4 constraints. The objective is to maximize Z = 50x1 + 80x3. The optimal solution is x1 = 3, x3 = 2, x2 = x4 = 0, with an objective value of 310. This satisfies all constraints and maximizes the objective function.

Copyright:

© All Rights Reserved
Download as XLSX, PDF, TXT or read online from Scribd
Download as xlsx, pdf, or txt
20 views9 pages

B 16

Uploaded by

Trương Mỹ Hạnh
The document describes a linear programming problem with 4 variables (x1, x2, x3, x4) and 4 constraints. The objective is to maximize Z = 50x1 + 80x3. The optimal solution is x1 = 3, x3 = 2, x2 = x4 = 0, with an objective value of 310. This satisfies all constraints and maximizes the objective function.

Copyright:

© All Rights Reserved
Download as XLSX, PDF, TXT or read online from Scribd
Download as xlsx, pdf, or txt
You are on page 1/ 9

Maximize

Objective function Z= 50x1 + 0x2 + 80x3 + 0x4

Constraint 1 x1 - x3 <= 2
Constraint 2 x1 + x4 <= 3
Constraint 3 x2 + x3 <= 2
Constraint 4 x3 - x4 <= 4

x1, x2, x3, x4 >= 0

Variables x1 x2 x3 x4
Value 3 0 2 0
Coefficient 50 0 80 0

Constraint 1 1 -1
Constraint 2 1 1
Constraint 3 1 1
Constraint 4 1 -1
Objective value
310

Left hand side Right hand side


1 <= 2
3 <= 3
2 <= 2
2 <= 4
Maximize
Objective fun Z= 50x1 + 0x2 + 80x3 + 0x4

Constraint 1 x1 - x3 <= 2
Constraint 2 x1 + x4 <= 3
Constraint 3 x2 + x3 <= 2
Constraint 4 x3 - x4 <= 4

x1, x2, x3, x4 >= 0

Variables x1 x2 x3 x4 Objective value


Value 3 2 0 0 13
Coefficient 3 2 -2 -1

Left hand side Right hand side


Constraint 1 1 0 1 -1 3 <=
Constraint 2 1 -1 0 1 1 <=
Constraint 3 1 1 -1 1 5 <=
Constraint 4 1 -1 0 <=
Right hand side
3
6
5
4
x y Objective value
Variables 0 2400 1200 Max
Coefficient 0.75 0.5
Left
Contraints 3 5 12000 <= 36800
2 1 2400 <= 2400
Machine time (hr) Finishing time (hr) Unit profit ($)
X 1 4 6
Y 2 4 8
Z 3 8 12
Machine time 900
Finishing time available 5000

Objective function: P= 6X + 8Y + 12Z


Contraint 1 X + 2Y + 3Z <= 900
Contraint 2 4X + 4Y + 8Z <= 5000
X Y Z Objective value
Variables 0
Coefficients 6 8 12

Left Hand side Right Hand Side


Contraint 1 1 2 3 0 <= 900
Contraint 2 4 4 8 0 <= 5000
x y z Objective value
Vriables 0 300 100 10800
Coefficients 21 24 36

Constraints 1 1 1 400 <=


1 1 2 500 <=
2 3 5 1400 <=
400
500
1450

You might also like