Linier programming

Intro

LP adalah sebuah metode tentang

pengalokasian sumber daya
(manusia, bahan, mesin dan
modal) untuk mendapatkan hasil
yang maksimal, baik berupa profit
yang maksimum atau biaya yang
minimum.
Komponen Dasar dalam LP

2. Objective (goal)
1. Decision variables 3. Constraints that
that we need to
that we seek to the solution must
optimize (maximize
determine. satisfy.
or minimize).
Hal penting mengenai kendala

Pertama, Kedua,
kendala yang kendala yang Ketiga,
berupa berupa syarat kendala yang
pembatas mengendalika berupa
mengendalika n nilai ruas kiri keharusan
Kendala n nilai ruas kiri agar tidak mengendalika
adalah yang agar tidak lebih kecil n nilai ruas kiri
mengendalika lebih besar daripada nilai agar nilainya
n variabel dari nilai ruas ruas sama dengan
keputusan. kanannya, kanannya, nilai ruas
maka maka kanannya ,
digunakan digunakan maka
pertidaksama pertidaksama digunakan
an dengan an dengan tanda “=“
tanda “≤” tanda “≥”
Asumsi pada LP
Proportionality is

Proporsionalitas
an assumption
about both the
objective function Every function in

Adivitas
and the functional a linear
constraints. programming
The contribution model (whether Decision variables

Divisibilitas
of each activity to the objective in a linear
the value of the function or the programming
objective function function on the model are The value

Kepastian(Certainty)
Z is proportional left-hand side of a allowed to have
functional assigned to each
to the level of the any values, parameter of a
activity xj, as constraint) is the including
sum of the linear
represented by noninteger programming
the cjxj term in individual values, that
contributions of model is assumed
the objective satisfy the to be a known
function, ex: Z the respective functional and
activities. constant
(profit in nonnegativity
thousands of constraints or
dollars per week) fraction.
Formulasi LP

Use the decision

Completely variables to write
understand the Identify the Define the mathematical
managerial objective and decision expressions for
problem being constraints variables the objective
faced function and the
constraints
LP Model
Common table resource for LP
A Standard Form of the Model
Other Forms
Terminology for Solutions of the Model
A feasible solution is a solution for which all the constraints are satisfied.

An infeasible solution is a solution for which at least one constraint is violated

It is possible for a problem to have no feasible solutions

The feasible region is the collection of all feasible solutions.

An optimal solution is a feasible solution that has the most favorable value of the objective function.

The most favorable value is the largest value if the objective function is to be maximized, whereas it is the
smallest value if the objective function is to be minimized.
Linear Programming
Solusi grafis
Solusi Grafis
• Kekurangan: Terbatas pada dua dimensi saja
• Kelebihan: mampu menjelaskan berbagai masalah yang timbul pada
saat penyelesaian.
X2

X1
Example
• Reddy Mikks produces both interior and exterior paints from two raw materials, Ml and M2. The following
table provides the basic data of the problem:

• A market survey indicates that the daily demand for interior paint cannot exceed that for exterior paint by
more than 1 ton. Also, the maximum daily demand for interior paint is 2 tons. Reddy Mikks wants to
determine the optimum (best) product mix of interior and exterior paints that maximizes the total daily profit.
Solution
• 1. Determine the variables
• Xl = Tons produced daily of exterior paint
• X2 = Tons produced daily of interior paint

• 2. Construct the objective function

• Total profit from exterior paint = 5xl (thousand) dollars
• Total profit from interior paint = 4X2 (thousand) dollars
• Maximize z = 5Xl + 4X2

• 3. Construct the constraints

• Usage of raw material Ml by exterior paint = 6Xl tons/day
• Usage of raw material Ml by interior paint = 4X2 tons/day
• Usage of raw material Ml by both paints = 6X1+ 4x2 tons/day
• Usage of raw material M2 by both paints = IXl + 2X2 tons/day
• The excess of the daily production of interior over exterior paint, X2 - Xl, should not exceed 1 ton:

• The maximum daily demand of interior paint is limited to 2 tons:

• An implicit (or "understood-to-be") restriction is that variables Xl and X2 cannot assume negative values. The nonnegativity
restrictions, Xl ≥ 0, X2 ≥ 0, account for this requirement.
Primal Solution
Graphical solution
Contoh lainnya

x1 and x2 are the decision variables for the model.

Another Example
CPF

A corner-point
feasible (CPF) solution If the problem has
is a solution that lies at The best CPF solution multiple optimal
a corner of the feasible must be an optimal solutions, at least two
region solution. must be CPF solutions.

