CHAPTER 8: OTHER ALGORITHMS FOR LINEAR PROGRAMMING

8.1-1.
(a), (c)

(b) Optimal Solution: ÐB" ß B# Ñ œ Ð"ß $Ñ, ^ œ %

Iteration BV Eq. # ^ B" B# B$ B% B& RS
! ^ ! " " 1 ! ! ! !
B$ " ! 1 " " ! ! 8
B% # ! ! " ! " ! 3
B& $ ! 1 " ! ! " 2
" ^ ! " ! ! ! 1 ! $
B$ " ! 1 ! " " ! &
B# # ! ! " ! " ! 3
B& $ ! 1 ! ! " " 1
# ^ ! " ! ! ! # 1 4
B$ " ! ! ! " # " 4
B# # ! ! " ! " ! 3
B" $ ! " ! ! 1 1 1

)-1
8.1-2.
Iteration BV Eq. # ^ B" B# B$ B% B& RS
! ^ ! " & # % ! ! !
B% " ! $ " # " ! %
B& # ! ' $ & ! " "!
# #
" ^ ! " " ! $ ! $  #!
$
B% " ! " !  "$ "  "$  #$
&
B# # ! # " $ !  "$ "!
$
" "
# ^ ! " ! ! $ " $  ##
$
" " #
B" " ! " ! $ " $ $
B# # ! ! " " # " #
Optimal Solution: ÐB" ß B# ß B$ Ñ œ Ð#Î$ß #ß !Ñ, ^ œ ##Î$
8.1-3.
Iteration BV Eq. # ^ B" B# B$ B% B& B' B( RS
! ^ ! " ( # & % ! ! ! !
B& " ! # % ( " " ! ! &
B' # ! ) % ' % ! " ! )
B( $ ! $ ) " % ! ! " %
"
" ^ ! " $ ! # # ! # ! %
B& " ! ' ! " $ " " ! $
$
B# # ! # " # " !  "% ! #
B( $ ! "$ ! "" % ! # " "#
Optimal Solution: ÐB" ß B# ß B$ ß B% Ñ œ Ð!ß #ß !ß !Ñ, ^ œ %

)-2
8.1-4.
(a) Optimal Solution: ÐB" ß B# Ñ œ Ð$ß $Ñ, ^ œ "&
Iter. BV Eq. # ^ B" B# B$ B% B& RS Primal Solution Dual Solution
! ^ ! " 3 2 ! ! ! ! Ð!ß !ß 12Þ6ß 27Ñ Ð!ß !ß !ß 3ß 2Ñ
B$ " ! $* " " ! ! 12
B% # ! " " ! " ! 6
B& $ ! & $ ! ! " 27
" ^ ! " ! 1 1 ! ! 12 Ð4ß !ß !ß #ß (Ñ Ð"ß !ß !ß !ß "Ñ
" "
B" " ! " $ $ ! ! %
#‡
B% # ! ! $  "$ " ! #
%
B& $ ! ! $  &$ ! " (
" $
# ^ ! " ! ! # # ! "& Ð$ß $ß !ß !ß $Ñ Ð "# ß $# ß !ß !ß !Ñ
"
B" " ! " ! #  "# ! $
B# # ! ! "  "# $
# ! $
B& $ ! ! ! " # " $

(b) The dual problem is:

minimize "#C"  'C#  #(C$
subject to $C"  C#  &C$ $
C"  C#  $C$ #
C" ß C# ß C$ !.
Iter. BV Eq. # ^ C" C# C$ C% C& RS Primal Solution Dual Solution
! ^ ! " "# ' #( ! ! ! Ð!ß !ß "#ß 'ß #(Ñ Ð!ß !ß !ß $ß #Ñ
C% " ! $ ‡ " & " ! $
C& # ! " " $ ! " #
" ^ ! " ! # ( % ! "# Ð%ß !ß !ß #ß (Ñ Ð"ß !ß !ß !ß "Ñ
" #
C" " ! " $ $  "$ ! "
C& # ! !  #$  %$  "$ " "
# ^ ! " ! ! $ $ $ "& Ð$ß $ß !ß !ß $Ñ Ð "# ß $# ß !ß !ß !Ñ
C" " ! " ! "  "# "
#
"
#
C# # ! ! " # #  $# $
#

Optimal Solution: ÐC" ß C# ß C$ Ñ œ Ð "# ß $# ß !Ñ, ^ œ "&Þ

