Paper of Linear Programming

ENGINEERING IDEAS

GRAPHICAL METHOD
Budi Halomoan Siregar, S.Pd.,M.Sc

By :
Khalishah Qatrunnada (4163312013)
Bilingual Mathematics Education 2016

MATHEMATICS DEPARTEMENT
FACULTY OF MATHEMATICS AND NATURAL
SCIENCES
STATE UNIVERSITY OF MEDAN
2018
PREFACE
Alhamdulillah, 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 Progamming” by
lecturer 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.

Medan, October 19th 2018

Author

i|Page
 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 ........................... 6

A. Alternative Optimal Solution ................................................................................... 6

B. Infeasible (or non existing) Solution ........................................................................ 8

C. Unbounded Solution................................................................................................ 10

ii | P a g e
 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 students model questions and solve problems using graphical methods
To help solve the problem with Autograph, Tora, LiPS, and Lingo

1|Page
 CHAPTER II

DISCUSSION
2.1 GENERAL PROBLEM IN LINEAR PROGRAMMING
A. Question From Book

2|Page
3|Page
 B. The Other Question
Perusahaan menggunakan kayu dan tenaga kerja untuk memproduksi meja dan
kursi. Ingat bahwa keuntungan unit untuk tabel adalah Rp 6.000.000 (dalam 1.000.000),
dan keuntungan unit untuk kursi adalah Rp 8.000.000 ( dalam 1.000.000). Ada 300
kayu yang tersedia dan 110 jam kerja yang tersedia. Dibutuhkan 30 kayu dan 5 jam
untuk membuat meja, dan 20 kayu dan 10 jam untuk membuat kursi. Tabel 1 berisi
informasi untuk masalah LP. Kami akan melalui proses selangkah demi selangkah
untuk menyelesaikan masalah ini secara grafis.
Sumber Daya Meja (x) Kursi (y) Tersedia
Kayu (kp) 30 20 300
Tenaga Kerja 5 10 110
Profit Unit Rp 6 Rp 8
Penyelesaian:
Maksimum z = 6x+8y
Kendala 30x + 20y ≤ 300
5x + 10y ≤ 110
x, y ≥ 0

4|Page
Using Autograph

Using Lingo

Using LiPS

The steps are as follows:

1. Open the LiPS Software and the display appears as shown below

5|Page
2. Click File >> New and then click Tabel (if you want make text, you can
choose text model)

3. And then the dialog box appears as shown below. Than change the number of
variable, number of constraint, number of objective, and the optimization
direction. After that click ok

4. The display appears below, then fill in the constraint and variable fields
available in the box

6|Page
 5. The result appear as shown below

Using Tora

The steps are as follows:

1) Open TORA Software

7|Page
2) Click ‘Click Here’ to make the software, and the choose Linear Proggaming

3) After that the dialog box appears, change the ‘N’ and ‘D’. Then click ‘Go to
Input Screen’

4) Write the title, number of variable, number of constraint, then enter

8|Page
 5) Input the data on the table, and them click solve menu

6) You can choose what do you want to solve

7) The result appear as shown below

2.2 SOME EXCEPTIONAL CASES IN GRAPHICAL METHOD

A. Alternative Optimal Solution
B. Infeasible (or non-existing) Solution
C. Unbounded Solution

9|Page
A. Alternative Optimal Solution
 Question From Book

 The Other Question

Dalam sebuah konser musik, terjual karcis kelas I dan kelas II. Tiket karcis kelas
I dan 2 tiket kelas II terjual sebanyak 5 lembar. Untuk tiket karcis kelas I dan
tiket karcis kelas II terjual sebanyak 4 lembar Harga tiket kelas I adalah Rp
200.000 dan tiket kelas II mendapatkan diskon menjadi Rp 400.000. Tentukan
keuntungan yang didapat dari penjualan karcis tersebut.
Jawab:
Maksimum z = 2x + 4y (dalam 100.000)
Fungsi Kendala x + 2y ≤ 5
x+y≤4
x, y ≥ 0

10 | P a g e
Using Autograph

Using Lingo

Using LiPS

The steps are as follows:

1) Open the LiPS Software and the display appears as shown below

11 | P a g e
2) Click File >> New and then click Tabel (if you want make text, you can choose
text model)

3) And then the dialog box appears as shown below. Than change the number of
variable, number of constraint, number of objective, and the optimization
direction. After that click ok

