Scribd
Upload
62 views3 pages

Module/submodel: Linear Programming Problem Title: SOAL NO 37 (MODUL A2) Objective: Maximize

The document summarizes the results of a linear programming problem to maximize production based on constraints of labor, fertilizer, pest control, and land area. The optimal solution is to produce 30 units of kacang, 10 units of kapas, using 30 labor for kacang and 10 labor for kapas. This achieves the maximum objective value of 15,000.

Uploaded by

Widya Jayantari
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
62 views3 pages

Module/submodel: Linear Programming Problem Title: SOAL NO 37 (MODUL A2) Objective: Maximize

The document summarizes the results of a linear programming problem to maximize production based on constraints of labor, fertilizer, pest control, and land area. The optimal solution is to produce 30 units of kacang, 10 units of kapas, using 30 labor for kacang and 10 labor for kapas. This achieves the maximum objective value of 15,000.

Uploaded by

Widya Jayantari
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
You are on page 1/ 3

ASUS

E:\s2\ANALISA SISTEM\QM\SOAL 37 (MODUL A2).lin


Module/submodel: Linear Programming
Problem title: SOAL NO 37 (MODUL A2)
Objective: Maximize

Linear Programming Results


JAGUNG KACANG KAPAS RHS Dual

Maximize 400 350 450

BURUH 3 2 2 <= 120 0

PUPUK 4 3 1 <= 160 0

PEMBASMI SERANGGA 3 2 4 <= 100 50

LUAS LAHAN 1 1 1 <= 40 250

Solution 0 30 10 15000

Ranging

Variable Value Reduced Cost Original Val Lower Bound Upper Bound
JAGUNG 0 0 400 -Infinity 400
KACANG 30 0 350 350 450
KAPAS 10 0 450 450 700
Dual Value Slack/Surplus Original Val Lower Bound Upper Bound
BURUH 0 40 120 80 Infinity
PUPUK 0 60 160 100 Infinity
PEMBASMI SERANGGA 50 0 100 80 160
LUAS LAHAN 250 0 40 25 50

Solution list
Variable Status Value

JAGUNG NONBasic 0

KACANG Basic 30

KAPAS Basic 10

slack 1 Basic 40

slack 2 Basic 60

slack 3 NONBasic 0

slack 4 NONBasic 0

Optimal Value (Z) 15000


Wednesday, September 19, 2018 6:26 AM 1 of 1
ASUS
E:\s2\ANALISA SISTEM\QM\SOAL 37 (MODUL A2).lin
Iterations
Basic
Cj Quantity 400JAGUNG 350KACANG 450KAPAS 0slack 1 0slack 2 0slack 3 0slack 4
Variables
Iteration 1

0 slack 1 120 3 2 2 1 0 0 0

0 slack 2 160 4 3 1 0 1 0 0

0 slack 3 100 3 2 4 0 0 1 0

0 slack 4 40 1 1 1 0 0 0 1

zj 0 0 0 0 0 0 0 0

cj-zj 400 350 450 0 0 0 0

Iteration 2

0 slack 1 70 1.5 1 0 1 0 -0.5 0

0 slack 2 135 3.25 2.5 0 0 1 -0.25 0

450 KAPAS 25 0.75 0.5 1 0 0 0.25 0

0 slack 4 15 0.25 0.5 0 0 0 -0.25 1

zj 11,250 337.5 225 450 0 0 112.5 0

cj-zj 62.5 125 0 0 0 -112.5 0

Iteration 3

0 slack 1 40 1 0 0 1 0 0 -2

0 slack 2 60 2 0 0 0 1 1 -5

450 KAPAS 10 0.5 0 1 0 0 0.5 -1

350 KACANG 30 0.5 1 0 0 0 -0.5 2

zj 15,000 400 350 450 0 0 50 250

cj-zj 0 0 0 0 0 -50 -250

Dual

Original Problem
Maximize JAGUNG KACANG KAPAS
BURUH 3 2 2 <= 120
Wednesday, September 19, 2018 6:26 AM 2 of 1
ASUS
Dual
E:\s2\ANALISA SISTEM\QM\SOAL 37 (MODUL A2).lin

PUPUK 4 3 1 <= 160


PEMBASMI SERANGGA 3 2 4 <= 100
LUAS LAHAN 1 1 1 <= 40

Dual Problem
BURUH PUPUK PEMBASMI SER… LUAS LAHAN
Minimize 120 160 100 40
JAGUNG 3 4 3 1 >= 400
KACANG 2 3 2 1 >= 350
KAPAS 2 1 4 1 >= 450

Wednesday, September 19, 2018 6:26 AM 3 of 1

You might also like