The sequence of basic and complementary basic solutions is identical to that in part (a).

)-3
8.1-5.
Iteration BV Eq. # ^ B" B# B$ B% B& RS
$
! ^ ! " ! ! ! # " &%
"
B$ " ! ! ! " $  "$ '
"
B# # ! ! " ! # ! "#
B" $ ! " ! !  "$ "
$ #
$ &
" ^ ! " # ! ! ! # %&
B$ " ! " ! " ! ! %
$ "
B# # ! # " ! ! # *
B% $ ! $ ! ! " " '
Optimal Solution: ÐB" ß B# ß B$ ß B% ß B& Ñ œ Ð!ß *ß %ß 'ß !Ñ, ^ œ %&
8.1-6.
Iteration BV Eq. # ^ B" B# B$ B% B& RS
! ^ ! " ! ! # & ! "&!
B# " ! " " $ " ! $!
B& # ! "' ! # % " $!
" ^ ! " "' ! ! " " "#!
$
B# " ! #$ " ! & # "&
B$ # ! ) ! " #  "# "&
"!$ " "$
# ^ ! " & & ! ! "! ""(
#$
B% " ! &  "& ! " $
 "! $
' # "
B$ # ! & & " ! "! *
Optimal Solution: ÐB" ß B# ß B$ ß B% ß B& Ñ œ Ð!ß !ß *ß $ß !Ñ, ^ œ ""(

)-4
8.2-1.
(a)

The solution Ð!ß &Ñ is optimal with ^ œ "#!. It remains optimal as long as
)) "
 #%# ) Ÿ  # Í ) Ÿ #,

at which point Ð"!Î$ß "!Î$Ñ becomes optimal. In turn, this solution remains optimal until
))
 #%# ) Ÿ # Í ) Ÿ ),

at which point Ð&ß !Ñ becomes optimal.

) ÐB‡" ß B‡# Ñ ^ ‡ Ð) Ñ
!Ÿ)Ÿ# Ð!ß &Ñ "#!  "!)
#Ÿ)Ÿ) Ð"!Î$ß "!Î$Ñ Ð$#!  "!)ÑÎ$
) Ÿ ) Ÿ "! Ð&ß !Ñ %!  &)

)-5
(b)
Iteration BV Eq. # ^ B" B# B$ B% RS
! ^ ! " )  ) #%  #) ! ! !
B$ " ! " # " ! "!
B% # ! # " ! " "!
" ^ ! " %  #) ! "#  ) ! "#!  "!)
" "
B# " ! # " # ! &
$
B% # ! # !  "# " &
%!&) )%) $#!"!)
# ^ ! " ! ! $ $ $
#
B# " ! ! " $  "$ "!
$
B" # ! " !  "$ #
$
"!
$
%!&) ))
$ ^ ! " ! # ! # %!  &)
$
B$ " ! ! # "  "# &
" "
B" # ! " # ! # &
The solutions found in iterations ", # and $ are optimal for ! Ÿ ) Ÿ #, # Ÿ ) Ÿ ) and
) Ÿ ) Ÿ "! respectively.

(c) The graph in part (b) suggests that ) œ ! is optimal. Since ^Ð)Ñ is convex in ), the
maximum is attained at ) œ ! or ) œ "!. Thus, only the linear programming problems
corresponding to ) œ ! and ) œ "! need to be solved.

)-6
8.2-2.
Iteration BV Eq. # ^ B" B# B$ B% B& B' RS
! ^ ! " #!  %) $!  $) & ! ! ! !
B% " ! $ $‡ " " ! ! $!
B& # ! ) ' % ! " ! (&
B' $ ! ' " " ! ! " %&
" ^ ! " "!  () ! &) "!  ) ! ! $!!  $!)
" "
B# " ! " " $ $ ! ! "!
B& # ! # ! # # " ! "&
#
B' $ ! &‡ ! $  "$ ! " $&
"!) "'!##) "!()
# ^ ! " ! ! "& "& ! & #$!  "*)
" #‡
B# " ! ! " & & !  "& $
#'
B& # ! ! ! "&  #)
"& "  #& "
# " "
B" $ ! " ! "&  "& ! & (
)!"") "%#) "!#)
$ ^ ! " ! $ $ ! ! $ "&!  $!)
& "
B% " ! ! # # " !  "# "&
#
"% )
B& # ! ! $ $ ! "  %$ "&
" " " "&
B" $ ! " ' ' ! ! ' #

) ÐB‡" ß B‡# ß B‡$ Ñ ^ ‡ Ð) Ñ

