Documenti di Didattica
Documenti di Professioni
Documenti di Cultura
ENGINEERING IDEAS
GRAPHICAL METHOD
Budi Halomoan Siregar, S.Pd.,M.Sc
By :
Putri Indah Lestari (4163312022)
Bilingual Mathematics Education 2016
MATHEMATICS DEPARTEMENT
FACULTY OF MATHEMATICS AND NATURAL
SCIENCES
STATE UNIVERSITY OF MEDAN
2018
PREFACE
Alhamdulilah, praise and gratitude I pray the presence of Allah SWT, because thanks
to His grace and grace, I can complete engineering ideas task course LINEAR
PROGRAMMING by lecturer sir Budi Halomoan Siregar, S.Pd.,M.Sc, I hope with the
existence of this engineering ideas can be useful to add insight and our knowledge of Graphical
Method
But I realize that this task is far from perfection. Therefore, I strongly expect
constructive advice and criticism from readers for the perfection of this task. Before I also
apologize if there are mistakes - words that are less amused readers heart. Finally I say thank
you, hopefully can be useful and can increase knowledge for readers.
Author
i
TABLE OF CONTENT
PREFACE............................................................................................................................................... i
TABLE OF CONTENT ........................................................................................................................ ii
CHAPTER I .......................................................................................................................................... 1
INTRODUCTION................................................................................................................................. 1
1.1 BACKGROUND ................................................................................................................... 1
1.2 PURPOSE .............................................................................................................................. 1
CHAPTER II ......................................................................................................................................... 2
DISCUSSION ........................................................................................................................................ 2
2.1 GENERAL PROBLEM IN LINEAR PROGRAMMING ................................................ 2
2.2 SOME EXCEPTIONAL CASES IN GRAPHICAL METHOD ....................................... 8
2.2.1. Alternative Optimal Solution ....................................................................................... 8
2.2.2. Infeasible(or non-existing) solution ........................................................................... 13
2.2.3. Unbounded solution .................................................................................................... 16
ii
CHAPTER I
INTRODUCTION
1.1 BACKGROUND
Linear programming in general is one technique for completing special
operations research to solve optimization problems (maximizing or minimizing) but
only limited to problems that can be converted into linear functions. In particular, linear
program problems are a matter of determining the amount of each variable value so that
the value of a linear objective or objective function becomes optimum (maximizing or
minimizing) by observing the existing constraints, namely constraints that must be
expressed in the form of linear inequalities. In this paper will discuss the graphical
methods contained in linear programs. Graph method is one method that can be used to
solve linear programming problems. Graph method is also used to solve optimization
problems in linear programs. This method uses a graphical approach in decision making,
where all constraint functions are made in one part of the image and then the optimum
decision is taken.
1.2 PURPOSE
To train students' skills in making problems
To train students’ in use autograph aplication
To train students’ in use lingo aplication
To train students’ in use Lips aplication
To train Students’ in use Tora Aplication
1
CHAPTER II
DISCUSSION
2.1 GENERAL PROBLEM IN LINEAR PROGRAMMING
Example from book
2
Problem :
sebuah ternak sapi yang mengelolah susu memproduksi keju untuk menambahkan
keungtungannya. untuk membuat keju tersebut dibutuhkan susu dan tenaga kerja yang
bekerja setiap harinya untuk memerah susu dah membuat keju. Maksimum susu yang di
perah setiap harinya sebanyak 60 liter. dan minumum keju yang dihasilkan sebanyak 10
kg, dengan tenaga kerja maksimal 80 jam per harinya,
dengan data dibawah ini
dengan keuntungan susu dan keju berturut-turut adalah $12 dan $16
Solution :
Menentukan variabel
susu = x, keju = y
Fungsi tujuan
3
x + 3y ≤ 60 (susu)
2x + 3y ≤ 90 (Tenaga Kerja)
y ≥ 10
Syarat Non-Negativ
4
Solution Using LiPS
5
Write the equation like picture below
6
Solution Using Tora
Input the tittle and the how many your equation and then enter
Enter the equation like picture below and then Click SOLVE menu
7
The Result will be out
8
untuk masing-masing keranjang tidak diperbolehkan memasukan warna lebih
dari 6 warna,
banyaknya keranjang hijau dan kuning berturut-turut adalah 10 dan 10
keranjang,
total bola warna adalah lebih dari 150 bola,
terdapat 3 bola pada keranjang hijau dan 9 bola pada keranjang kuning yang
disebar secara acak pada awal permainan dimulai,
jumlah bola warna yang disebar secara acak berjumlah 27.
dimana :
satu anak haya dapat melempar 1 bola pada keranjang kuning dan 1 bola pada keranjang
hijau,
tentukan maksimum banyaknya bola yang akan masuk pada keranjang
Solution :
Menentukan variabel :
keranjang hijau = x, keranjang kuning = y
Fungsi Tujuan :
Max Z = x + y
Fungsi Kendala :
x + y ≥ 6 (banyaknya warna tiap keranjang)
3x +9y ≥ 27 (banyaknya bola di keranjang pada awal permainan)
10x + 10y ≤ 150 (total bola)
x,y ≥ 0
9
Solution Using Lingo
10
Write the equation like picture below-Run
11
Solution Using Tora
Input the tittle and the how many your equation and then enter
Enter the equation like picture below and then Click SOLVE menu
12
The Result will be out
13
Untuk dekorasi lorong sang pengantin menginginkan perbandingan 5 : 7 dengan jumlah
tidak kurang dari 210
Hiunglah pembuatan daun dan bunga tertinggi untuk masalah tersebut
Solution :
yang memiliki fungsi kendala:
3x + 5y ≤ 75
8x + 12 y ≤ 240
5x + 7y ≥ 210
10x + 16 y ≥ 320
x,y ≥ 0
Solution Using Autograph
14
Solution Using LiPS
15
Enter the equation-Run
16
Click linear programming-go to input screen
Input the tittle and the how many your equation and then enter
Enter the equation like picture below and then Click SOLVE menu
17
2.2.3. Unbounded solution
Problem :
Sebuah rumah produksi jilbab memproduksi jilbab dengan mutiara yang berbeda-beda
dan jenis kain yang berbeda pula.
Jenis kain yang di produksi berupa wolpiece dan polly coton,
Wolpiece 1 dengan mutiara putih
Pollycoton 1 dengan mutiara putih
Sedangkan terdapatnya perintaan pasar,yaitu
10 buah wolpiece dengan jumlah mutiara 10 buah
8 buah pollycotton dengan jumlah kurang dari 64 buah
Dan satu buah wolpiece dengan mutiara sebanyak 6 buah
Hitunglah keuntungan jika harga jual wolpiece dan polycotton dengan mutiara masing-
masing adalah Rp 2000
fungsi kendala:
Max Z = 2x + 2y
memiliki kendala:
8x ≤ 64
x≥6
10y ≥ 10
x,y ≥ 0
18
Solution UsingAutograph
19
Click File-Text Model
20
Solution Using Tora
Input the tittle and the how many your equation and then enter
Enter the equation like picture below and then Click SOLVE menu
21
The Result Will be out
22