Deo Brat Ojha, Int. J. Comp. Tech. Appl.
, Vol 2 (1), 103-111 ISSN : 2229-6093
SECOND-ORDER DUALITY FOR MULTIOBJECTIVE PROGRAMMING
INVOLVING (  , ρ)-INVEXITY
Deo Brat Ojha
e-mail: ojhdb@yahoo.co.in
R.K.G.I.T., Ghaziabad,INDIA
Abstract: The concepts of (  , ρ)-invexity have been given by Caristi, Ferrara and Stefanescu[1]. We
consider a second-order dual model associated to a multiobjective programming problem involving
support functions and a weak duality result is established under appropriate second-order (  , ρ)-
invexity conditions.
AMS 2002 Subject Classification: 90C29, 90C30, 90C46.
Key words: Higher-order (  ,ρ)-(pseudo/quasi)-convexity/invexity, multiobjective programming,
second-order duality, duality theorem.
1. INTRODUCTION
For nonlinear programming problems,
a number of duals have been suggested
among which the Wolfe dual [35,8] is
well known. In 1981, Hanson[39],
remarkably pointed out that the K-T
sufficiency conditions lack invariance
in that the applicability of the
conditions for any given problems
depends on the nature of the analytical
formulation of the problem. Hanson
showed that the Kuhn-Tucker
necessary conditions are sufficient for
a minimum.
This property was generalized by
Craven(1981)[40], to a property, called
K-invex, of a vector function in
relation to a convex cone K .Also
necessary conditions and sufficient
conditions have been obtained for a
function to be K-invex. This leads to a
new second order sufficient condition
for a constrained minimum.
While studying duality under
generalized convexity, Mond and Weir
[36] proposed a number of deferent
duals for nonlinear programming
problems with nonnegative variables
and proved various duality theorems
under
1
appropriate pseudo-convexity/quasi-
convexit assumptions.
The study of second order duality is
significant due to the computational
advantage over first order duality as it
provides tighter bounds for the value
of the objective function when
approximations are used
[10,16,24].Mangasarian[12]
considered a nonlinear programming
problem and discussed second order
duality under inclusion condition.
Mond [14] was the first who present
second order convexity. He also gave
in [14] simpler conditions than
Mangasarian using a generalized form
of convexity. which was later called
bonvexity by Bector and Chandra [2].
Further, Jeyakumar [37,30] and Yang
[24] discussed also second order
Mangasarian type dual formulation
under ρ-convexity and generalized
representation conditions respectively.
In [20] Zhang and Mond established
some duality theorems for second-
order duality in nonlinear
programming under generalized
second-order B-invexity, defined in
their paper. In [14] it was shown that
103
 Deo Brat Ojha, Int. J. Comp. Tech. Appl., Vol 2 (1), 103-111
second order duality can be useful
from computational point of view,
since one may obtain better lower
bounds for the primal problem than
otherwise. The case of some
optimization problems that involve n-
set functions was studied by Preda
[38]. Recently, Yang et al. [24]
proposed four second-order dual
models for nonlinear programming
problems and established some duality
results under generalized second-order
F -convexity assumptions.
For
( x, a, ( y, r ))  F ( x, a; y)  rd 2 ( x, a) ,
where F ( x, a;.) is sublinear on R n , the
definition of (,  ) - invexity reduces
to the definition of ( F ,  ) -convexity
introduced by Preda[29], which in turn
Jeyakumar[30] generalizes the
concepts of F-convexity and  -
invexity[31].
The more recent literature, Xu[21],
Ojha [27], Ojha and Mukherjee [22]
for duality under generalized ( F ,  ) -
convexity, Mishra [23] and Yang et
al.[24] for duality under second order
F -convexity. Liang et al. [25] and
Hachimi[26] for optimality criteria and
duality involving (F , ,  , d ) -
convexity or generalized {F ,  ,  , d ) -
type functions. The ( F ,  ) -convexity
was recently generalized to (,  ) -
invexity by Caristi , Ferrara and
Stefanescu [32],and here we will use
this concept to extend some theoretical
results of multiobjective programming.
Whenever the objective function and
all active restriction functions satisfy
simultaneously the same generalized
invexity at a Kuhn-Tucker point which
is an optimum condition, then all these
functions should satisfy the usual
invexity, too. This is not the case in
2
ISSN : 2229-6093
multiobjective programming ; Ferrara
and Stefanescu[28] showed that
sufficiency Kuhn-Tucker condition can
be proved under (,  ) -invexity, even
if Hanson’s invexity is not satisfied,
Puglisi[34].The interested reader may
consult[1,3,4,5,6,7,9,11,13,15,17,18,19
,33].
Therefore, the results of this paper are
real extensions of the similar results
known in the literature.
In Section 2, we define the second-
order (  , ρ)-invexity . In Section 3
and 4 we consider a class of
multiobjective programming problems
and for the dual model we prove a
weak duality result. In section 5, we
are only giving outline of fractional
multiobjective mathematical
programming. Section 6 is conclusion
and remark.
2.Notation and Preliminaries:
Throughout the paper, following
convention for vectors in R n will be
followed:
x y if and only if xi yi , i  1, 2,.,., n ,
x  y if and only if x y and x  y ,
x y if and only if
xi  yi , i  1, 2,.,., n .
The problem to be considered here is
the following multiobjective nonlinear
programming problem:
Minimize f ( x)
(P)
Subject to g ( x)0, x  X
(1)
where
f  ( f1 , f 2 ,.,., f k ) : X  Rk ,
g  ( g1 , g2 ,.,., gm ) : X  Rm are
assumed to be twice differentiable
function over X , an open subset of
Rn .
104
 Deo Brat Ojha, Int. J. Comp. Tech. Appl., Vol 2 (1), 103-111 ISSN : 2229-6093

