TORA Optimization System, Windows®-version 1.

00
Copyright © 2000-2002 Hamdy A. Taha. All Rights Reserved
Monday, September 25, 2023 11:02

LINEAR PROGRAM -- ORIGINAL DATA

Title: 1. Graphicallly solve Problem 1 of Section 3.1

Gandum Jagung
x1 x2
Maximize 4,00 3,00
Subject to
( 1) 1,00 1,00 <= 7,00
( 2) 10,00 4,00 <= 40,00
( 3) 1,00 0,00 >= 0,00
( 4) 0,00 1,00 >= 3,00

Lower Bound 0,00 0,00

Upper Bound infinity infinity
Unrestr'd (y/n)? n n
 LINEAR PROGRAMMING -- GRAPHICAL SOLUTION

Title: 1. Graphicallly solve Problem 1 of Section 3.1

Summary of Optimal Solution:

Objective Value = 23,00
x1 = 2,00
x2 = 5,00

( 2)11
x2
10

Obj 9

( 1) 8

Optimum
5

( 4) 3

-1 0 1 2 3 4 5 6 7 8 9 10 x1 11
( 3)
-1
TORA Optimization System, Windows®-version 1.00
Copyright © 2000-2002 Hamdy A. Taha. All Rights Reserved
Monday, September 25, 2023 11:55

LINEAR PROGRAM -- ORIGINAL DATA

Title: Graphically solve Problem 4 of Section 3.1

Truk 1 Truk 2
x1 x2
Maximize 300,00 500,00
Subject to
( 1) 7,00 8,00 <= 5600,00
( 2) 12,00 15,00 <= 18000,00
( 3) 1,00 0,00 >= 0,00
( 4) 0,00 1,00 >= 0,00

Lower Bound 0,00 0,00

Upper Bound infinity infinity
Unrestr'd (y/n)? n n
 LINEAR PROGRAMMING -- GRAPHICAL SOLUTION

Title: Graphically solve Problem 4 of Section 3.1

Summary of Optimal Solution:

Objective Value = 350000,00
x1 = 0,00
x2 = 700,00

1600
x2
1500

1400

1300
( 2)
1200

1100

1000

900

( 1) 800
Obj Optimum
700

600

500

400

300

200

100

-100
( 4) 0 100 200 300 400 500 600 700 800 900 1000 1100 1200 1300 1400 1500
x1 1600
( 3)
-100
TORA Optimization System, Windows®-version 1.00
Copyright © 2000-2002 Hamdy A. Taha. All Rights Reserved
Monday, September 25, 2023 11:28

LINEAR PROGRAM -- ORIGINAL DATA

Title: Graphically solve Problem 3 of Section 3.2

Proses Proses
x1 x2
Minimize 4,00 1,00
Subject to
( 1) 3,00 1,00 >= 10,00
( 2) 1,00 1,00 >= 5,00
( 3) 1,00 0,00 >= 3,00
( 4) 0,00 1,00 >= 0,00

Lower Bound 0,00 0,00

Upper Bound infinity infinity
Unrestr'd (y/n)? n n
 LINEAR PROGRAMMING -- GRAPHICAL SOLUTION

Title: Graphically solve Problem 3 of Section 3.2

Summary of Optimal Solution:

Objective Value = 14,00
x1 = 3,00
x2 = 2,00

( 1)11 Obj
x2
10

( 2) 6

Optimum
2

-1
( 4) 0 1 2 3 4 5 6 7 8 9 10 x1 11
( 3)
-1
TORA Optimization System, Windows®-version 1.00
Copyright © 2000-2002 Hamdy A. Taha. All Rights Reserved
Monday, September 25, 2023 12:01

LINEAR PROGRAM -- ORIGINAL DATA

Title: Graphically solve Problem 5 of Section 3.2

Meja Kursi
x1 x2
Maximize 40,00 25,00
Subject to
( 1) 4,00 3,00 <= 20,00
( 2) 2,00 -1,00 <= 0,00
( 3) 1,00 0,00 >= 0,00
( 4) 0,00 1,00 >= 0,00

Lower Bound 0,00 0,00

Upper Bound infinity infinity
Unrestr'd (y/n)? n n
 LINEAR PROGRAMMING -- GRAPHICAL SOLUTION

Title: Graphically solve Problem 5 of Section 3.2

Summary of Optimal Solution:

Objective Value = 180,00
x1 = 2,00
x2 = 4,00

8
( 1) Obj
x2

Optimum
4

-1( 4) 0 1 2 3 4 5 6 7 x1 8

( 2)( 3)
-1
TORA Optimization System, Windows®-version 1.00
Copyright © 2000-2002 Hamdy A. Taha. All Rights Reserved
Monday, September 25, 2023 12:04

LINEAR PROGRAM -- ORIGINAL DATA

Title: Graphically solve Problem 6 of Section 3.2

Gandum Jagung
x1 x2
Maximize 200,00 300,00
Subject to
( 1) 3,00 2,00 <= 100,00
( 2) 2,00 4,00 <= 120,00
( 3) 1,00 0,00 >= 0,00
( 4) 0,00 1,00 >= 0,00

Lower Bound 0,00 0,00

Upper Bound infinity infinity
Unrestr'd (y/n)? n n
 LINEAR PROGRAMMING -- GRAPHICAL SOLUTION

Title: Graphically solve Problem 6 of Section 3.2

Summary of Optimal Solution:

Objective Value = 10000,00
x1 = 20,00
x2 = 20,00

66
x2
60
( 1)

54

48

42

Obj
36
( 2)
30

24
Optimum

18

12

-6
( 4) 0 6 12 18 24 30 36 42 48 54 60 x1 66
( 3)
-6