! Ÿ ) Ÿ "! ( Ð!ß "!ß !Ñ $!!  $!)
"! )!
( Ÿ ) Ÿ "" Ð(ß $ß !Ñ #$!  "*)
)!
"" Ÿ ) Ð "&# ß !ß !Ñ "&!  $!)
8.2-3.
(a) Starting with the optimal tableau for ) œ !, after two iterations, we get:
Iter. BV Eq. # ^ B" B# B$ B% B& RS
! ^ ! " ! ! &) #  #) )  $) ##!
B# " ! ! " " " " "!
B" # ! " ! ! " # "!
)$) "#)
" ^ ! " # ! &) # ! ")!  "&)
" "
B# " ! # " " # ! "&
"
B& # ! # ! !  "# " &
"$%) (#)
# ^ ! " # ! ! # ! "!&  $!)
" "
B$ " ! # &  ) " # ! "&
"
B& # ! # ! !  "# " &
) ÐB‡" ß B‡# ß B‡$ Ñ ^ ‡ Ð) Ñ
! Ÿ ) Ÿ )Î$ Ð"!ß "!ß !Ñ ##!
)Î$ Ÿ ) Ÿ & Ð!ß "&ß !Ñ ")!  "&)
& Ÿ) Ð!ß !ß "&Ñ "!&  $!)

)-7
(b) The dual problem is:
minimize $!C"  #!C#
subject to C"  C# "!  )
#C"  C# "#  )
#C"  C# (  #)
C" ß C# !.
Starting with the optimal tableau for ) œ !, after two iterations, we get:
Iter. BV Eq. # ^ C" C# C$ C% C& RS
! ^ ! " ! ! "! "! ! ##!
C# " ! ! " # " ! )  $)
C" # ! " ! " " ! #  #)
C& $ ! ! ! ! " " &)
" ^ ! " ! & ! "& ! ")!  "&)
C$ " ! !  "# "  "# ! %  "Þ&)
"
C" # ! " # !  "# ! '  !Þ&)
C& $ ! ! ! ! " " &)
# ^ ! " ! & ! ! "& "!&  $!)
C$ " ! !  "# " !  "# 'Þ&  #)
"
C" # ! " # ! !  "# $Þ&  )
C% $ ! ! ! ! " " &  )
) ÐC"‡ ß C#‡ Ñ ^ ‡ Ð)Ñ
! Ÿ ) Ÿ )Î$ Ð#  #)ß )  $)Ñ ##!
)Î$ Ÿ ) Ÿ & Ð'  !Þ&)ß !Ñ ")!  "&)
& Ÿ) Ð$Þ&  )ß !Ñ "!&  $!)
The basic solutions are the same as those in part (a).

)-8
! Ÿ ) Ÿ )Î$ : C‡ from Ð#ß )Ñ to Ð##Î$ß !Ñ
)Î$ Ÿ ) Ÿ & : C‡ from Ð##Î$ß !Ñ to Ð"(Î#ß !Ñ
&Ÿ) : C‡ œ Ð$Þ&  )ß !Ñ

)-9
8.2-4.

) ÐB‡" ß B‡# Ñ ^ ‡ Ð) Ñ
!Ÿ)Ÿ" Ð"!  #)ß "!  #)Ñ $!  ')
"Ÿ)Ÿ& Ð"!  #)ß "&  $)Ñ $&  )
& Ÿ ) Ÿ #& Ð#&  )ß !Ñ &!  #)

)-10
8.2-5.
Starting with the optimal tableau for ) œ !, after two iterations, we get:

) ÐB‡" ß B‡# ß B‡$ ß B‡% Ñ ^ ‡ Ð) Ñ

! Ÿ)Ÿ' Ð$!  )ß !ß !ß !Ñ "&!  &)
' Ÿ ) Ÿ "" Ð$'ß !ß '  )ß !Ñ "%%  %)
"" Ÿ ) Ÿ $& Ð&#Þ&  "Þ&)ß !ß ##Þ&  #Þ&)ß !Ñ "'!Þ&  #Þ&)
) œ $! provides the largest value of the objective function: B‡ Ð$!Ñ œ Ð(Þ&ß !ß &#Þ&ß !Ñ,
^ ‡ Ð$!Ñ œ #$&Þ&.

)-11
8.2-6.

) ÐB‡" ß B‡# ß B‡$ Ñ ^ ‡ Ð) Ñ