We consider f : R p  R , and by 2 f (a) the

f : R  R , g : R  R ,are
n p n q
differential functions and X  Rn is
an open set.
Let X0 be the set of all feasible
solutions of (P) that
X 0  {x  X g ( x) 0} .
We quote some definitions and also
give some new ones.
Definition 2.1
A vector a  X 0 is said to be an
efficient solution of problem (P) if
there exit no x  X 0 such that
f (a)  f ( x)  Rp \{0} i.e.,
fi ( x)  fi (a) for all i {1,.,.,., p} , and
for at least one j {1,.,.,., p} we have
f i ( x)  f i (a ) .
Definition 2.2
A point a  X is said to be a weak
0
Hessian matrix of f at a . For a real
valued twice differentiable function
 ( x, y) defined on an open set in
R p  Rq , we denote by  x (a, b) the
is,
gradient vector of  with respect to
x at (a, b) , and by  xx (a, b) the
Hessian matrix with respect to x at
(a, b) . Similarly, we may define
 y (a, b) ,  xy (a, b) and  yy (a, b) .
For convenience, let us write the
definitions of ,   -univexity from[1],
Let  : X 0  R be a differentiable
function ( X  Rn ) , X  X , and
0 0
a  X . An element of all (n+1)-
0
dimensional Euclidean Space R n 1 is
represented as the ordered pair
( z, r ) with z  Rn and r  R,  is a real
number and  is real valued function
defined on
X 0  X 0  R , suchthat   x, a,. is
n 1

efficient solution of problem (VP) if

there is no x  X such that f ( x)  f (a). convex on Rn  1 and   x, a,  0, r    0, for

Definition 2.3 every  x, a   X 0  X 0 and

A point a  X 0 is said to be a properly
r  R , h : X  Rn  R be
efficient solution of (VP) if it is 
efficient and there exist a positive differentiable function.
constant K such that for each x  X 0 Definition 2.1:
The twice differentiable function
and for each i 1, 2...... p satisfying f i over X is said to be second order
fi ( x)  fi (a) , there exist at least one (  , ρ)-invex at z0 with respect to X ,
i 1, 2...... p suchthat f ( a) f ( x) if for any z  R n for fixed w  R n ,there
j j
exist a vector p  R n and real number
and f (a)  f ( x)  K  f ( x)  f (a)  .
i i  j j  i , such that
Denoting by WE(P), E(P) and PE(P) 1
the sets of all weakly efficient, { f ( z, w)  f ( z , w)  pT  zz f ( z , w) p}( z, z ;( z f ( z , w)  zz f ( z , w) p, ))
0 2 0 0 0 0
efficient and properly efficient
solutions of (VP), we have Definition 2.2:
PE(P)  E(P)  WE(P).
The twice differentiable function
We denote by f (a) the gradient f i over X is said to be second order
vector at a of a differentiable function

