Scribd
Upload
81 views2 pages

Test PDF

This document summarizes the results of a linear programming problem called "soal 2 taufik". The objective is to maximize the value of 8X1 + 2X2. The optimal solution is X1 = 5, X2 = 0, with an optimal solution value of 40. The document includes the problem formulation, optimal solution, ranging analysis, iterations, and dual problem.

Uploaded by

Widha Adria Farrel
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
81 views2 pages

Test PDF

This document summarizes the results of a linear programming problem called "soal 2 taufik". The objective is to maximize the value of 8X1 + 2X2. The optimal solution is X1 = 5, X2 = 0, with an optimal solution value of 40. The document includes the problem formulation, optimal solution, ranging analysis, iterations, and dual problem.

Uploaded by

Widha Adria Farrel
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/ 2

Adria Farrel PSUTS Nadjadji

02-20-2018 19:47:43

Module/submodel: Linear Programming


Problem title: soal 2 taufik
Objective: Maximize

Problem and Results ----------

X1 X2 RHS Dual
---------------------------------------------------------------------
Maximize 8 2
Constraint 1 4 5 <= 20 2
Constraint 2 2 6 <= 18 0
---------------------------------------------------------------------
Solution 5 0 40

The optimal solution value is = 40

Ranging ----------

Reduced Original Lower Upper


Variable Value Cost Value Bound Bound
----------------------------------------------------------------------------------------------------
X1 5 0 8 1.6 Infinity
X2 0 8 2 -Infinity 10

Dual Slack/ Original Lower Upper


Constraint Value Surplus Value Bound Bound
----------------------------------------------------------------------------------------------------
Constraint 1 2 0 20 0 36
Constraint 2 0 8 18 10 Infinity

Solution list ----------

Iterations ----------

Iteration 1

Cj--> 8 2 0 0
Basic X1 X2 Profit Quantity
-----------------------------------------------------------------
slack 1 4 5 1 0 20
slack 2 2 6 0 1 18
zj 0 0 0 0 0
cj-zj 8 2 0 0

Iteration 2

Cj--> 8 2 0 0
Basic X1 X2 Profit Quantity
-----------------------------------------------------------------
X1 1 1.25 0.25 0 5
slack 2 0 3.5 -0.5 1 8
zj 8 10 2 0 40
cj-zj 0 -8 -2 0

Dual ----------

y1 y2
---------------------------------------------------------
Minimize 20 18
X1 4 2 >= 8
X2 5 6 >= 2
soal 2 taufik

X2
4

Constraints

Isoprofit Line

5.,0.
5 9
X1

You might also like