(CPF solutions also are Thus, if a problem has

commonly referred to exactly one optimal
as extreme points or solution, it must be a
vertices, but we prefer CPF solution.
the more suggestive
corner-point
terminology.)
CPF
Multiple solution
No optimal solutions
Another example model LP
Contoh soal LP solusi grafis
• PT MAJU akan memproduksi 2 buah produk yang masing-masing
produk diharapkan mendapatkan laba bersih sebesar Rp. 8.000,- dan
Rp. 10.000/unitnya. Untuk membuat kedua produk tersebut
diperlukan 2 bahan baku yaitu A dan B. Ketersediaan bahan baku A
adalah Maksimal 24 Kg dan B tidak boleh lebih dari 48 Kg. Setiap unit
produk pertama membutuhkan 1 Kg Bahan A dan 4 Kg bahan B.
Setiap unit produk kedua memerlukan 3 Kg bahan A dan 3 Kg bahan
B.
• Bagaimana persoalan Primalnya?
• Berapa Banyak produk pertama dan kedua yang harus diproduksi
untuk mendapat keuntungan maximal?
• Variabel Keputusan adalah
• x1 = jumlah produk pertama yang diproduksi
• x2 = jumlah produk kedua yang diproduksi

Persoalan Primal
• Fungsi Tujuan:
• Memaksimumkan
Laba Bersih total Z = 8x1 + 10x2
• Pembatas adalah
1)Ketersediaan bahan
• Bahan A : x1 + 3x2  24
• Bahan B : 4x1 + 3x2  48

2) Pembatas tak negatif

• x1 ≥ 0; x2 ≥ 0
x1 + 3x2  24 4x1 + 3x2  48
• X1 + 3X2 = 24
• Misalkan X1 = 0 4x1 +3x2 = 48
• X1+3x2 = 24 X1 =0
4(0)+3x2 = 48
• 0 + 3x2 = 24 X2 = 16
• X2 = 8
4x1+3X2 =48
• X2 = 0 4x1 +3(0) = 48
• X1 +3x2 = 24 4x1 = 48
x1 = 12
• X1 +3(0) = 24
• X1 =24
(0,16) (12,0)
• (0,8) (24,0)
x2

16

12 24 X1

x1 + 3x2  24
4x1 + 3x2  48
x1 + 3x2  24
4x1 + 3x2  48
• X1 + 3X2 = 24
• Masukkan X1 =0 4x1 +3X2 = 48
• 0 + 3X2 = 24 X1=0, X2 = 16
X1=12, X2=0
• 3x2 = 24 (0,16) dan (12,0)

• X2 = 24/3 = 8
• Masukkan X2 = 0
• X1 + 3(0) = 24
• X1 = 24
• (0,8) (24,0)
X2

16

12 24 X1
x1 + 3x2  24
4x1 + 3x2  48
x2
16

8
(8; 5,3)

12 24 x1

x1 + 3x2  24
4x1 + 3x2  48
• 4x1 + 3x2  48
• x1 + 3x2  24
• 3X1 = 24
• X1 =8

• x1 + 3x2  24
• 8 + 3x2 = 24
• 3x2 = 24-8
• 3x2 = 16
• X2 = 5,3
• (8; 5,3)
 Masukkan x1 =0, pada masing-masing fungsi kendala
 Masukkan x2=0, pada masing-masing fungsi kendala
 Lalu buat grafik
 Subtitusikan untuk titik optimal

• Z = 8x1 + 10x2
• Z = 8(8) + 10(5,33)
• Z =117333,3
Practice (1)
Practice 2
Practice 3
• 1 Digit terakhir NPM Genap
• The Apex Television Company has to decide on the number of 27- and 20-inch sets to be produced at one of its factories.
Market research indicates that at most 40 of the 27-inch sets and 10 of the 20-inch sets can be sold per month. The maximum
number of work-hours available is 500 per month. A 27-inch set requires 20 work-hours and a 20-inch set requires 10 work-
hours. Each 27-inch set sold produces a profit of $120 and each 20-inch set produces a profit of $80. A wholesaler has agreed
to purchase all the television sets produced if the numbers do not exceed the maxima indicated by the market research.
✓ (a) Formulate a linear programming model for this problem.
✓ (b) Use the graphical method to solve this model.

• 1 Digit terakhir NPM Ganjil

• The WorldLight Company produces two light fixtures (products 1 and 2) that require both metal frame parts
and electrical components. Management wants to determine how many units of each product to produce so as
to maximize profit. For each unit of product 1, 1 unit of frame parts and 2 units of electrical components are
required. For each unit of product 2, 3 units of frame parts and 2 units of electrical components are required.
The company has 200 units of frame parts and 300 units of electrical components. Each unit of product 1 gives
a profit of $1, and each unit of product 2, up to 60 units, gives a profit of $2. Any excess over 60 units of
product 2 brings no profit, so such an excess has been ruled out.
✓ (a) Formulate a linear programming model for this problem.
✓ (b) Use the graphical method to solve this model. What is the resulting total profit?
Practice 4

Belajar Mandiri utk penggunaan Software(LINGO, LINDO,

TORA, Solver, POM QM)

File yang dikumpulkan adalah:

PPT dan Hasil Software

 Practice
Fungsi tujuan

Fungsi Pembatas

Nilai Kanan Solusi Grafis

End of Lesson