You are on page 1of 5

TUGAS RISET OPERASI DAN OPTIMALISASI

Mata Kuliah:
Riset Operasi dan Optimalisasi

Oleh :
M Syujuan Al Khotasa

(4312 100 085)

Ardi Prasetia Yanuar

(4312 100 086)

Yusron Abdillah

(4312 100 )

Bima

(4312 100 )

Clinton Sibuea

(4312 100 )

M Yuli Pradana

(4312 100 )

JURUSAN TEKNIK KELAUTAN FAKULTAS TEKNOLOGI KELAUTAN


INSTITUT TEKNOLOGI SEPULUH NOPEMBER SURABAYA
2013 / 2014

PREFACE

Nowadays, many people have many choices in their lives. A lot of options must be
chosen to fulfill their needs. Every choice have two main elements, there are act and
outcome. Everything which has been taken by someone must be a great and important
thing. When the choice is not sure to be taken, it should be an opportunity for another choice.
On the other hand, taking decision in some cases usually have many difficulties in
many parts of them. Every decision making generally have different action to face it. So, we
should have a great step to make it, for example using simplex method. This table will help
us to do decision making in every condition in our lives.
By this paper, we would like to show that we can use this way to do decision making
and every table will have different value because it depends on the percentage which we
given to it.

Linear Programming
Linear Programming is a mathematical method for determining it way to achieve the
best result (such as maximum profit or minimum cost) in a given mathematics model for
some list of requirements represented as linear relation. In the other words, linear
programming is a technique for the optimization of a linear objective function, subject to
linear equality and linear inequality constraints.
It is feasible region is a convex polyhedron, which is a set defined as the intersection
of finitely many half spaces, each of which is defined by a linear inequality. Its objective
function is a real-valued affine function defined on this polyhedron. A linear programming
algorithm finds a point in the polyhedron where this function has the smallest (or largest)
value if such a point exists.
Linear Programming is quietly important because of three main reasons. The first one
is, the problems like non-linear problem which is usually can be solved by making nonlinear becoming linear and solving by concept and process of linear programming. Second,
the technique in linear programming often use in developing non-linear technique in more
complex way. Third, research about linear programming is giving support in developing
mathematics programming methods.
Simplex Method
The simplex method is a method for solving problems in linear programming. The
simplex method is very efficient in practice, generally taking

to

iterations at most

(where is the number of equality constraints), and converging in expected polynomial time
for certain distributions of random inputs. However, its worst-case complexity is exponential,
as can be demonstrated with carefully constructed examples. A different type of methods for
linear programming problems are interior point methods, whose complexity is polynomial for
both average and worst case. These methods construct a sequence of strictly feasible points
(i.e., lying in the interior of the polytope but never on its boundary) that converges to the
solution.
Simplex Method is working in two steps. First step is try to getting the result (basic
feasible solution) usually given by the changing. Second step is doing reversible basic
changing to non-basic in systematic way, doing this step until getting the combination af the
changing.

Study Case
PT LAQUNATEKSTIL is a drapery factory which is produce two kinds of products.
There are silk and wool. In order to produce both of them, they need primary ingredient
which called yarn and worker. The maximum supply which did by the factory are 30 kg per
day and machine who working in 18 hour per day. Every unit will be made by that stuff that
can be seen on the table:

Main Ingredient

Amount of main ingredient and time to


Maximum Supply

work

and Worker

Silk
2
2

Yarn
machine

Wool
3
1

30 kg
18 hours

Both of those produce can make 40 million rupiah for fried cassava and 30 million
rupiah cassava chips. On the other hand, there is a problem in how to determine the amount
of the product which will be produced every day in order to make the income maximum.
X1 = Silk
X2 = Wool
Fungsi tujuan (maksimumkan)
Z = 40 X1 + 30 X2
Fungsi Kendala
g1 : 2X1 + 3X2 30 g1 : 2X1 + 3X2 + X3 = 30
g2 : 2X1 + X2 18 g2 : 2X1 + X2 + X4 = 18
Metode Simplex
Table simplex
Iterasi ke - 0
BV
X3
X4
Z

X1
2
2
40

X2
3
1
30

X3
1
0
0

X4
0
1
0

R
30
18
0

Nilai terkecil

A (0,0) Z = 0
Iterasi ke 1
BV
X1
X2
X3
0
2
X1
1
1/2
Z
0
10
B (9,0) Z 360 = 0, Z = 360

X3
1
0
0

X4
-1
1/2
-20

R
12
9
360

(X3 2X1)
(X4/2)
Z 360

X4
-1/2
3/4
-15

R
6
6
420

(X3/2)
(X1 1/2X2)
Z 420

Iterasi ke -2
BV
X1
X2
X3
X2
0
1
1/2
X1
1
0
-1/4
Z
0
0
-5
C (6,6) Z 420 = 0, Z = 420 (nilai optimum)

Conclusion
Optimization method shows that 2nd Iteration can make the maximum value. So, the
conclusion is PT LAQUNATEKSTIL must produce 6 unit of silk per day and 6 unit of wool
per day to get the optimum profit at 420 million rupiah.

You might also like