Scribd
Upload
17 views14 pages

OROT - Linear Programming Problem (1-2)

The document presents a linear programming problem titled 'HOCKEY&BAT' with the objective to maximize the function involving variables x1 and x2 under specific constraints. It details the simplex tableau iterations for both maximization and minimization phases, ultimately leading to a global optimal solution. Additionally, it includes another linear programming problem titled 'MARRY DIAGNOSED' with its objective value summarized at 5.

Uploaded by

Jaydeep Rabari
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
17 views14 pages

OROT - Linear Programming Problem (1-2)

The document presents a linear programming problem titled 'HOCKEY&BAT' with the objective to maximize the function involving variables x1 and x2 under specific constraints. It details the simplex tableau iterations for both maximization and minimization phases, ultimately leading to a global optimal solution. Additionally, it includes another linear programming problem titled 'MARRY DIAGNOSED' with its objective value summarized at 5.

Uploaded by

Jaydeep Rabari
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/ 14

TORA tzabon Srttem Wndowego 2 00

Coryig G 2000.2007 henvhy A Tsha An Ryt Roteryed


Thray Alarch 00

LINEAR PROGRAM - ORIGINAL DATA

Title: HOCKEY&BAT

x1 x2
Maxdmize 2.00 4.00
Sub<ect to
(1) 4.00 6.00 120.00
2.00 6.00 72.00
(3) 0.00 1.00 10.00

Lower Bound 0.00 0.00


Upper Bound infinity infinity
Unrestr'd (yn)?

SIMPLEX TABLEAUS - (Slarting All-Slack Mothod)


Title: HOCKEY&BAT

Iteration 1
Basic Sx3 Sx4 Sx5 Sofution
z (max) -2.00 4.00 0.00 0.00 0.00 0.00
Sx3 4.00 6.00 1.00 0.00 0.00 120.00
sx4 2.00 8.00 0.00 1.00 O.00 72.00
sx5 0.00 1.00 0.00 0.00 1.00 10.00
Lower Bound 0.00 0.00
Upper Bound infinity Infinity
Unrestrd (yBn)?

teration 2
Basic 5X3 SX4 SX5 Sotution
z (max) -2.00 0.00 0.00 0.00 4.00 40.00
Sx3 4.00 0.00 1.00 0.00 -6,00 60.00
sx4 2.00 0.00 0.00 1,00 -6.00 12.00
x2 0.00 1,00 0.00 0.00 1.00 10.00
Lower Bound 0.00 0.00
Upper Bound infinity infinity
Unrestrd (yBn)?

iteration 3
Basic x1 x2 Bx3 SK4 Sx5 Sofution
z (max) 0.00 0.00 0.00 1.00 -2.00 52.00
$x3 0.00 0.00 1.00 -2.00 6.00 36.00
x1 1.00 0.00 0.00 0.50 -3.00 6.00
0.00 1.00 0.00 0.00 1.00 10.00
Lower Bound 0.00 0.00
Upper Bound infinityn Infinity
Unrestrd(yin)?

Ieration 4
Basic 9x3 Sx5 Solutlon
z (max) 0.00 0.00 0.33 0.33 0.00 64.00
SX5 0.00 0.00 0.17 -0.33 1.00 6.00
1.00 0.00 0.50 -0.50 0.00 24.00
x2 0.00 1.00 -0.17 0.33 0.00
Lower Bound 4,00
0.00 0.00
Upper Bound Infinily infinlty
Unrestr'd (yin)2
TORA Omzaton Sytten Wntowvhv 2 00
CopyrghtO0002007 Hamdy AIaha AN Rohts Reserved
Ihuscay Atch 14 2024 19 5

LINEAR PROGRAM - ORIGINAL DATA

Title: HOCKEY&BAT

x1 X2 x3
Minlmlze 120.00 72.00 10.00
Subject to 2.00
4.00 2.00 0.00
(1) 1.00 4.00
i2) 6.00 6.00

