Scribd
Upload
55 views11 pages

Assembly Line 1 10x + 10x 100

The document presents a linear programming model to maximize total profit (Z) by producing two products (x and y) given constraints on resources. The objective is to maximize Z = 5x + 8y. There are four constraints: (i) 3x + 5y <= 50, (ii) 2x + 4y <= 40, (iii) x <= 8, and (iv) y <= 10. The optimal solution is x = 8, y = 5.2, which yields a maximum profit Z of 81.6.

Uploaded by

JM Bulahan
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
55 views11 pages

Assembly Line 1 10x + 10x 100

The document presents a linear programming model to maximize total profit (Z) by producing two products (x and y) given constraints on resources. The objective is to maximize Z = 5x + 8y. There are four constraints: (i) 3x + 5y <= 50, (ii) 2x + 4y <= 40, (iii) x <= 8, and (iv) y <= 10. The optimal solution is x = 8, y = 5.2, which yields a maximum profit Z of 81.6.

Uploaded by

JM Bulahan
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/ 11

Assembly Line 1 X1 X2

10x1 + 10x2 = 100


Company Product 1 Product 2
Number of units to produce 3 7
Assembly Line 2 Profit 6 4
7x1 + 3x2 = 42 Assembly Line 1 10 10
Assembly Line 2 7 3

x1 3
x2 7
P 46

Assembly Line 1 0 10
10 0

Assembly Line 2 0 14
6 0

PROFIT 0 11.5
7.666666667 0
Total Constraint Available/ Max Slack Variable

46
100 <= 100 100
42 <= 42 42
16
MAX Z= 6X1 + 4X2
14
where
12 x1= 3
x2= 7
10
100 7x1 + 3x2 = 42
8
100
6
42 10x1 + 10x2= 100
4
42
2

46 0
0 2 4 6 8 10 12
46

Assembly Line 1 Assembly Line 2 PROFIT


+ 10x2= 100

10 12

FIT
Linear Programming Model
Maximize Z = $400x + $100y
Subject to: Total
8x + 10y <= 80 (Labor) Chairs Tables
(LHS)
2x + 6y <= 36 (Wood)
x <= 6 (Demand Chairs)
x => 0 Number of units produce 0 0
y =>0 Profit 400 100 0
where: Wood 2 6 0
x = number of Chairs to produce
y = number of Tables to produce Labor 8 10 0
Demand 1 0 0
AVAILABL
SLACK
CONSTRAINT E /MAX
(RHS) VARIABLE

<= 36
<= 80
<= 6
Linear Programming Model
Maximize Z = $400x + $100y Chairs Tables Total
Subject to: (LHS)
8x + 10y <= 80 (Labor) Number of units produce
2x + 6y <= 36 (Wood) Profit 400 100
x <= 6 (Demand Chairs) Wood 2 6
x => 0
y =>0 Labor 8 10
where: Demand 1 0
x = number of Chairs to produce
y = number of Tables to produce
CONSTRAINT AVAILABLE /MAX SLACK VARIABLE
(RHS)

<= 36
<= 80
<= 6
Linear Programming Model
Maximize Z = $400x + $100y
Subject to: Chairs Tables Total
8x + 10y <= 80 (Labor)
2x + 6y <= 36 (Wood) Number of units produce
x <= 6 (Demand Chairs) Profit 400 500 0
x => 0
y =>0 Wood 2 6 0
where: Labor 8 10 0
x = number of Chairs to produce Demand 1 0 0
y = number of Tables to produce
Constraits AVAILABLE /MAX SLACK VARIABLE

<= 36
<= 80
<= 6
Linear Programming Model
Maximize Z = 5x + 8y x y Total Constraits
Subject to:
3x + 5y <= 50 Number of units produce 8 5.2
2x + 4y <= 40 Maximize Z 5 8 81.6
x <= 8 3 5 50 <=
y <= 10 i
x => 0 ii 2 4 36.8 <=
y =>0 iii 1 0 8 <=
iv 0 1 5.2 <=
AVAILABLE /MAX SLACK VARIABLE

50
40
8
10

You might also like