Scribd
Upload
32 views5 pages

DV X1 2 X2 6 Constrant x1 4 x2 6 3X1+2X2 18 18 x1 0 x2 0 OF 36

This document describes a linear programming problem to maximize profit given production constraints. It aims to maximize the objective function Z = $40x1 + $50x2 by determining the optimal values of x1 and x2, while adhering to constraints on labor hours (x1 + 2x2 ≤ 40) and clay usage (4x1 + 3x2 ≤ 120), with non-negativity constraints on x1 and x2.

Uploaded by

Arbi Kaca
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
32 views5 pages

DV X1 2 X2 6 Constrant x1 4 x2 6 3X1+2X2 18 18 x1 0 x2 0 OF 36

This document describes a linear programming problem to maximize profit given production constraints. It aims to maximize the objective function Z = $40x1 + $50x2 by determining the optimal values of x1 and x2, while adhering to constraints on labor hours (x1 + 2x2 ≤ 40) and clay usage (4x1 + 3x2 ≤ 120), with non-negativity constraints on x1 and x2.

Uploaded by

Arbi Kaca
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/ 5

DV

X1 2
X2 6

Constrant

x1 ≤ 4
x2 ≤ 6
3X1+2X2 ≤ 18 18
x1 ≥ 0
x2 ≥ 0

OF 36
DV
X1 X2 Maximize Z = $40 x1 + 50 x2
0 0

ST Subject to
1 2 0≤ 40 x1 + 2x2 40 hr(labor con
4 3 0≤ 120
4x1 + 3x2 120 lb (clay c
OF x1 , x2 0
40 50 0
mize Z = $40 x1 + 50 x2

ct to
+ 2x2 40 hr(labor constraint)
1 + 3x2 120 lb (clay constraint)
x1 , x2 0
DV
Demand
1 2 3 4
1 0 10 25 0
Supply 2 45 0 5 0
3 0 10 0 30

ST 1 1 1 1 35 ≤ 35
1 1 1 1 50 ≤ 50
1 1 1 1 40 ≤ 40
45 20 30 30
≥ ≥ ≥ ≥
45 20 30 30

OF 8 6 10 9
9 12 13 7
14 9 16 5
1020

You might also like