Lower Bound 0.00 0.00 0.00


Upper Bound infinity Infinity infinity
n
Unrestrd (yn)?

SIMPLEX TABLEAUS- (M-Method)

Title: HOCKEY&BAT

Iteralion 1
X1 x3 Sx4 Sx5 Rx6
Basic 0.00
9880.00 7928.00 990.00 -1000.00 -1000.00
2(min) 0.00 -1.00 0.00 1.00
Rx6 4.00 2.00
6.00 6.00 1.00 0.00 -1.00 0.00
Rx7
Lower Bound 0.00 0.00 0.00
Upper Bound infinity Infinity irnfinity
Unrestrd (yfn)? n

Basic Rx7 Solution


z(min) 0.00 6000.00
Rx6 0.00 2.00
Rx7 1.00 4.00

Iteratlon 2
Basic Sx4 Sx5 Rax6
0.00 2988.00 990.00 1470.00 -1000.00 -2470.00
z (min) -0.25 0.00 0.25
X1 1.00 0.50 0.00
Rx7 0.00 3.00 1.00 1.50 -1.00 -1.50
Lower Bound 0.00 0.00 0.00
Upper Bound Infinity Infinity infinity
Unrestrd (yBn)?

Baslc Rx7 Solution


z (min) 0.00 1060.00
x1 0.00 0.50
Rx7 1.00 1.00

Ieration 3
Baslc x2 x3 Sx4 Sx5 Rx6
0.00 0.00 -6.00 -24.00 4.00 -976.00
z (min)
x1 1,00 0.00 -0.17 -0.50 0.17 0.50
0.00 1.00 0.33 0.50 -0.33 -0.50
Lower Bound 0.00 0.00 0.00
Upper Bound Infinity Infinity Infinity
Unrestrd (yln)? n n n

Baslc Rx7 Solution


z (min) -996.00 64.00
x1 -0.17 0.33
x2 0.33 0,33
LINEAR PROGRAM - ORIGINAL DATA

Tite: HOCKEY&BAT

x1 x
Minimlze 120.00 72 00 10 00
Subject to
(1) 4.00 2 00 0.00
21 6.00 6 00 1.00
Lower Bound 0.00 0 00 0.00
Unrostnd
Upper inlinily infinity infinity
d(yn)? n

1) 2.00
4,00

SIMPLEX TABLEAUS - (Two-Phase Method)

Tile: HOCKEY&BAT