4) The display appears below, then fill in the constraint and variable fields
available in the box

12 | P a g e
 5) The result appear as shown below

Using Tora
The steps are as follows:
1) Open TORA Software

13 | P a g e
2) Click ‘Click Here’ to make the software, and the choose Linear Proggaming

3) After that the dialog box appears, change the ‘N’ and ‘D’. Then click ‘Go to
Input Screen’

4) Write the title, number of variable, number of constraint, then enter

5) Input the data on the table, and them click solve menu

14 | P a g e
6) You can choose what do you want to solve

7) The result appear as shown below

15 | P a g e
B. Infeasible (or non existing) Solution
 From Book

 The Other Question

Perusahaan sepatu “NIKE” membuat 2 macam sepatu. Macam pertama merk A
dengan sol dan karet, dan macam kedua merk B dengan sol dan kulit. Untuk
membuat sepatu-sepatu itu perusahaan memiliki 2 macam mesin. Mesin I
khusus membuat sol dari karet, dan mesin II khusus membuat sol dari kulit.
Setiap lusin sepatu merk A mula-mula dikerjakan di mesin I selama 1 jam, terus
dikerjakan di mesin II selama 3 jam. Sedang sepatu merk B di mesin I selama
2 jam kemudian di mesin II selama 3 jam. Sumbangan terhadap laba untuk
setiap lusin sepatu merk A= Rp 20.000,- sedang merk B=Rp 30.000,-.
Masalahnya adalah menentukan berapa lusin sebaiknya sepatu merk A dan
merk B yang dibuat agar bisa memaksimumkan laba.
A B
Mesin I 1 2
Mesin II 3 3
Sumbangan Laba Rp 20.000 Rp 30.000

16 | P a g e
Maksimum z = 2x + 3y ( dalam 10.000)
x + 2y ≤ 2
3x + 3y ≥ 12
x, y ≥ 0

Using Autograph

Using Lingo

17 | P a g e
Using LiPS

The steps are as follows:

1. Open the LiPS Software and the display appears as shown below

2. Click File >> New and then click Tabel (if you want make text, you can
choose text model)

3. And then the dialog box appears as shown below. Than change the number of
variable, number of constraint, number of objective, and the optimization
direction. After that click ok

18 | P a g e
4. The display appears below, then fill in the constraint and variable fields
available in the box

5. Click Run and the the result appears

19 | P a g e
Using Tora

The steps are as follows:

1) Open TORA Software

2) Click ‘Click Here’ to make the software, and the choose Linear Proggaming

3) After that the dialog box appears, change the ‘N’ and ‘D’. Then click ‘Go to
Input Screen’

20 | P a g e
4) Write the title, number of variable, number of constraint, then enter

5) Input the data on the table, and them click solve menu

6) You can choose what do you want to solve

7) The result appear as shown below

21 | P a g e
C. Unbounded Solution
 From Book

 The Other Question

Solusi tak terbatas (unbounded solution) terjadi ketika ada yang tidak
terbatas sumber daya. Cara yang baik untuk menjelaskan solusi tak terbatas
adalah menggunakan masalah kecil yang dapat diselesaikan secara grafis.
Pertimbangkan masalah linear program beririku ini:
Maksimum z = 2x + 2y
Kendala x – 2y ≤ 1
2x – y ≤ -2
x, y ≥ 0

22 | P a g e
 Using Autograph

Using Lingo

Using LiPS
The steps are as follows:

1. Open the LiPS Software and the display appears as shown below

23 | P a g e
2. Click File >> New and then click Tabel (if you want make text, you can
choose text model)

3. And then the dialog box appears as shown below. Than change the number of
variable, number of constraint, number of objective, and the optimization
direction. After that click ok

4. The display appears below, then fill in the constraint and variable fields
available in the box

5. Click Run and the the result appears

24 | P a g e
 Using Tora
The steps are as follows:
1) Open TORA Software

2) Click ‘Click Here’ to make the software, and the choose Linear Proggaming

25 | P a g e
3) After that the dialog box appears, change the ‘N’ and ‘D’. Then click ‘Go to
Input Screen’

4) Write the title, number of variable, number of constraint, then enter

5) Input the data on the table, and them click solve menu

26 | P a g e
6) You can choose what do you want to solve

7) The result appear as shown below

27 | P a g e