REFERENCES
ANDERSON,T.W.(1958):"Introduction t o m u l t i v a r i a t e
a n a l y s i s " . John W i l e y ?< s o n s , New Y o r k .
statistical
ARSHAD,M. j K H A N j S . U . AND AHSAN,M . J . < 1 981 ) : " P r o c e d u r e -for s o l v i n g
c o n c a v e q u a d r a t i c p r o g r a m s " . Al i g a r h J o u r n a l o-f S t a t i s t i c s ,
V o l .1 , N o . 2 , 1 9 8 1 .
ARTHANARI,T.S. AND DODGE,Y.<1981): " M a t h e m a t i c a l
S t a t i s t i c s " . John W i l e y ?< S o n s , I n c .
BEALE,E.M.L.(1967): "Numerical
E d i t e d by J . A b a d i e .
Methods"
B E A L E , E . H . L . ( 1 9 5 9 ) : "On q u a d r a t i c
Vol . 6 , p p . 2 2 7 - 2 4 5 .
Programming
in Non-linear
p r o g r a m m i n g " . Naval
in
Programming.
Res.Log.Quart.
BENSON,H . P . < 1985) : "A - f i n i t e a l g o r i t h m -for c o n c a v e m i n i m i z a t i o n
o v e r a p o l y h e d r o n " . Naval R e s . L o g i s t Q u a r t . 3 2 , p p 1 6 5 - 1 7 7 .
BLACK, E. < 1 958) : " N u m e r i c a l c o n s i d e r a t i o n f o r
o-f v a r i a b l e s - f o l l o w i n g a l o g n o r m a l
Skand.Akt.pp. 158-200.
t h e s t r a t i-f i c a t i on
distribution" .
BOOT,J.C.8.(1964): "Quadratic programming". North Holland
Co . A m s t a r d a m , p p . 1 3 5 - 2 0 4 .
Publications
BF50SIUS , L . (1981) "Comments on a p a p e r by l i . C . C h e n y , Math . P r o g r a m m i n g
21 , p p , 2 2 9 - 2 3 2 .
CABOT , V . (1974) : " V a r i a t i o n s on a c u t t i n g p l a n e method -for s o l v i n g
c o n c a v e m i n i m i z a t i o n p r o b l e m w i t h l i n e a r c o n s t r a i n t s " .Naval
Res.Logist.Quart. 21,No.2.
CHENG,M.C.(1980) s "New c r i t e r i a f o r t h e s i m p l e x
P r o g r a m m i n g . Vol . 1 9 , p p . 2 3 0 - 2 3 6 .
algorithm.
Math.
COCHRAN,W.G. (1963) : " S a m p l i n g T e c h n i q u e s " . New Y o r k , J . W i l e y
1 icat ions.
Pub-
COTTLE,R.W.and W.C.MYLANDER ( 1 9 7 0 ) 5 " R i t t e r ' s c u t t i n g p l a n e method
f o r n o n - c o n v e x q u a d r a t i c p r o g r a m m i n g i n I n t e g e r and Non1 inear
p r o g r a m m i n g " . E d i t e d by J . A b a d i e N o r t h - H o l l a n d P u b l i s h i n g C o . , Amsterdam.
DALENIUS,T.(1957) : "Sampling
Wiksel 1 .
i n Sweeden" . S t o c k h o Im A l m q v i s t
DALENIUS, T . ( 1 9 5 3 ) : " T h e m u l t i v a r i a t e
A k t . Vol .36 p p . 9 2 - 1 0 2 .
and
sampling p r o b l e m " . Skand.
-
11
-
FALK, J.E. and HOFFMAN,K.L,(1976) s " A successive underestimation
method -for concave minimization problems. Math. Oper.Res.
1, pp.251-259.
FIACCO,A.V and McCORMICK,G.P.:"Nonl inear programming:Sequentia1
un constrained minimisation technique". John Wiley,
New York, 1968.
FLETCHER,R.and POWELL,M.J.D. (1964): "A rapidly convergent decent
method -for minimisation". Computer J.7, pp. 163-168.
HOFFMAN,K.L. (1976) : "A method -for globally minimizing concave
concave -functions over convex sets". Math .Programming ,20 ,pp .22-32
GLOVER, F.(1973); "convexity cuts and cut search". Oper.Res.21.
pp. 123-134.
GOLDFARB,D. (1969) : "Extension o-f Davidson's variable metric to
maximization under liner inequality and equality constraints", SIAM J. 17, pp.739-764.
BRAVES,G.W. and WHINSTON ,A .B . (1970). s "An algorithm -For the quadratic assignment problem". Management Sci.l7, pp.453-471.
HORST,R.(1976) : "An algorithm for non-concave programming problems".
Math. Programming, 10, 312-321.
HU ,T.C . (1969) s "Minimiz ing a concave -function in a convex pol ytope ,
MRC Technical Summary Report No.1011 ,Mathematics Research
Centre, University of Wisconsin.
KALANTARI,B»and ROSEN,J.B.(1987):"An algorithm for global minimization of linearly constrained concave quadratic functions".
Math.of Oper. Res. Vol.12, No.3, pp.544-561.
KHAN,S.U.(1971):"Minimising a homogeneous separable function
constrained by linear inequalities". Aligarh Bull, of
Maths . 1,pp.63-71.
KHAN, S.U. and ISLAM ,Z.(1980) :"Optimum allocation with fixed cost
in multiyariate stratified sampling". J. Ind. Soc. Stat.
Opers. Res. Vol.1, NO. 1-4, pp.1-7.
KOKAN,A.R.(1963) : "Optimum allocation in multivariate surveys",
J.R.S.S. "A" Vol.12, pp.557-565.
KOKAN, A.R. and KHAN, S.U.(1967) 5 "Optimum allocation in multivariate surveys":; An analytical solution. J.R.S.S, "B"
Vol .29, pp. 115-125.
-
111
-
KONNO,H.(1988) s "Minimum concave cost production system: A fui—
then generalization o-f multi-echelon model". Math.Prog.
Vol.41, No.2,pp.185-193.
KONNO, H.(1976): "Maximisation of a convex quadratic function
under linear constraints". Math. Programming,11,pp.117127.
KUNZI,H.P.,KRELLE,W.,and OETTLI,W.(1966) :"Nonl inear programming".
Blaisdell Publishing Co.,London.
MILLER,C.E.(1963): "Recent advances in mathematical programming".
McGraw Hill Book Co.,New York.
RAO,C.R.(1964):"The use and interpretation of principal components analysis in applied research".Sankhya,vol .26 ,series A,
PP. 329-358.
RITTER ,K,(1966) : "A method for solving maximum problems with a
non-concave quadratic function".Z.Wahrscheinlichkeitstheorie
Varw Geb. VBol.4, pp .340-351.
RITTER,K.(1965) : "Stationary points of quadratic maximum problems".
Wahrscheinlichkeitstheorie und verw.
ROSEN,J .B.(1983) : "Global minimisation of a linearly constrained
concave function by partition of feasible domain".Mathematics
of Oper. Res. Vol.8, No.2, May 1983. pp .215-230.
ROSEN,J.B.(1960): "The gradient projection method for non-linear
programming, Part I, Linear constraints, J.SIAM, Vol.8 ,
pp. 101-217.
TAHAjH.(1973): " Concave minimization over a convex polyhedron".
Naval Research Logist. Quart.20, pp.533-545.
THEIL,H. and C.VAN DE PANNE (1961): "Quadratic programming as an
extension of conventional quadratic maximization". Jour.
Inst. Mang . Sc. Vol .7,
TELGEN,J.(1981): "Criteria for simplex method". Centre for Operation Research and Econometrics (CORE) ,1348 ,Louvainla Neuve,
Belgium, Technical Report 1981.
THOAI,N.V.and TUY,H . (1980) : "Convergent algorithm for minimising
a concave function". Math. Oper.Res.No.59, pp.556-566.
TUY,H. and HORST,R.(1988):"Convergence and restart in branch and
bound algorithms for global optimization. Application to
concave minimization and d .c . optimization problems" .Math .
Prog. Vol.41, No.2, pp.161-183.
IV
TUY,H. (1964): "Concave programming under linear constraints".
Soviet Math. Dokl . 5, pp.1937-40.
WOLFE ,P. (1959) : "The simplex method -for quadratic programming".
Econometrics, Vol.27, pp.382-398.
ZOUTENDIJK, 6.(1960): "Method o-f feasible direction". Elsevier,
Amsterdam.
ZWART ,P .B. (1974) : "Global maximisation of a convex -function with
linear inequality constraints". Oper.Res.Vol .22 ,pp.602-609
ZWART ,P .B. (1973) : "Non-linear programming: counter examples o-f
global optimization algorithm by Ritter ?< Tui". Oper.Res.
Vol.21, pp.1260-1266.