3
105
 Deo Brat Ojha, Int. J. Comp. Tech. Appl., Vol 2 (1), 103-111 ISSN : 2229-6093

(  , ρ)-incave at z0 with respect to X , w  R n ,there exist a vector p  R n and

and if for z  R n for fixed
any real number i , such that
1
{ f ( z, w)  f ( z , w)  pT  zz f ( z , w) p}( z, z ;(  z f ( z , w)   zz f ( z , w) p,  ))
0 2 0 0 0 0
(  , ρ)-pseudoinvex at z0 with respect
to X , if for any z  R n for fixed
Definition 2.3:
The twice differentiable function w  R n ,there exist a vector p  R n and
f i over X is said to be second order real number i , such that

1
( z, z ;( z f ( z , w)   zz f ( z , w) p,  ))0  { f ( z, w)  f ( z , w)  pT  zz f ( z , w) p}0
0 0 0 0 2 0
Definition 2.4:
The twice differentiable function and b : Rn  Rn  R n  R if for any
f i over X is said to be second order
z  R n for fixed w  R n ,there exist a
(  , ρ)-incave at z0 with respect to X , vector p  R n and real number i ,
such that
1
{ f ( z, w)  f ( z , w)  pT  zz f ( z , w) p}0  ( z, z ;(  z f ( z , w)   zz f ( z , w) p,  ))0
0 2 0 0 0 0

Lemma 2.1:
(i) If f (., w) is (  , ρ)-invex and
g (., w) is (  , ρ)-incave, then p(., w) is Dual (SMD)
(  , ρ)-pseudoinvex. Maximize  (u, v, p ) 
1
(ii) If f (., w) is (  , ρ)-inccave and 1
g (., w) is (  , ρ)-invex, then p(., w) is  { f (u, v)  uT  f (u, v)  uT  f (u, v) p  p T  f (u, v) p }
z zz 1 2 1 zz 1
(  , ρ)-pseudoincave.
Subject to
3. Second order Wolfe type  f (u, v)   f (u, v) p 0
symmetric duality : z zz 1
We consider the following higher- v0 ;
order Mond-Weir type pair and prove
a weak duality theorem. Theorem 3.1:

Primal (SMP) Let f (., w) be second-order  0 -

Minimize  (z, w, p)  univex at u and f ( z,.) be second-
 { f ( z, w)  wT w f ( z, w)  wT ww f ( z, w) p  pT ww f ( z, w) p} order 1 -incave at w and for all
1
2 ( z, w) feasible for (SMP) and all
(u, v) feasible for (SMD) .
Subject to
w f ( z, w)  ww f ( z, w) p0
z0 ;

4
106
 Deo Brat Ojha, Int. J. Comp. Tech. Appl., Vol 2 (1), 103-111 ISSN : 2229-6093

(I)
 ( z, u;(   ,  ))  uT   uT  ,
0 1 2 1 2
F ( z, u;    )  uT   uT  0,  ,   Rn
0 1 2 1 2 1 2 and
1 (v, w;(1  2 ,  ))  wT1  wT2 .
(II) Thereafter, we get
F1 (v, w;1  2 )  wT1  wT2 0,1 ,2  Rn 1 1
f ( z, w)  pT  ww f ( z, w) p  f ( z, v)  pT  zz f (u, v) p
2 2
Then inf(SMP)  Sup(SMD) .
Then inf(SMP)  Sup(SMD) .
Proof:
Let b : Rn  Rn  Rn  Rnn  R The second strong duality theorem
1   f (u, v) 2   f (u, v) . can be developed on the lines of [6] in
z zz the view of the above theorem.
Then
 ( z, u;(   ,  ))  uT   uT  0, 4. Mond-Weir type symmetric
0 1 2 1 2 duality in second-order:
We consider the following second
Which by the second order (  0 , ρ)- order Mond-Weir type pair and prove
invexity of f (., w) at u yields, a weak duality theorem.
1 Primal (SMP)
f ( z, v)  f (u, v)  pT  zz f (u, v) p ( z, u;(   ,  )) Minimize  (z, w, p) 
2 0 1 2
-----------(1) 1
 { f ( z, w)  wT  w f ( z, w)  wT  ww f ( z, w) p  pT  ww f ( z, w) p}