! Ÿ ) Ÿ "!Î* Ð!ß #!  #)ß !Ñ "!!  "!)
"!Î* Ÿ ) Ÿ (!Î#$ Ð!ß $&  ""Þ&) ß &  %Þ&)Ñ ""!  )
(!Î#$ Ÿ ) Ÿ *! Ð!ß !ß *  !Þ")Ñ ""(  "Þ$)
8.2-7.
(a) Let BÐ5Ñ be the 5 th optimal solution obtained as ) is increased from !. Each BÐ5Ñ is
optimal for some )-interval, say )5 Ÿ ) Ÿ )5" , and the objective function value
^Ð)Ñ œ α5  "5 ) for some α5 and "5 , so ^Ð)Ñ is linear in this interval. As the interval
changes, α5 and "5 change so that a different linear function is obtained for each interval.
(b) The problem is:
^Ð)Ñ œ  Ð-4  α4 )ÑB4
8
maximize

 +34 B4 Ÿ ,3 , 3 œ "ß #ß á ß 7
4œ"
8
subject to
4œ"
B4 !, 4 œ "ß #ß á ß 8.
Note that the feasible region does not depend on ). Consider )"  )# and let )$ œ -)" 
Ð"Ñ Ð#Ñ Ð$Ñ

Ð4 œ "ß #ß á ß 8Ñ for )" , )# and )$ respectively. Let ^Ð)ß BÑ œ 84œ" Ð-4  α4 )ÑB4 .
Ð"  -Ñ)# for some ! Ÿ - Ÿ ". Let B4 , B4 and B4 be the optimal values of B4

^ ‡ Ð)" Ñ œ ^Ð)" ß BÐ"Ñ Ñ ^Ð)" ß BÐ$Ñ Ñ Ê -^ ‡ Ð)" Ñ -^Ð)" ß BÐ$Ñ Ñ

^ ‡ Ð)# Ñ œ ^Ð)# ß BÐ#Ñ Ñ ^Ð)# ß BÐ$Ñ Ñ Ê Ð"  -Ñ^ ‡ Ð)# Ñ Ð"  -Ñ^Ð)# ß BÐ$Ñ Ñ

)-12
Ê -^ ‡ Ð)" Ñ  Ð"  -Ñ^ ‡ Ð)# Ñ -^Ð)" ß BÐ$Ñ Ñ  Ð"  -Ñ^Ð)# ß BÐ$Ñ Ñ

œ - Ð-4  α4 )" ÑB4  Ð"  -Ñ Ð-4  α4 )# ÑB4

8 8
Ð$Ñ Ð$Ñ
4œ" 4œ"

œ  -4  α4 Ð-)"  Ð"  -Ñ)# ÑB4

8
Ð$Ñ
4œ"

œ  Ð-4  α4 )$ ÑB4 œ ^Ð)$ ß BÐ$Ñ Ñ œ ^ ‡ Ð)$ Ñ

8
Ð$Ñ
4œ"

Hence, ^ ‡ Ð)Ñ is convex in ).

8.2-8.
(a) The same argument as in part (a) of problem 8.2-7 holds.
(b) The problem is:
^Ð)Ñ œ  -4 B4
8
maximize

 +34 B4 Ÿ ,3  α3 ), 3 œ "ß #ß á ß 7
4œ"
8
subject to
4œ"
B4 !, 4 œ "ß #ß á ß 8.
Ð"Ñ Ð#Ñ
Consider )"  )# and let )$ œ -)"  Ð"  -Ñ)# for some ! Ÿ - Ÿ ". Let B4 , B4 and
Ð$Ñ
B4 be the optimal values of B4 Ð4 œ "ß #ß á ß 8Ñ for )" , )# and )$ respectively.

-^ ‡ Ð)" Ñ  Ð"  -Ñ^ ‡ Ð)# Ñ œ - -4 B4  Ð"  -Ñ -4 B4

8 8
Ð"Ñ Ð#Ñ

4œ" 4œ"

œ  -4 Ð-B4  Ð"  -ÑB4 Ñ

8
Ð"Ñ Ð#Ñ
4œ"
Ð"Ñ Ð#Ñ
If Bw4 œ -B4  Ð"  -ÑB4 Ð4 œ "ß #ß á ß 8Ñ, then Bw is feasible for ) œ )$ , since

 +34 Bw4 œ - +34 BÐ"Ñ  +34 B4Ð#Ñ œ -Ð,3  α3 )Ñ  Ð"  -ÑÐ,3  α3 ) Ñ

