0% found this document useful (0 votes)
6 views11 pages

Simplex Method for Furniture Profit Optimization

The document outlines the production process and profit maximization strategy for el SAMÁN Ltda., a furniture manufacturing company. It details the requirements for producing tables, chairs, beds, and libraries, along with their costs and selling prices. The objective function and constraints for maximizing profits through the Simplex Method are also provided, leading to an optimal production plan.

Translated by

ScribdTranslations
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
6 views11 pages

Simplex Method for Furniture Profit Optimization

The document outlines the production process and profit maximization strategy for el SAMÁN Ltda., a furniture manufacturing company. It details the requirements for producing tables, chairs, beds, and libraries, along with their costs and selling prices. The objective function and constraints for maximizing profits through the Simplex Method are also provided, leading to an optimal production plan.

Translated by

ScribdTranslations
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd

z

Simplex Method

The company el SAMÁN Ltda. dedicated to the manufacture of furniture has


expanded its production by two more lines. Therefore, currently
I make tables, chairs, beds, and bookshelves. Each table requires 2
rectangular pieces of 8 pins, and 2 square pieces of 4 pins. Each
chair requires 1 rectangular piece of 8 pins and 2 square pieces of
4 pins, each bed requires 1 rectangular piece of 8 pins, 1
square with 4 pins and 2 trapezoidal bases of 2 pins, and finally
each library requires 2 rectangular pieces of 8 pins, 2 bases
trapezoidal with 2 pins and 4 rectangular pieces with 2 pins each. Each table
It costs $10,000 to produce and sells for $30,000, each chair costs
It costs $8000 to produce and is sold for $28000, each bed costs to produce
$20,000 and it sells for $40,000, each library costs $
40000 and sold for $60000. The goal of the factory is to maximize
the profits.
z
Requirement of parts per product

Parts Pieces Bases Parts


rectangular square trapezoidal rectangular
of 8 pins 4 pines of 2 pins of 2 pins

Tables 2 2 0 0
Chairs 1 2 0 0
Beds 1 1 2 0
Libraries 2 0 2 4
Inventory 24 20 20 16
z
Objective Function:
ZMAX=20000X1+20000X2+20000X3+ 20000X4

Variables Restrictions
. X1=Number of tables to . 2X1+1X2+ 1X3+ 2X4<= 24
produce (units)
. 2X1+2X2+ 1X3<= 20
. X2=Number of chairs to
. 2X3+ 2X4<= 20
produce (units)

. X3=Number of beds to . 4X4<= 16

produce (units) . X >= 0


. X4=Number of libraries to
produce (units)
z
Initial solution

CJ 20000 20000 20000 20000 0 0 0 0

Cb Variable Solution Solution X1 X2 X3 X4 S1 S2 S3 S4

0 S1 24 2 1 1 2 1 0 0 0

0 S2 20 2 2 1 0 0 1 0 0

0 S3 20 0 0 2 2 0 0 1 0

0 S4 16 0 0 0 4 0 0 0 1

Zj 0 0 0 0 0 0 0 0 0

Cj-ZJ 20000 20000 20000 20000 0 0 0 0


z
Variable that will exit and which will enter the solution
optimum

Fila Solution (B) X4 (A) B/A


1 24 2 12
2 20 0
3 20 2 10
4 16 4 4
CJ 20000 20000 20000 20000 0 0 0 0

Cb Variable Solution Solution X1 X2 X3 X4 S1 S2 S3 S4

0 S1 24 2 1 1 2 1 0 0 0

0 S2 20 2 2 1 0 0 1 0 0

0 S3 20 0 0 2 2 0 0 1 0

0 S4 16 0 0 0 4 0 0 0 1

Zj 0 0 0 0 0 0 0 0 0

Cj-ZJ 20000 20000 20000 20000 0 0 0 0

Incoming variable

S416 0 0 0 4 0 0 0 1

X416/4 0/4 0/4 0/4 4/4 0/4 0/4 0/4 1/4


X4 4 0 0 0 1 0 0 0 0.25
Values corresponding to row 1

Row X4 * -a (the value of a for row 1 is 2) –a = -2

Fila4*(-2) 0*(-2) 0*(-2) 0*(-2) 1*(-2) 0*(-2) 0*(-2) 0*(-2) 0.25*(-2)


T1
Row -8 0 0 0 -2 0 0 0 -0.5
T1

Previous S124 2 1 1 2 1 0 0 0

+
Temporal Fila T -8 0 0 0 -2 0 0 0 -0.5

=
New S116 2 1 1 0 1 0 0 -0.5
Values corresponding to row 2

a is equal to 0, therefore the values remain the same.

Values corresponding to row 3


Row X4 * -a (the value of a for row 3 is 2) –a = -2

Row T3 4*(-2) 0*(-2) 0*(-2) 0*(-2) 1*(-2) 0*(-2) 0*(-2) 0*(-2) 0.25*(-2)
Fila T3 -8 0 0 0 -2 0 0 0 -0.5

Previous S320 0 0 2 2 0 0 1 0

+
Temporal Row T3 -8 0 0 0 -2 0 0 0 -0.5

=
New S312 0 0 2 0 0 0 1 -0.5
Tabla actualizada

CJ 20000 20000 20000 20000 0 0 0 0

Cb Variable Solution Solution X1 X2 X3 X4 S1 S2 S3 S4

0 S1 16 2 1 1 0 1 0 0 -0.5
0 S2 20 2 2 1 0 0 1 0 0
0 S3 12 0 0 2 0 0 0 1 -0.5
20000 X4 4 0 0 0 1 0 0 0 -0.25
Zj 0 0 0 0 0 0 0 0 0
Cj-ZJ 20000 20000 20000 20000 0 0 0 0

Calculate value Zj, the same is done with each column

Cb Solution cb*Solution(Zj)
0 16
0
0 20
0
0 12
0
2000 4
80000
Tabla actualizada

CJ 2000 2000 2000 2000 0 0 0 0

Variable
Cb Solution X1 X2 X3 X4 S1 S2 S3 S4
Solution

0 S1 16 2 1 1 0 1 0 0 -0.5

0 S2 20 2 2 1 0 0 1 0 0

0 S3 12 0 0 2 0 0 0 1 -0.5

20000 X4 4 0 0 0 1 0 0 0 -0.25

Zj 80000 0 0 0 20000 0 0 0 5000

Cj-ZJ 20000 20000 20000 0 0 0 0 -5000

Redefine identity matrix

2 1 1 016 1 0 0 0 3
2 2 1 020 0 1 0 0 4
0 0 2 0 12 0 0 1 0 6
0 0 0 1 4 0 0 0 1 4
Utility
CJ 20000 20000 20000 20000

Cb Variable Solution Solution X1 X2 X3 X4

20000 X1 3 1 0 0 0
20000 X2 4 1 1 0 0
20000 X3 6 0 0 1 0
20000 X4 4 0 0 0 1
Zj 340000 40000 20000 20000 20000
Cj-ZJ -20000 20000 20000 20000

Product Cb and Solution

Utilidad= (20000*3)+(20000*4)+(20000*6)+(20000*4)= 340000

X1= 3 months
X2= 4 Chairs
X3= 6 Beds
X4 = 4 Libraries

You might also like