Let, 1  w f ( z, w),2  ww f ( z, w) p 2

Subject to
1 (v, w;(1  2 ,  ))  wT1  wT2 0
w f ( z, w)  ww f ( z, w) p0
,
wT w f ( z, w)  wT ww f ( z, w) p0 ,
which by the second order ( 1 , ρ)- z0 ;
incavity of f ( z,.) at w gives Dual (SMD)
1 Maximize  (u, v, p ) 
f ( z, w)  f ( z, v)  pT ww f ( z, w) p1 (v, w;(1  2 ,  )) 1
2 1
---------- (2)  { f (u, v)  uT  f (u, v)  uT  f (u, v) p  p T  f (u, v) p }
z zz 1 2 1 zz 1

combining (1) and (2) , Subject to

1 1  f (u, v)   f (u, v) p 0
{ f ( z, w)  pT  ww f ( z, w) p}  { f ( z, v)  pT  zz f (u, v) p} z zz 1
2 2
 ( z, u;(   ,  ))  1 (v, w;(1  2 ,  )) u  f (u, v)  u  f (u, v) p 0
T T

0 1 2 z zz 1
------------(3) v0 ;

Using the hypothesis of the theorem , Theorem 4.1:

Let f (., w) be second order  0 -
pseudoinvex at u and f ( z,.) be

5
107
 Deo Brat Ojha, Int. J. Comp. Tech. Appl., Vol 2 (1), 103-111 ISSN : 2229-6093

second order 1 -pseudoincave at w The second order strong duality

and for all ( z, w) feasible for (SMP) theorem can be developed on the lines
and all (u, v) feasible for (SMD) .
of [6] in the view of the above
 ( z, u;(   ,  ))  uT   uT  0,  ,   Rn theorem.
0 1 2 1 2 1 2
5. Second order dual fractional
(II) programming
1 (v, w;(1  2 ,  ))  wT1  wT2 0,1,2  Rn
In this section, we extend above to the
Then inf(SMP)  Sup(SMD) . second order complex fractional
symmetric dual pair (SFP) and (SFD)
as follows :
Proof:
Let 1   f (u, v) 2   f (u, v) . Primal (HFP)
z zz 1
Then  { f ( z, w)  wT  w f ( z, w)  wT  ww f ( z, w) p  pT  ww f ( z , w) p}
Minimize  2
 ( z, u;(   ,  ))  uT   uT  0,
1
 {g ( z, w)  wT  w g ( z, w)  wT  ww g ( z , w) p  pT  ww g ( z , w) p}
0 1 2 1 2 2

Which by the second order  0 - Subject to