8 8 8
4  Ð"  -Ñ
4œ" 4œ" 4œ"

œ ,3  α3 ), 3 œ "ß #ß á ß 7.
Since BÐ$Ñ is optimal for )$ ,
 -4 Ð-BÐ"Ñ  -4 B4Ð$Ñ œ ^ ‡ Ð)$ Ñ.
8 8
Ð#Ñ
4  Ð"  -ÑB4 Ñ Ÿ
4œ" 4œ"

Hence, ^ ‡ Ð)Ñ is concave in ).

)-13
8.2-9.
From duality theory,
 Ð,3  53 ÑC3
7
^ ‡‡ œ minimum
3œ"

 +34 C3
7
subject to -4 , 4 œ "ß #ß á ß 8
3œ"

C3 !, 3 œ "ß #ß á ß 7.
ÐC"‡ ß C#‡ ß á ß C7
‡
Ñ is feasible for this problem, so

^ ‡‡ Ÿ  Ð,3  53 ÑC3‡ œ ^ ‡   53 C3‡ .

7 7

3œ" 3œ"

8.3-1.
(a) Optimal Solution: ÐB*" ß B*# Ñ œ Ð"!ß "!Ñ and ^ * œ $!

)-14
(b) ÐB" ß B# Ñ œ Ð"!ß "!Ñ is optimal with ^ œ $!Þ