Phase 1 (lter 1
Basic Sx4
z (min) 10.00 8.00 1.00 -1.00
Rx6 4.00 2.00 0.00 -1.00
Rx7 6.00 6.00 1.00 0.00
Lower Bound 0.00 0.00 0.00
Upper Bound infinity infinity infinity
Unrestr'd (y/n)? n

Basic Sx5 Rx6 Rx7 Solution


z (min) -1,00 0.00 0.00 6.00
Rx6 0.00 1.00 0.00 2.00
Rx? -1.00 .0.00 1.00 4.00

Phase 1 (lter 2
Basic x1 Sx4
z (min) 0.00 3.00 1.00 1.50
1.00 0.50 0.00 -0.25
R&7 0.00 3.00 1.00 1.50
Lower Bound 0.00 0.00 0.00
Upper Bound infinity infinity infinity
Unrestrd (yBn)?

Basic Sx5 Rx6 Rx7 Solution


z (min) -1.00 -2.50 0.00 1.00
0.00 D.25 0.00 0.50
RxT -1.00 1.50 1.00 1.00

Phase 1 (lter 3
Basic X Sx4
z (min) 0.00 0.00 0.00 0.00
x1 1.00 0.00 -0.17 -0.50
0.00 1,00 0.33 0.50
Lower Bound 0.00 D.00 D.00
Upper Bound infinity infinity infinity
Unrestrd (yBn)?

Basic Sx5 Rx6 Rx Solution


z (min) 0.00 -1.00 -1.00 0.00
x1 0.17 0.50 -0.17 0.33
-0.33 -0.50 0.33 0.33

Phase 2 (lter 4
Basic Sxd
z (min) 0.00 0.00 -6.00 -24.00
X1 1.00 D.00 -0.17 -0.50
0.00 1.00 0.33 0.50
Lower Bound 0.00 0.00 0.00

Uppe Bound
Unrestr'd (yln)?
Infinity Infinity infinity

Baslc Sx5 Rx6 Rx7 Solution


z(mln) 4.00 blocked blocked 64.00
x1 0.17 0.50 -0.17 0.33
-0.33 -0.60 0.33 0.33
!objective functiGa;
max=2*hockey+4*bat;
CGnstrains to ILake sure We dont get negatiVe vaiae;
hockey0;
bat=0;

4*hockey+6*bat<=120;
2*hockey+6*bat<=72;
1*batK=10;
Global optimal solution found.
64.00000
Objective value: 0.000000
Infeasihilities:
2
Tot.al solver iterations:
Elapsed runtime seconds: 0.04

Model Class: LP

Total variables:
Nonlinear variables:
Integer variables : 0

Total constraints: 6
Nonlinear Constraints:

Total nonzeros:
Noni inear nonzeros:

Variable Value Reduced Cost


HOCKEY 24.00000 0.000000
BAT 4.000000 0.000000

Row Slack or Surplus Dual Price


64.00000 1.000000
2 24.00000 0.000000
3 4.000000 0.000000
4 0.000000 0.3333333
5 0.000000 0.3333333
6 6.000000 0.000000
(68)

!objective functian;
TOin=120*A+72*B+10#C;

!Consgtrais;
A=0 :
B0:
cF0;

4*A+2*BF2
6*A+6*B+1*C=4;
2
Global opt imal soluLln found. 64.00000
Objective value: 0.000000
Infeasibilities:
otal solver iterations: 0.05
Elapsed runtime seconds:
LP
Model class:
3
Total variables:
0
Nonlinear variables:
Integer variables:
Total constraints: 6
Nonlinear constraints:
Total nonzeros : 11
Nonlinear nonzeros:

Variable Value Reduced Cost


A 0.3333333 0.000000
0.3333333 0.000000
C 0.000000 6.000000

Row Slack or Surplus Dual Price


1 64.00000 -1.000000
2 0.3333333 0.000000
0.3333333 0.000000
0.c00000 0.000000
5 0.000000 -24.00000
6 0.000000 -4.000000
TORA Optim1zation System, Windowsversion 2.00
Taha. AlI Rights Reserved
Copyright 2000-200
Thursday, March 14 2024 20.02

DATA
LINEAR PROGRAM -- ORIGINAL

Title: MARRY DIAGNOSED

x1 X2
0.40 0.50
Minimize
Subject to 2.70
0.30 0.10 6.00
(1) 0.50
0.50 6.00
(2) 0.60 0.40
3
0.00 0.00
Lower Bound
infinity infinity
Upper Bound
n
Unrestrd (y/n)?
LINEAR PROGRAMMING -- GRAPHICAL SOLUTION

Title: MARRY DIAGNOSED

Summary of Optimal Solution:


Objective Value =5.25
x1 = 7.50
x2 = 4.50

X2
27

24

j21

(3)
18

15
(2)
Obj
2

6
Optimum

3 6 15 18 21 24 27 x1 30

3
(7

TORA Optimization System, Windows®-version 2.00


Copyright 2000-20ó7 Hamdy A. Taha. AlI Rights Reserved
Thursday, March 14, 2024 20:06

LINEAR PROGRAM -- ORIGINAL DATA

Title: MARRY DIAGNOSED

x1 X2
Minimize 0.40 0.50
Subject to
(1) 0.30 0.10 2.70
0.50 0.50 6.00
0.60 0.40 6.00
Lower Bound 0.00 0.00
Upper Bound infinity infinity
Unrestrd (y/n)?
SIMPLEX TABLEAUS - (M-Method)

Title: MARRY OIAGNOSED

Iteration 1
Basic x1 x2 Sx3 Sx4 Rx5 R6
z (min) 109.60 89.50 -100 00 O.00 0.00 0 00
Sx4 0.30 0.10 0 00 1.00 0.00 000
Rx5 0.50 0.50 0 00 0.00 1.00 0 00
Rx6 0.60 0.40 -1.00 0.00 0.00 1.00
Lower Bound 0.00 0.00
Upper Bound infinity infinity
Unrestrd (yfn)? n

Basic Solution
z (min) 1200.00
Sx4 2.70
Rx5 6.00
Rx6 6.00

Iteration 2
Basic X1 Sx3 Sx4 RxS Rx6
z (min) 0.00 52.97 -100.00 -365.33 0.00 0.00
x1 1.00 0.33 0.00 3.33 0.00 0.00
Rx5 0.00 0.33 0.00 -1.67 1.00 0.00
Rx6 0.00 0.20 -1.00 -2.00 0.00 1.00
Lower Bound 0.00 0.00
Upper Bound infinity infinity
Unrestrd (yBn)? n

Basic Solution
z (min) 213.60
9.00
Rx5 1.50
Rx6 0.60

Iteration 3
Basic Sx3 SX4 Ra5 Rx6
z(min) 0.00 0.00 164.83 164.33 0.00 -264.83
x1 1.00 0.00 1.67 667 0.00 -1.67
Rx5 0.00 0.00 1.67 1.67 1.00 -1.67
0.00 1.00 5.00 -10.00 C.00 5.00
Lower Bound 0.00 0.00
Upper Bound infinity infinity
Unrestr'd (yin)? n

Basic Solution
z (min) 54.70
8.00
Rx5 0.50
X2 3.00

Iteration 4
Baslc Sx3 SX4 Rx5 Rx6
z(min) 0.00 0.00 0.00 -0.50 -98.90 -10000
1.00 0.00 0.00 5.00 -1.00 000
Sx3 0.00 0.00 1.00 1.00 0.60 -1.00
x2 0.00 1.00 0.00 .5.00 3.00 0.00
Lower Bound 0.00 0.00
Upper Bound infinity infinity
Unrestr'd (yBn)?

Basic Solution
z (min) 5.25
7.50
Sx3 0.30
4.50
!abjective function;
in-0.4*beanl +0.5*beam2:
COnstains to nake sure we don't get negative value;
beaml0;
beam20;
0.3*beam1 +0.1*beam2 <=2.7; !critical tissue;
0.5*beam1+0.5*beam2 ; !tumor region;
0.6*beam1+-0.4*beam2; !centre of turaor;
!objective function;
Oar= -2.7*Ct+6*tr+6*cot:
!Constrains;
Gt0;Cot0;
-0.3*Ct+0.5*tr+0.6*cot<=0.4;
-0.1*ct+0.5*tr+0.4*Cot<=0.5;

!ct*Critical ti3sue, trtuaor region, Cot=centre of ttOr;


(62)

Global optimal solution found. 5.250000


Objective value: 0.000000
Infeasibilities: 3
Total solver iterations: 0.05
Elapsed runtimè seconds :
LP
Model Class:

Total variables: 3
Nonlinear variables:
Integer variables: 0

Total constraints:
Nonlinear constraints:

Total nonzerOs: 11
Nonlinear nonzeros:

Reduced Cost
Variable Value
0.5000000 0.000000
CT 0.000000
TR 1.100000
0.3000000
COT 0.000000
Dual Price
Row Slack or Surplus
5.250000 1.000000
2 0.5000000 0.000000
3 0.000000 0.000000
0.000000 7.500000
5 0.000000 4.500000

You might also like