G( z, w, p){w f ( z, w) ww f ( z, w) p}  H ( z, w, p){w g ( z, w) ww g ( z, w) p}0
pseudoinvexity of f (., w) at u yields,
1
f ( z, v)  f (u, v)  pT  zz f (u, v) p0 wT {G( z, w, p1 ) w f ( z, w)  H ( z, w, p1 ) w g ( z, w)}
2
-----------(3)  wT {G( z, w, p1 ) ww f ( z, w) p1  H ( z, w, p1 ) ww g ( z, w) p1 0
Let, 1  w f ( z, w),2  ww f ( z, w) p z0 ;
where
1 (v, w;(1  2 ,  ))  wT1  wT2 0 1
G( z, w, p1 )   {g ( z, w)  wT w g ( z, w)  wT ww g ( z, w) p1  p1T ww g ( z, w) p1}
, 2
which by the second order 1 - and
1
pseudoincavity of f ( z,.) at w gives H ( z, w, p)   { f ( z, w)  wT w f ( z, w)  wT ww f ( z, w) p  pT ww f ( z, w) p}
2
1
f ( z, w)  f ( z, v)  pT  ww f ( z, w) p0
2 Dual (HMD)
---------- (4) 1
combining (1) and (2) , and using  { f (u, v)  uT  f (u, v)  uT  f (u, v) p  p T  f (u, v) p }
z zz 1 2 1 zz 1
property of function  and b Maximize
1
1 1  {g (u, v)  uT  g (u, v)  uT  g (u, v) p  p T  g (u, v) p }
{ f ( z, w)  pT ww f ( z, w) p}  { f ( z, v)  pT  zz f (u, v) p} z zz 1 2 1 zz 1
2 2 ;
G(u, v, p1 ){ f (u, v)  f (u, v) p }  H ((u, v, p1){ g (u, v)  g (u, v) p }0
That i.e., inf(SMP)  Sup(SMD) . z zz 1 z zz 1

6
108
 Deo Brat Ojha, Int. J. Comp. Tech. Appl., Vol 2 (1), 103-111
uT {G(u, v, p1 ){ f (u, v)  H (u, v, p1 ) g (u, v)}}
z z
u {G(u, v, p1 ){ f (u, v) p  H (u, v, p1 ) g (u, v) p }}0
T
zz 1 zz
, v0 ;
where
G(u, v, p1 )   {g (u, v)  uT  g (u, v)  uT  g (u, v) p  p T  g (u, v) p }
z zz
and
H (u, v, p3 ) { f (u, v)  uT  f (u, v)  uT  f (u, v) p  p T  f (u, v) p }
z zz
It is assumed that Re G  0 and
Re H  0 throughout the feasible
regions defined by the primal (SFP)
and the dual problem (SFD).
Lemma 2.1 above can be extended to
the higher order and also next theorem
on the line of Mishra et.al. [23].
6. Particular cases and remark in
applications
(i) If we take, then this is an earlier
work by Mishra et al. [6]. On the same
condition if it is single objective and
f is real and differential then this is an
earlier work [7] .
(ii) If we take, the function f to be real
and differentiable and F0  F1 , then
this is an earlier work by Gulati and
Ahmad [15].
7. Acknowledgement
Author is grateful to anonymous
referee for their valuable suggestion.
References
[1]I.Ahmad,Z.Husain,Nondifferentiable
second order symmetric duality in
multiobjective programming, Applied
Mathematics Letters18(2005)721–728
[2] C.R. Bector, S. Chandra, Generalized
bonvexity and higher order duality for
ISSN : 2229-6093
fractional programming, Opsearch 24
(1987) 143–154.
[3] S. Chandra, B.D. Craven, B. Mond,
1 Generalized concavity and duality with a
1 square root term, Optimization 16
(1985)653–662.
1 2 1 zz 1
[4] S. Chandra, A. Goyal, I. Husain, On
symmetric duality in mathematical
1
programming with F-convexity,
1 2 1 zz 1 Optimization 43(1998) 1–18.
[5] S. Chandra, I. Husain,
Nondifferentiable symmetric dual
programs, Bull.Austral. Math. Soc. 24
(1981) 295–307.
[6] S. Chandra, D. Prasad, Symmetric
duality in multiobjective programming, J.
Austral. Math. Soc. (Ser. B) 35 (1993)
198–206.
[7] B.D. Craven, Lagrangian conditions
and quasiduality, Bull. Austral. Math. Soc.
16 (1977) 325–339.
[8] W.S. Dorn, A symmetric dual theorem
for quadratic programs, J. Oper. Res.Soc.
Japan 2 (1960) 93–97.
[9] T.R. Gulati, I. Ahmad, I. Husain,
Second order symmetric duality with
generalized convexity, Opsearch 38
(2001)210–222.
[10] T.R. Gulati, I. Husain, A. Ahmed,
Multiobjective symmetric duality with
invexity, Bull. Austral. Math. Soc. 56
(1997)25–36.
[11] D.S. Kim, Y.B. Yun, H. Kuk, Second
order symmetric and self duality in
multiobjective programming, Appl. Math.
Lett.10 (1997) 17–22.
[12] O.L. Mangasarian, Second and higher
order duality in nonlinear programming, J.
Math. Anal. Appl. 51 (1975) 607–620.
[13] S.K.Mishra, Second order symmetric
duality in mathematical programming with
F-convexity, European J. Oper. Res.
127(2000) 507–518.
[14] B. Mond, Second order duality for
nonlinear programs, Opsearch 11 (1974)
90–99.
[15] B. Mond, I. Husain, M.V. Durga
Prasad, Duality for a class of
7
109
 Deo Brat Ojha, Int. J. Comp. Tech. Appl., Vol 2 (1), 103-111 ISSN : 2229-6093

nondifferentiable multiobjective [27] D.B.Ojha, Some results on symmetric

programming, Util. Math.39 (1991) 3–19. duality on mathematical fractional
[16] S.K. Suneja, C.S. Lalitha, S. programming with generalized F-
Khurana, Second order symmetric duality convexity in complex spaces, Tamkang
in multiobjective programming, Journal of Math vol.36, No.2(2005).
European. J. Oper.Res. 144 (2003) 492– [28] M.Ferrara, M.V.Stefanescu,
500. Optimality condition and duality in
[17] P.S. Unger, A.P. Hunter Jr., The dual multiobjective programming with (,  ) -
of the dual as a linear approximation of invexity,Yugoslav Journal of Operations
the primal, Int. J. Syst. Sci. 12 Research,vol.18(2008)No.2,153-165.
(1974)1119–1130. [29]V.Preda, On efficiency and duality for
[18] T.Weir, B.Mond, Symmetric and self multiobjective programs, J.Math.
duality in multiobjective programming, Anal.Appl. 166(1992),365-377.
Asia-Pacific J. Oper. Res. 5 (1988) 124– [30] V.Jeyakumar, Strong and weak
133. invexity in mathematical programming,
[19] X.M. Yang, S.H. Hou, Second order In: Methods of Operations Research,
symmetric duality in multiobjective vol.55(1985),109-125.
programming, Appl. Math. Lett. 14 [31] J.P.Vial, Strong and weak convexity
(2001)587–592. of sets and functions, Math. Operations
[20] J. Zhang and B. Mond, Second order Research,8(1983),231-259.
B-invexity and duality in mathematical [32] G.Caristi,M.Ferrara and A.
programming.Utilitas Math. 50 (1996), Stefanescu, Mathematical programming
19–31. with (,  ) -invexity, In: V.Igor,Konnov,
[21] Z.Xu, Mixed type duality in
Dinh The Luc,Alexander,
multiobjective programming problems,
M.Rubinov,(eds.), Generalized Convexity
J.Math.Anal.Appl. 198(1995)621-635.
and Related Topics, Lecture Notes in
[22] D.B.Ojha and R.N.Mukherjee, Some
Economics and Mathematical Systems,
results on symmetric duality of
vol.583, Springer,2006,167-176.
multiobjective programmes with (F,  )-
[33] A.Puglisi, Generalized convexity and
invexity, European Journal of Operational invexity in optimization theory: Some new
Reaearch,168(2006),333-339. results, Applied Mathematical Sciences,
[23] S.K.Mishra, Second order symmetric vol.3,No.47(2009),2311-2325.
duality in mathematical programming with [34] W.S.Dorn, Self dual quadratic
F-convexity, European Journal of programs, SIAM J.Appl.Math.9(1961)51-
Operational Reaearch,127(2000),507-518. 54.
[24] X.M.Yang, X.Q.yang and K.L.Teo, [35] M.Hanson and B.Mond, Further
nodifferentiable second order symmetric generalization of convexity in
duality in mathematical programming with mathematical programming,
F-convexity, European Journal of J.Inform.Optim.Sci.3(1982)22-35.
Operational Reaearch,144(2003),554-559. [36]B.Mond and T.Weir, Generalized
[25] Z.A. Liang, H.X.Huang and convexity and duality,In:
P.M.Pardalos, Efficiency conditions and S.Schaible,W.T.Ziemba(Eds.),
duality for a class of multiobjective Generalized convexity in optimization and
fractional programming problems, Journal Economics,263-280,Academic Press,New
of Global Optimization, 27(2003),447- York,1981.
471. [37].V.Jeyakumar, p-convexity and
[26] M.Hachimi, Sufficiency and duality second order duality,Utilitas
in differentiable multiobjective Math.29(1986),71-85.
programming involving generalized type-I [38] V.Preda,Duality for multiobjective
functions, J.Math.Anal.Appl. fractional programming problems
296(2004),382-392.

8
110
 Deo Brat Ojha, Int. J. Comp. Tech. Appl., Vol 2 (1), 103-111 ISSN : 2229-6093

involving n-set
functions,In:C.A.Cazacu,W.E.Lehto and
T.M.Rassias(Eds.)Analysis and
Topology,Academic Press(1998),569-583.
[39] M.A.Hanson, On sufficiency of Kuhn
Tucker conditions. J. Math. Anal. Appl.
30
(1981), 545-550.
[40] B.D.Craven, Invex functions and
constrained local minima. Bull. Austral.
Math. Soc.24 (1981), 357-366

9
111