(c) The upper-bound technique goes from Ð!ß !Ñ to Ð&ß !Ñ to Ð"!ß &Ñ to Ð"!ß "!ÑÞ

)-15
8.3-2.
BV Eq. ^ B" B# B$ B% B& RS
^ ! " " $ # ! ! ! B# Ÿ $
B% " ! ! " # " ! " B# Ÿ "
B& # ! # " # ! " ) B# Ÿ )
BV Eq. ^ B" B# B$ B% B& RS
^ ! " " ! % $ ! $ B$ Ÿ #
B# " ! ! " # " ! " B$ Ÿ "
B& # ! # ! % " " ( B$ Ÿ " $%
BV Eq. ^ B" C# B$ B% B& RS
^ ! " " ! % $ ! $ B$ Ÿ #
C# " ! ! " # " ! # B$ Ÿ "
B& # ! # ! % " " ( B$ Ÿ " $%
BV Eq. ^ B" C# B$ B% B& RS
^ ! " " # ! " ! (
"
B$ " ! ! # "  "# ! " B" Ÿ "
B& # ! # # ! " " $ B" Ÿ " "#
BV Eq. ^ C" C# B$ B% B& RS
^ ! " " # ! " ! )
"
B$ " ! ! # "  "# ! "
B& # ! # # ! " " "
ÐB" ß B# ß B$ Ñ œ Ð"ß $ß "Ñ is optimal with ^ œ ).
8.3-3.
Initial Tableau
BV Eq. ^ B" B# B$ B% B& B' RS
^ ! " # $ # & ! ! !
B& " ! # # " # " ! &
B' # ! " # $ % ! " &
Final Tableau (after five iterations)
BV Eq. ^ B" C# B$ C% B& B' RS
" $ % ' &%
^ ! " ! ( ! ( ( ( (
B" " ! "  )( !  "!
(
$
(
"
(
#
(
# ' "
B$ # ! ! ( " ( (  #( $
(

ÐB" ß B# ß B$ ß B% Ñ œ Ð#Î(ß "ß $Î(ß "Ñ is optimal with ^ œ &%Î(.

)-16
8.3-4.
Initial Tableau
BV Eq. ^ B" B# B$ B% B& B' B( RS
^ ! " # & $ % " ! ! !
B' " ! " $ # $ " " ! '
B( # ! % ' & ( " ! " "&
Final Tableau (after seven iterations)
BV Eq. ^ C" C# C$ C% B& B' B( RS
# " " %
^ ! " $ " $ ! $ $ ! "!
" #
C% " ! $ " $ "  "$  "$ ! "
B( # !  &$ "  "$ !  %$  ($ " !
ÐB" ß B# ß B$ ß B% ß B& Ñ œ Ð"ß "ß "ß !ß !Ñ is optimal with ^ œ "!.
7.3-5.

ÐB" ß B# ß B$ Ñ œ Ð"!ß &ß &Ñ is optimal with ^ œ '!.

)-17
8.4-1.
It. X1 X2 X3
0 1 3 7
1 1.04605 4.95395 10.9539
2 0.93406 6.06594 13.0659
8.4-2.
(a)

The feasible corner point solutions are Ð!ß !Ñ, Ð!ß %Ñ and Ð%ß !Ñ. The last one is optimal
with ^ œ "#.
(b) Iter. B" B# ^
! " " %
" "Þ)(& "Þ"#& 'Þ(&
# #Þ'*)" !Þ)!"* )Þ)*'#"
$ $Þ$%$*' !Þ%!!*& "!Þ%$#)
% $Þ''(" !Þ#!!%( ""Þ#!")
(c)

)-18
)-19
)-20
8.4-3.
(a)
Iter. B" B# ^
! % % "#
" # ' "%
# " ( "&
$ !Þ& (Þ& "&Þ&
% !Þ#& (Þ(& "&Þ(&
& !Þ"#& (Þ)(& "&Þ)(&
' !Þ!'#& (Þ*$(& "&Þ*$(&
( !Þ!$"#& (Þ*')(& "&Þ*'))
) !Þ!"&'# (Þ*)%$) "&Þ*)%%
* !Þ!!()" (Þ**#"* "&Þ**##
(b) The value of B" is halved at each step so subsequent trial solutions should be of the
form ÐB" ß B# Ñ œ Ð#3 ß )  #3 Ñ for 3 œ "ß #ß á .
(c) The smallest integer 3 such that #3  #Ð3"Ñ œ #Ð3"Ñ Ÿ !Þ!" is ', so ÐB" ß B# Ñ œ
Ð#( ß )  #( Ñ œ Ð!Þ!!()ß (Þ**##Ñ in iteration *.
8.4-4.
(a) Optimal Solution: ÐB" ß B# Ñ œ Ð3ß 3Ñ, ^ œ 6

(b) The gradient is Ð1ß "Ñ. Moving from the origin in the direction Ð1ß "Ñ, the first
boundary point encountered is the optimal solution Ð3ß 3Ñ.

)-21
(c) α œ !Þ&

(d) α œ !Þ*

)-22
8.4-5.
(a)

(b) Gradient:  # & ( 

# "  "  " #
Projected Gradient: T & œ M  #  " $ #  " $  &
( $ $ (
# #

#  $$   & 
(  **   " 
" "
œ &  "% '' œ "% %

(c) - (d)
Iter. B" B# B$ ^
! " " " "%
" !Þ& "Þ% !Þ* "%Þ$
# !Þ#&*'* #Þ"*&"' !Þ%& "%Þ'%&#
$ !Þ"(*%( #Þ&(#(' !Þ##& "%Þ(*()
% !Þ"!'* #Þ((() !Þ""#& "%Þ)*!$
& !Þ!&&*& #Þ))('& !Þ!&'#& "%Þ*%$*
' !Þ!#)" #Þ*%$(' !Þ!#)"# "%Þ*("*
( !Þ!"%!' #Þ*(")) !Þ!"%!' "%Þ*)&*
) !Þ!!(!$ #Þ*)&*% !Þ!!(!$ "%Þ**$
* !Þ!!$&# #Þ**#*( !Þ!!$&# "%Þ**'&
"! !Þ!!"(' #Þ**'%) !Þ!!"(' "%Þ**)#

)-23
8.4-6.
Iter. B" B# ^
! # # "'
" #Þ$$' $Þ%*' #%Þ%))
# #Þ#$!'( %Þ'&$** #*Þ*'#
$ #Þ!$&*( &Þ$#'** $#Þ(%#*
% "Þ*&#"" &Þ''$& $%Þ"($)
& "Þ*&!&% &Þ)$"(& $&Þ!"!%
' "Þ*("'* &Þ*"&)( $&Þ%*%%
( "Þ*)&)) &Þ*&()) $&Þ(%("
) "Þ**#*' &Þ*()*" $&Þ)($%
* "Þ**'%) &Þ*)*%& $&Þ*$'(
"! "Þ**)#% &Þ**%($ $&Þ*')%
"" "Þ***"# &Þ**($' $&Þ*)%#
"# "Þ***&' &Þ**)') $&Þ**#"
"$ "Þ***() &Þ***$% $&Þ**'
"% "Þ***)* &Þ***'( $&Þ**)
"& "Þ****& &Þ***)% $&Þ***

)-24