Die Beschriinkung auf "nichtlineare" Programmierung ist so zu verstehen.

- 71 - BIBLIOGRAPHIE Die ~m folgenden aufgefiihrten Publikationen sind gedacht als Materialsammlung zu einer umfassenden Bestandesaufnahme der nichtlinearen Programmierung nebst ihren Grundlagen und Anwendungen. Die Ausarbeitung wird an anderer Stelle erfolgen. Einstweilen soli diese Sammlung als Arbeitsinstrument einem grosseren Kreis zur Verfiigung gestellt werden. Dies geschieht in der Hoffnung. dass sie dem Beniitzer ein einigermassen zuverhissiges Bild von der Aktivitiit auf diesem Gebiet vermittle. und dass sie dem selbst in der Forschung Tiitigen helfe. unnotige Duplikationen zu vermeiden. Bei den Arbeiten zur Theorie der nichtlinearen Programmierung wurde Vollstiindigkeit angestrebt; dagegen mag eine gewisse Unausgeglichenheit bei der Beriicksichtigung der verschiedenen Anwendungsgebiete daraus resultieren. dass die Sammlung anfiinglich nur zum privaten Gebrauch angelegt wurde. Die Beschriinkung auf "nichtlineare" Programmierung ist so zu verstehen. dass keine Arbeiten aufgenommen wurden. die lineare Programmierungsprobleme vorwiegend im Rahmen der linear en Algebra (Gauss-Jordan Elimination) abhandeln. Wohl aber wurden lineare Programme in abstrakten Riiumen beriicksichtigt. ebenso iterative Verfahren zur Losung linearer Programme (diese Verfahren lassen sich meist unschwer auf den konvexen Fall iibertragen). Auch bestimmte Anwendungen der linearen Programmierung. die in den auf die Bediirfnisse des Operations Research zugeschnittenen Darstellungen meist zu kurz kommen. wurden aufgenommen. Quadratische und gebrochen-lineare Programme wurden. allgemeinem Sprachgebrauch folgend. zur nichtlinear en Programmierung gerechnet und entsprechend beriicksichtigt. Nicht einbezogen wurden Arbeiten zur dynamischen. stochastiscl1en und ganzzahligen Programmierung. eben so blosse Rechenbeispiele.

- 72 - Unter den theoretischen Anwendungen nehmen die numerische Analysis (insbesondere Approximationstheorie), Kontrolltheorie. Wirtschaftswissenschaften und Unternehmungsforschung den grossten Raum ein. (Hierbei ist darauf hinzuweisen. dass nicht alle zitierten Arbeiten die Beziehung zur mathematischen Programmierung explizite herstellen). Bei den Grundlagen schienen besonders wichtig: die Theorie konvexer Mengen und Funktionen, sowie Verfahren zur Optimierung einer Funktion ohne Nebenbedingungen. Die Titel der Arbeiten sind entweder im Original oder in englischer Uebersetzung wiedergegeben. Die Quellenangaben folgen dem Muster der "Mathematical Reviews". Insbesondere sind die verwendeten AbkUrzungen der Zeitschriften bis auf geringfugige Aenderungen den "Abbreviations of Names of Journals" am Schluss der Bande 34 (1967) bis ~ (1969) von "Mathematical Reviews" entnommen oder dem dort benutzten System nachgebildet. FUr die Transkription kyrillischer Eigennamen wurde gegenuber "Mathematical Reviews" eine mehr phonetische Schreibweise gewahlt, die Akzente UberflUssig macht. Die in Abschnitt B aufgefuhrten Sammelwerke werden in Abschnitt C nur durch Herausgabe und Erscheinungsjahr gekennzeichnet. z. B. [Abadie, 1967J Publikationen in Manuskriptform (sogenannte Reports) wurden nur vereinzelt aufgenommen, und nur in solchen Fallen, wo eine Veroffentlichung in anderer Form nicht nachzuweisen war. Hinweise auf etwaige Fehler sowie Erganzungsvorschlage werden an die folgende Anschrift erbeten: W. Oettli, IBM Forschungslaboratorium ZUrich, 8803 RUschlikon, Schweiz.

- 73 - BIBLIOGRAPHY The references collected hereafter are intended to contain the rawmaterial of a comprehensive inventory of non-linear programming, including its foundations and applications. The decision to publish them in the present (and preliminary) form was made in the hope, that this will help the interested in keeping up with the activity going on in this field. Whereas the list of papers concerned with the very theory of non-linear programming should be reasonable complete, a certain "bias" regarding the selected applications may eventually be due to the subjective motivation which stood at the origin of this collection. The restriction to "non-linear" programming essentially is to mean, that papers handling linear programming problems within the framework of linear programming problems in abstract spaces were included, as well as iterative procedures for solving linear programs. Also included were quadratic and fractionally -linear programming. Dynamic, stochastic and integer programming are missing. Among the theoretical applications numerical analysis (especially approximation theory), control theory, economics and operations research playa dominant role. (At this point the reader should be warned that in the case of many of the quoted references he has to establish himself the connections with mathematical programming. ) Among the foundations convex functions and methods for unconstrained optimization take the largest part. The quotations follow the style of "Mathematical Reviews". Abbreviations of names of journals are the same as those given at the end of volumes 34 (1967) through ~ (1969) of "Mathematical Reviews". The transliteration of cyrillic names however ist slightly different from the system adopted by "Mathematical Reviews".

- 74 - The collective volumes listed in section B are identified in section C only by name of editor and year of publication. e. g. [Abadie. 1967J. Any critical comments concerning errors or omissions are welcomed at the following address: W. Oettli. IBM Zurich Research Laboratory. 8803 Ruschlikon. Switzerland.

- 75 - SCHRIFTTUM ZUR NICHTLINEAREN PROGRAMMIERUNG NEBST VERW ANDTEN GEBIETEN REFERENCES IN NON-LINEAR PROGRAMMING AND RELATED AREAS A. Lehrbiicher und Monographien I Textbooks and monographs E. M. L. BEALE R. BELLMAN R. BELLMAN, S. DREYFUS C. BERGE C. BERGE C. BERGE, A. GHOUILA-HOURI T. BONNE SEN, W. FENCHEL J. C. G. BOOT R. BOUDAREL, J. DELMAS, p.. GUICHET Mathematic'al Programming in Practice. Pitman, London, 1968. Dynamic Programming. Princeton University Press, Princeton, 1957. Applied Dynamic Programming. Princeton University Press, Princeton, 1962. Espaces topologiques, fonctions multivoques. Dunod. Paris, 1959. Topological Spaces (Translated from the French). Oliver and Boyd, Edinburgh, 1963. Programmes, jeux et reseaux de transport. Dunod, Paris, 1962. Theorie der konvexen Kerper. Springer, Berlin, 1934. Chelsea, New York, 1948. Quadratic Programming. North-Holland, Amsterdam, 1964. Commande optimale des processus. Tome 2: Programmation non lineaire et ses applications. Dunod, Paris, 1968.

- 76 - M. J. BOX~ D. DAVIES~ W. H. SWANN J. BRACKEN~ G. P. McCORMICK E. BURGER M. CANON~ C. CULLUM~ E. POLAK A. CHARNES~ W.W. COOPER E. W. CHENEY L. COLLATZ~ W. WETTERLING J. M. DANSKIN G. B. DANTZIG J. B. DENNIS M. DRESHER R. J. DUFFIN~ E. L. PETERSON~ C. ZENER H. G. EGGLESTON Nonlinear Optimization Techniques. Oliver and Boyd. London. (to appear). Selected Applications of Nonlinear Programming. Wiley. New York~ 1968. Einftihrung in die Theorie der Spiele. Walter de Gruyter~ Berlin. 1959. Discrete Optimal Control. McGraw-Hill~ New York (to appear). Management Models and Industrial Applications of Linear Programming; 2 Vols. Wiley~ New York~ 1961. Introduction to Approximation Theory. McGraw-Hill.. New York.. 1966. Optimierungsaufgaben. Springer.. Berlin.. 1966. The Theory of Max-Min. Spring er.. Berlin.. 1967. Linear Programming and Extensions. Princeton University Press. Princeton~ 1963. Mathematical Programming and Electrical Networks. Wiley. New York. 1959. Games of Strategy: Theory and Applications. Prentice-Hall. Englewood Cliffs.. N. J 1961. Geometric Programming-Theory and Application. Wiley.. New York.. 1967. Convexity. Cambridge University Press. Cambridge. 1963.

- 77 - W. FENCHEL A. V. FIACCO~ G. P. McCORMICK L. R. FORD~ D. R. FULKERSON Convex Cones, Sets, and Functions (Lecture Notes). Department of Mathematics.. Princeton University~ 1953. Nonlinear Programming: Sequential Unconstrained Minimization Techniques. Wiley~ New York, 1968. Flows in Networks. Princeton University Press.. Princeton~ 1962. R. FRISCH Theorie et appli Maxima et minima - cations economiques. Dunod.. Paris.. 1960. D. GALE A. A. GOLDSTEIN G. HADLEY H. HANCOCK H. KAPPLER S. KARLIN S. KARLIN~ L. S. SHAPLEY M. A. KRASNOSELSKII~ Ya. B. RUTICKII The Theory of Linear Economic Models. McGraw-Hill, New York.. 1960. Constructive Real Analysis. Harper & Row.. New York, 1967. Nonlinear and Dynamic Programming. Addison-Wesley. Reading.. Mass... 1964. Theory of Maxima and Minima. Dover, New York.. 1960. Gradientenverfahren der nichtlinearen Programmierung (G6ttinger Wirtschafts- und Sozialwissenschaftliche Studien.. Band 5). Verlag Otto Schwarz. G6ttingen. 1967. Mathematical Methods and Theory in Games.. Programming.. and Economics; 2 Vols. Addison- Wesley. Cambridge~ Mass. ~ 1959. Geometry of Moment Spaces. Memoirs Amer. Math. Soc... no. 12; American Mathematical Society.. Providence, R. I.. 1953. Convex Functions and Orlicz Spaces. Noordhoff.. Groningen~ 1961.

- 78 - H. P. KONZI~ W. KRELLE H. P. KONZI~ H. G. TZSCHACH~ C. A. ZEHNDER O. L. MANGASARIAN J. C. C. M~KINSEY Nichtlineare Programmierung. Springer.. Berlin.. 1962. Numerische Methoden der mathematischen Optimierung. B. G. Teubner.. Stuttgart.. 1967. Nonlinear Programming. McGraw-Hill.. New York (to appear). Introduction to the Theory of. Games. McGraw-Hill.. New York.. i952. J.~. RICE The Approximation of Functions.. Vol. 1. Addison-Wesley. Reading. Mass... 1964. V. RILEY.. S. I. GASS R. T. ROCKAFELLAR R. T. ROCKAFELLAR T. L. SAATY.. J. BRAM S. VAJDA F. A. VALENTINE D.J. WILDE D.J. WILDE.. C. S. BEIGHTLER G. ZOUTENDIJK Linear Programming and Associated Technique s. The John Hopkins Press.. Baltimore. 1958. Monotone Processes of Convex and Concave Type. Memoirs Amer. Math. Soc no. 77; American Mathematical Society~ Providence. R.I 1967. Convex Analysis. Princeton University Press.. Princeton (to appear). Nonlinear Mathematics. McGraw-Hill.. New York.. 1964. Mathematical Programming. Addison-Wesley.. Reading. Mass... 1961. Convex Sets. McGraw-Hill.. New York.. 1964. Optimum Seeking Methods. Prentice-Hall.. Englewood Cliffs.. N. J... 1964. Foundations of Optimization. Prentice-Hall.. Englewood Cliffs.. N. J., 1964. Methods of Feasible Directions. Elsevier. Amsterdam.. 1960.

- 79 - S. I. ZUKHOVITSK1J~ L. I. A VDEEV A S. I. ZUKHOVITSKIY. L. L AVDEYEVA Lineinoe i vypukloe programmirovanie. Izdatelstvo Nauka.. Moskva. 1964. Linear and Convex Programming (translated from the Russian). Saunders.. Philadelphia.. 1966. B. Sammelbande I Collective Volumes J. ABADIE (ed.) K.J. ARROW. L. HURWICZ. H. UZAWA (eds.) A. V. BALAKRISHNAN. L. W. NEUSTADT (eds.) R. BELLMAN (ed.) P. BROISE. P. HUARD. J. SENTENAC G. B, DANTZIG. A. F. VEINOTT (eds.) R. FORTET. J. ABADIE.. J. BERNADAT.. M. COUR TILLOT.. J. -M. GAUTHIER.. F. GENUYS.. P. HUARD.. G. MATTHYS R. L. GRAVES.. Ph. WOLFE (eds.) Nonlinear Programming. North-Holland.. Amsterdam.. 1967. Studies in Linear and Non-linear Programming. Stanford University Press.. Stanford.. 1958. Mathematical Theory of Control. Academic Press. New York.. 1967. Mathematical Optimization T,=chniques. UniVersity of California Press" Berkeley" 1963. Decomposition des programmes mathematiques (Monographies de recherche operationnelle.. 6). Dunod. Paris. 1968. Mathematics of the Decision Sciences. Part 1.. 2. Lectures in Applied Mathematics.. Vol. 11.. 12. American Mathematical Society.. Providence.. R. 1.. 1968. Mathematique des programmes economiques (Monographies de recherche operationnelle.. 1). Dunod. Paris, 1964. Recent Advances in Mathematical Programming. McGraw-Hill.. New York.. 1963.

- 80 - D. C. HANDSCOMB (ed.) L. V. KANTOROVICH (ed.) T. C. KOOPMANS (ed.) H. W. KUHN (ed.) H. W. KUHN~ A. W. TUCKER (eds.) A. LAVI~ T. P. VOGL (eds.) A. PREKQPA (ed.) Ph. WOLFE (ed.) Methods of Numerical Approximation. Pergamon Press. Oxford. 1966. Matematicheskoe programmirovanie. Izdatelstvo Nauka~ Moskva~ 1966. Activity Analysis of Production and Allocation. Wiley~ New York. 1951. Proceedings of the Sixth International Symposium on Mathematical Programming. Princeton~ 1967. (to appear). Linear Inequalities and Related Systems. Annals of Mathematics Studies.. no. 38; Princeton University Press~ Princeton~ 1956. Recent Advances in Optimization Techniques. Wiley. New York~ 1966. Colloquium on Applications of Mathematics to Economics.. Budapest. 1963. Akademiai Kiad6. Budapest. 1965. The RAND Symposium on Mathematical Programming (Abstracts). RAND-Report R-351. The RAND Corporation. Santa Monica. Calif.. 1960.

- 81 - C. Aufsatze / Articles ABADIE (J.): Elements de programmation mathematique. Note HR 5756. Electricite de France~ Direction des Etudes et Recherches~ 1964. --- : Probl~mes d'optimisation~ I. II. Laboratoire de Calcul numerique.. Institut Blaise Pascal~ 1965. Paris~ --- : Programmation mathematique. Actes du 5~me Congr~s AFIRO (Lille 1966)~ pp. 44-67. Association Fran<;<aise d'informatique et de Recherche Operationelle~ Paris.. 1966. --- : On the Kuhn-Tucker theorem. [l\.badie~ 1967J, pp. 19-36. --- ~ CARPENTIER (J.): Generalisation de la methode du gradient reduit de Wolfe au cas de contraintes non line aires. Note HR 7.262/0. Electricite de France~ Direction des Etudes et Recherches~ 1966.. --- ~ HENSGEN (C.): La methode du gradient reduit generalise. Rapport CAE/RT/2057. Compagnie Europeenne d'automatisme Electronique.. Paris~ 1967. --- ~ HUARD (P.) et al.: La programmation quadr ati que. Actes du 1er Congr~s AFCAL (Grenoble 1960).. pp. 407-423. Gauthier- Villars~ Paris~ 1961. ABLOW (C. M.).. BRIGHAM (G.): An analog solution of programming problems. Operations Res. l (1955).. 388-394. ABRHAM (J.): An approximate method for nonlinear programming (Czech). Casopis Pest. Mat. ~ (1958).. 425-439. --- : An approximate method for convex programming. Econometrica ~ (1961)~ 700-703. --- : The multiplex method and its application to concave programming. Czechoslovak Math. J. 12 (1962). 325-345.

- 82 - --- : An approximate method for solving a continuous-time allocation problem. CORE Discussion Paper no. 6820. Center for Operations Research and Econometrics, Universite Catholique de Louvain~ 1968. AGGARWAL (S. P.): A simplex technique for a particular convex programming problem. J. Canad. Operational Res. Soc. (CORS J.)! (1966)~ 82-88. ---. Stability of the solution to a linear fractional functional programming problem. Z. angew. Math. Mech. 46 (1966)~ 343-349. --- : A note on quasiconvex programming. Metrika ~ (1968), 97-105. --- : Standard error fractional functional programming. Istanbul Univ. Fen Fak. Mec. Sere A ~ (1965),45-51 (issued 1968). ---.; SW ARUP (K.): Fractional functionals programming with a quadratic constraint. Operations Res. 14 (1966), 950-956. AGGERI (J. -C. l: Les fonctions convexes continues et Ie theor~me Krein-Milman. C. R. Acad. Sci. Paris sere A. 262 (1966), 229-232. de --- ~ LESCARRET (C.): Fonctions convexes duales associees ~ un couple d' ensembles mutuellement polaires. C. R. Acad. Sci. Paris 260 (1965), 6011-6014. AGMON (8): The relaxation method for linear inequalities. Canad. J. Math. ~ (1954), 382-392. AKAIKE (ll): On a successive transformation of probability distribution and its application to the analysis of the optimum gradient method. Ann. Inst. Statist. Math.!!. (1959)~ 1-16. AKILOV (G. P.)~ KANTOROVICH (L. V.)~ RUBINSHTEIN (G. Sh.): Extremal states and extremal controls (Russian). Vestnik Leningrad. Univ. 22 (1967)~ no. 7, 30-37. SIAM J. Control ~ (1967):-600-608 (English transl.). -- ~ RUBINOV (A. M.): The method of successive approximations for determining the polynomial of best approximation (Russian). Dokl.Akad. Nauk SSSR 157 (1964), 503-505. Soviet Math. Dokl. ~ (1964), 951-953 (English transl.).

- 83 - AKKEL (T.): A standard program for solution of a general nonlinear programming problem (Russian). Trudy VyCisl. Centra Tartu. Gos. Univ. 1962.. no. 2~ 56-64. ALTMAN (M.): Stationary points in non-linear programming. Bull. Acad. Pol on. Sci. sere Sci. Math. Astronom. Phys. 12 (1964). 29-35. --- : A feasible direction method for solving the nonlinear programming problem. Bull. Acad. Pol on. Sci. sere Sci. Math. Astronom. Phys. g (1964)~ 43-50. --- : A generalized gradient method of minimizing a functional on a Banach space. Mathematica (Cluj) ~ (1966)~ 15-18. --- : Generalized gradient methods of mlffimlzmg a functional. Bull. Acad. Polon. Sci. sere Sci. Math. Astronom. Phys. 14 (1966)~ 313-318. --- : A generalized gradient method for the conditional minimum of a functional. Bull. Acad. Polon. Sci. sere Sci. Math. Astronom. Phys. 14 (1966)~ 445-451. --- : A generalized gradient method with self-fixing step size for the conditional minimum of a functional. Bull. Acad. Polon. Sci. sere Sci. Math. Astronom. Phys. i5 (1967)~ 19-24. --- : A generalized gradient method for the conditional extremum of a function. Bull. Acad. Polon. Sci. sere Sci. Math. Astronom. Phys. 15 (1967). 177-183. --- : Bilinear Programming Bull. Acad. Polon. Sci. sere Sci. Math. Astronom. Phys. 16 (1968)~ 741-746. ANDREEV (N. I.): A method of solution of certain problems in nonlinear programming (Russian). Izv. Akad. Nauk SSSR Tekhn. Kibernet. 1963.. no. 1.. 26-33. --- : Non-linear programming in the investigation of optimal automatic control systems. In: Proceedings of the International Federation of Automatic Control Congress (Basle 1963). Butterworth~ London~ 1964.

- 84 - de ANGELIS (V.): Ricerca del mlffimo valoree di una funzione convessa separabile sottoposta a vincoli lineari. Giorn. 1st.!tal. Attuari 28 (1965).. 92-133. ARCANGELI (R.): Pseudo-solution de l'equation Ax = Y C. R. Acad. Sci. Paris.. sere A 263 (1966).. 282-285. ARIMOTO (S.): On a multistage nonli near programming problem. J. Math. Anal. Appl.!2. (1967).. 161-171. ARKIN (V.!.): On the infinite-dimensional analogue of a nonconvex programming problem (Russian). Kibernetika (Kiev) 1967.. no. 2. 87-93. ARMIJO (L.): Minimization of functions having Lipschitz continuous. first partial derivatives. Pacific J. Math. ~ (1966).. 1-3. ARROW( K. J.): Applications of control theory to economic growth. [Dantzig & Veinott.. 1968].. Part 2. pp.85-119. ---.. DEBREU (G.): Existence of an equilibrium for a competitive economy. Econometrica ~ (1954).. 265-290. ---.. ENTHOVEN (A. C.): Quasi-concave programming. Econometrica 29 (1961).. 779-800. ---.. HURWICZ (L.): Reduction of constrained maxima to saddlepoint problems. Proceedings of the 3rd Berkeley Symposium on Mathematical Statistics and Probability.. Vol. 5. pp. 1-20. University of California Press.. Berkeley.. 1956. ---.. --- : Gradient methods for constrained maxima. Operations Res. ~ (1957).. 258w265... : Gradient method for concave programming.. I: Local results. [Arrow. Hurwicz & Uzawa.. 19581 pp.117-126... : Gradient methods for concave programming.. III: Further global results and applications to resource allocation. [Arrow.. Hurwicz & Uzawa.. 1958].. pp.133-145... : Stability of the gradient process in n-person games. SIAM J. Appl. Math. ~ (1960). 280-294.

- 85 - ~ ~ UZAWA (H.): Constraint qualifications in maximization problems. Naval Res. Logist. Quart.!!. (1961)~ 175-191. ---~ SOLOW (R. M.): Gradient methods for constrained maxima~ with weakend assumptions. [Arrow~ Hurwicz & Uzawa~ 19581.. pp. 166-176. ATTEIA (M.): Generalisation de la definition et des proprietes des «spline-functions». C. R. Acad. Sci. Paris 260 (1965).. 3550-3553. -- : Fonctions «spline» definies sur un ensemble convexe. Numer. Math. ~ (1968)~ 192-210. AUMANN (R. J.)~ PERLES (M.): A variational problem arising in economics. J. Math. Anal. Appl.!,.!.(1965).. 488-503. AUSLENDER (A.): Algorithme de recherche des points stationnaires d'une fonctionnelle dans un espace vectoriel topologique. Application a un probleme de controle a evolution non lineaire. C. R. Acad. Sci. Paris ser. A. 266 (1968).. 226-229. -- : Methodes et tmoremes de dualite. C. R. Acad. Sci. Paris Ser. A 267 (1968).. 114-117. -- : Methodes generales pour la recherche des cols d'une fonction. C. R. Acad. Sci. Paris Ser. A 268 (1969).. 282-285. --.. BRODEAU (F.): Convergence d'un algorithme de Frank et Wolfe applique a un probleme de c ontr Ole. Rev. Fran<;:aise Inform at. Recherche Operationnelle ~ (1968).. no. 7.. 3-12. BAKHTIN (I. A.): On an extremum problem (Russian). Z. VyCisl. Mat. i Mat. Fiz.4 (1964).. 120-135. USSR Comput. Math. and Math. Phys. 4 (1964).. no.1.. 160-181 (English transl.). - --.. GORSTKO (A. B. ): On the solution of nonlinear extremum problems with linear constraints of specific type (Russian). [Kantorovich.. 1966].. pp.40-45. --.. KRASNO S ELSKIJ (M. A.)~ LEVIN (A. Ju. ): Finding the extremum of a function on a polyhedron (Russian). Z. Vycisl. Mat. i Mat. Fiz. 3 (l963)~ 400-409. USSR Comput. Math. and Math. Phys. 3 (1963).. 533-546 (English transl.). -

- 86 - BALAS (E.): Duality in discrete programming: IlL Nonlinear objective function and constraints. Management Sciences Research Report No. 121. Graduate School of Industrial Administration~ Carnegie-Mellon University~ Pittsburgh~ 1968. --- : Minimax et dualite en programmation discrme. Th~se Doct. ~ Universite de Paris~ 1968. BARANKIN (E. W.).. DORFMAN (R.): On quadratic programming. University of California Publications in Statistics~ Vol. 2.. pp. 285-317. University of California Pres.. Berkeley~ 1958. BARANOV (A. Ju. L KHOMENJUK (V. V.): Solution of the linear problem of minimization of a quadratic functional in Hilbert space (Russian). Avtomat. i Telemekh. 26 (1965L 615-620. Automat. Remote Control ~ (1965)~ 616-622 (English transl.). BARR (R. 0.): Computation of optimal controls by quadratic programming on convex reachable sets. Dissertation~ University of Michigan~ 1966. --- : Computation of optimal controls on convex reachable sets. [Balakrishnan & Neustadt~ 1967] ~ pp.63-70. BARRA (J. R.)~ BENZAKEN (C. L BRODEAU (F.): Probl~mes numeriques en programmation dynamique deterministe. Rev. Fran<;aise Recherche Operationnelle ~ (1965). no. 34~ 47-58. BAUMOL (W. J.)~ BUSHNELL (R. C.): Error produced by linearization in mathematical programming. Econometrica ~ (1967)~ 447-471. BEALE (E. M. L.): On minimizing a convex function subject to linear inequalitie s. J. Roy. Statist. Soc. Ser. B..!2 (1955)~ 173-184. --- : An algorithm for solving the transportation problem when the shipping cost over each route is convex. Naval Res. Logist. Quart. ~ (1959).. 43-56. --- : On quadratic programming. Naval Res. Logist. Quart. ~ (1959)~ 227-244. --- : Note on "A comparison of two methods of quadratic programming". Operations Res. 14 (1966)~ 442-"443. : Numerical methods. [Abadie. 1967J ~ pp.133-205.

- 87 - BECKENBACH (E. F.): Convex functions. Bull. Amer. Math. Soc. 54 (1948). 439-460. BECTOR (C. R.): Nonlinear indefinite functional programming with nonlinear constraints. Cahiers Centre Etudes Recherche Oper. ~ (1967)~ 172-179. --- : Nonlinear fractional functional programming with nonlinear constraints. Z. angew. Math. Mech. 48 (1968)~ 284-286. --- : Duality in fractional and indefinite programming. Z. angew. Math. Mech. 48 (1968)~ 418-420. --- : Programming problems with convex fractional functions. Operations Res..!! (1968L 383-391. --- : Indefinite cubic programming with standard errors in objective function. Unternehmensforschung g (1968)~ 113-120. BEIGHTLER (C. S.)~ CRISP (R. M.)~ MEIER (W. L.): Optimization by geometric programming. J. Indust. Engrg. ~ (1968)~ 117-120,.. WILDE (D. J.): Diagonalization of quadratic forms by Gauss elimination. Management Sci. g (1966)~ 371-379; erratum~ ibid. g(1966)~ 908. BEJ AR ALAMO (J.): Mathematical theory of programming (Spanish). Mem. Real Acad. Ci. Exact. F!s~ Natur. Madrid ~~ no.2 (1967). BELENKIJ (V. Z.): Problems of mathematical programming having a minimum point (Russian). Dokl. Akad. Nauk SSSR 183 (l968)~ 15-17. Soviet Math. Dokl. ~ (196 8)~ 1301-1303 (English transl.). BELLMAN (R. E.): Dynamic programming and Lagrange multipliers. Proc. Nat. Acad. Sci. USA 42 (1956)~ 767-769. --- -: Dynamic programming and the numerical solution of variational problems. Operations Res. ~ (l957)~ 277-288. --- ~ KAGIW ADA (H. H.). KALABA (R. E.): Quasilinearization~ boundary-value problems and linear programming. IEEE Trans. Automatic Control AC-10 (1965)~ 199.

- 88 - ~ KARUSH (W.): On a new functional transform in analysis: The maximum transform Bull. Amer. Math. Soc. 22 (1961).. 501-503... : Mathematical programming and the maximum transform. SIAM J. Appl. Math. 1:.2. (l962)~ 550-566. ~ : On the maximum transform. J. Math. Anal. Appl. ~ (l963)~ 67-74. BELTRAMI (E. J.): A computational approach to necessary conditions in mathematical programming. ICC Bull. ~ (1967).. 265-273. ---. On infinite - dimensional convex programs. J. Comput. System Sci. 1:. (1967).. 323-329. ---. A constructive proof of the Kuhn-Tucker multiplier rule. J. Math. Anal. Appl. ~ (1969).. 297-306. BENDERS (J. F.): Partitioning in mathematical programming. Proefschrift~ Rijksuniversiteit te Utrecht~ 1960. --- : Partitioning procedures for solving mixed-variables programming problems. Numer. Math.! (1962).. 238-252. --- : Some aspects of mathematical optimization (Dutch). Euclides (Groningen) 43 (1968).. 241-253. BEN-ISRAEL (A.): A Newton-Raphson method for the solution of systems of equations. J. Math. Anal. Appl. ~ (l966)~ 243-252. --- : On iterative methods for solving nonlinear least squares problems over convex sets. Israel J. Math. ~ (1967), 211-224. -- : CHARNES (A.).. KORTANEK (K. 0.): Duality and asymptotic solvability over cones. Bull. Amer. Math. Soc. ~ (1969).. 318-324. BENSOUSSAN (A.).. KENNETH (P.): Sur l'analogie entre les methodes de regularisation et de penalisation. Rev. Fran<;,:aise Inform at. Recherche Operationnelle ~(1968)~ no. 13~ 13-25.

- 89 - BEREANU (B.): A property of convex functions with applications to nonlinear programming (Romanian). Com. Acad. R. P. Romtne..!! (1963).. 783-788. --- : A property of convex.. piecewise linear functions with applications to mathematical programming. Unternehmensforschung ~ (1965).. 112-119. BERGE (C.): Sur l'equivalence du probl~me de transport generalise et du probl~me des reseaux. C. R. Acad. Sci. Paris 251 (1960).. 324-326. BERKOVITZ (L. D.): Variational methods in problems of control and programming. J. Math. Anal. Appl.! (1961).. 145-169. BERMAN (G.): Minimization by successive approximation. SIAM J. Numer. Anal.! (1966).. 123-133. BERNADAT (J.): Programmes quadratiques. [Fortet et al... 1964].. pp. 127-135. BERNHOLTZ (B.): A new derivation of the Kuhn-Tucker conditions. Operations Res. g (1964).. 295-299., BESSIERE (F.).. SAUTTER (E. A.): Optimization and suboptimization: The method of extended models in the nonlinear case. Management Sci. ~ (1968).. 1-11. BIGG (M. D.): The minimization of a general function subject to a set of non-linear constraints. Proc. Cambridge Philos. Soc. ~ (1963).. 523-530. BIRKHOFF (G.): A variational principle for nonlinear networks. Quart. Appl. Math. 3..!. (1963).. 160-162. ---.. DIAZ (J. B.): Nonlinear network problems. Quart. Appl. Math..!! (1956)., 431-443. BffiZAK (B.).. PSHENICHNYJ (B. N.): Minimization problems for nonsmooth functions (Russian). Kibernetika (Kiev) 1966.. no. 6.. 53-57. BITTNER (L.): Das Austauschverfahren der linearen Tschebyscheff Approximation bei nicht erfilllter Haarscher Bedingung. Z. angew. Math. Mech..!!. (1961).. 238-256. --- : Ausgleichsaufgaben der Gestalt f [max l.(x).. min 1. (x») =Min! L 1. 1 1 1 Wiss. Z. Techn. Univ. Dresden.!.Q (1961).. 1297-1305.

- 90 - --- : Eine Verallgemeinerung des Verfahrens des logarithmischen Potentials von Frisch fur nichtlineare Optimierungsprobleme. [Prekopa~ 1965]~ pp.43-53. --- : Begrtindung des sogenannten diskreten Maximumprinzips. Z. Wahrscheinlichkeitstheorie verw. Gebiete.!.Q (1968).. 289-304. --- : Abschatzungen bei Variationsmethoden mit Hilfe von Dualitatssatzen. I. Numer. Math.!!. (1968).. 129-143. BOHNENBLUST (H. F.).. KARLIN (S.).. SHAPLEY (L. S.): Games with continuous.. convex pay- off. Contributions to the Theory of Games.. Vol. 1 (H. W. Kuhn & A. W. Tucker eds.).. pp. 181-192. Annals of Mathematics Studies~ no. 24; Princeton University Press~ Princeton~ 1950. BONSALL (F. F.): Dual extremum problems in the theory of functions. J. London Math. Soc. ~ (1956)~ 105-110. de BOOR (C.).. LYNCH (R. E.): On splines and their minimum properties. J. Math. Mech. ~ (1966). 953-969. BOOT (J. C. G.): Notes on quadratic programming: The Kuhn-Tucker and Theil- van de Panne conditions.. degeneracy and equality constraints. Management Sci. ~ (1961).. 85-98. --- : On trivial and binding constraints in programming problems. Management Sci. ~ (1962).. 419-441. --- : Binding constraint procedures of quadratic programming. Econometrica ~ (1963L 464-498. --- : On sensitivity analysis in convex quadratic programming problems Operations Res.!!. (1963).. 771-786. BOX (M. J.): A new method of constrained optimization and a comparison with other methods. Computer J. ~ (1965)~ 42-52. --- : A comparison of several current optimization methods.. and the use of transformations in constrained problems. Computer J. ~ (1966).. 67-77. BRAESS (D.): Ueber Dampfung bei Minim ali sierungsverfahren. Computing (Arch. elektron. Rechnen) 1:. (1966).. 264-272. BRAM (J.): The Lagrange multiplier theorem for max-min with several constraints. SIAM J. Appl. Math.!± (1966).. 665-667.

- 91 - BRANS (J. P.)~ DROESBEKE (F.): Programmes quadratiques. Cahiers Centre Etudes Recherche Oper.2. (1965)" 81-108. BRATTON (D.): The duality theorem in linear programming. Cowles Commission Discussion Paper Mathematics No. 427. Cowles Commission for Re~earch in Economics6 Yale University" 1955. BREGMAN (L. M.): The method of successive projections for finding a common point of convex sets (Russian). Dokl: Akad. Nauk SSSR 162.(1965), 487-490. Soviet Math. Dokl. ~ (1965), 688-69"2 (English transl.). -- : Relaxation method for finding a common point of convex sets" and its application to optimization problems (Russian). Dokl. Akad. Nauk SSSR 171 (1966)" 1019-1022. Soviet Math. Dokl. 2. (1966)~ 1578-1581 (English trans!.). -- : A relaxation method of finding a common point of convex sets" and its application to the solution of problems in convex programming (Russian). Z. VyCisl. Mat. i Mat. Fiz. 2. (1967)" 620-631. BRIOSCHI (F.), LOCATELLI (A. F.): Extremization of constrained multi variable function: Structural programming. IEEE Trans. Systems Sci. Cybernetics SSC-3 (1967)~ 105.:-111. BRPNDSTED (A.): Conjugate convex functions in topological vector spaces. Mat. -Fys. Medd. Danske Vid. Selsk. 346 no. 2(1964). -- ~ ROCKAFELLAR (R. T.): On the subdifferentiability of convex functions. Proc. Amer. Math. Soc. ~ (1965). 605-611. BROOKS (S. H.): A comparison of maximum seeking methods. Operations Res. 2. (1959), 430-457. BROOKS (R.). GEOFFRION (A.): Finding Everett's Lagrange multipliers by linear programming. Operations Res. ~ (1966), 1149-1152. BROSOWSKI (B.): Ueber Tschebyscheffsche Approximationen mit linearen Neb enb edingung en. Math. Z. 88 (1965)" 105-128. --: Vber Tschebyscheffsche Approximation mit verallgemeinerten rationalen Funktionen. Math. z. 90 (1965)" 140-151.

- 92 - BROWN ( G. W.): Iterative solution of games by fictitious play. [Koopmans. 1961]. pp. 374-376. ---; von NEUMANN (J.): Solutions of games by differential equations. Contributions to the Theory of Games. Vol. 1 (H. W. Kuhn & A. W. Tucker eds.). pp.73-79. Armals of Mathematics Studies. no. 24; Princeton University Press. Princeton. 1950. Also in: John von Neumann. Collected Works. Vol. 6. pp. 38-43. Pergamon Press. Oxford. 1963. BROYDEN (C. G.): A class of methods for solving nonlinear simultaneous equations. Math. Compo ~ (1965). 577-593. --- : Quasi-Newton methods and their application to function minimization. Math. Compo ~ (1967). 368-381. --- : A new method of solving nonlinear simultaneous equations. Computer J. g (1969). 94-99. BRYSON (A. E.). DENHAM (W. F.): A steepest ascent method for solving optimum programming problems. Trans. ASME Ser. E. J. Appl. Mech. ~ (1962). 247-257. ---. ---. DREYFUS ( S. E.): Optimal programming problems with inequality constraints. 1. AIAA J..!. (1963). 2544-2550. BUEHLER (R. J.). SHAH (B. V.). KEMPTHORNE (0.): Methods of parallel tangents. Optimization Techniques (J. W. Blakemore & S. H. Davis eds.). PP. 1-7. Chemical Engineering Progress Symposium Series. no. 50; American Institute of Chemical Engineers. New York.1964....,,- BUr - TR9NG - LIEU: On a problem of convexity and its application to non-linear stochastic programming. J. Math. Anal. Appl..!!. (1964). 177-187. --- : A study of some inequalities for nonlinear stochastic programming. [Abadie. 1967J. pp.249-258. ---. CARTON (D.): Quelques remarques concernant les fonctions quasiconvexes. Publ. Math. Debrecen.!.!. (1964). 63-68. ---. HUARD (P.): La methode des centres dans un espace topologique. Numer. Math.!!. (1966). 56-67.

- 93 - BULAVSKLJ (V. A.)~ RUBINSHTEIN (G. Sh.): Solution of convex programming problems with linear constraints by the method of successive improvement 'of an admissible vector (Russian). Dokl. Akad. Nauk SSSR 150 (l963)~ 231-234. Soviet Math. Dokl.! (l963)~ 619-622 (English transl.). BURGER (E.): On extrema with side conditions. Econometrica ~ (l955)~ 451-452. BUTLER (T.): Lagrange multipliers and the goemetry of Hilbert space. SIAM J. Appl. Math. g (l964)~ 781-793. -- ~ MARTIN (A. V.): On a method of Courant for minimizing functionals. J. Math. and Phys.!!. (1962)~ 291-299. BUTZ (A. P.): Iterative saddle point techniques. SIAM J. Appl. Math. ~ (1967)~ 719-725. CAMION (P.): Application d'une generalisation du lemme de Minty ~ un probleme d'injimum de fonction convexe. Cahiers Centre Etudes Recherche Oper. 7 (1965)~ 230-247; erratum~ ibid. ~ (1966)~ 192-193. - CAMP (G. D.): Inequality-constrained stationary value problems. Operations Res. ~ (l955)~ 548-550. CANDLER (W.)~ TOWNSLEY (R. J.): The maximization of a quadratic function of variables subject to linear inequalities. Management Sci.!.Q (1964)~ 515-523. CANNON (R. J.): The numerical solution of the Dirichlet problem for Laplace's equation by linear programming. SIAM J. Appl. Math. g (1964)~ 233-237. -- ~ CECCHI (M. M.): The numerical solution of some biharmonic problems by mathematical programming techniques. SIAM J. Numer. Anal. ~ (l966)~ 451-466. -- ~ --- : Numerical experiments on the solution of some biharmonic problems by mathematical programming techniques. SIAM J. Numer. Anal.! (1967)~ 147-154. CANON (M. D.): A new algorithm for bounded variable quadratic programming problems. Dissertation~ University of California~ Berkeley~ 1966. -- : Mathematical programming and discrete optimal control. IBM Research Report RC 2025. IBM Research Center~ Yorktown Heights N. Y. ~ 1968.

- 94 - --- : Monoextremal representations of a class of minimax problems. Management Sci. ~ (1969)~ 228-238. --- ~ CULLUM (C. D. ),: A tight upper bound on the rate of convergence of the Frank-Wolfe algorithm. SIAM J. Control ~ (1968)~ 509-516. --- ~ --- : The determination of optimum separating hyperplanes. L A finite step procedure. IBM Research Report RC 2023. IBM Research Center~ Yorktown Heights~ N. Y. ~ 1968. --- ~ --- ~ POLAK (E.): Constrained minimization problems in finite-dimensional spaces. SIAM J. Control! (1966)~ 528-547. --- ~ EATON (J. H.): A new algorithm for a class of quadratic programming problems~ with application to control. SIAM J. Control! (1966)~ 34-44. CARPENTIER (J.)~ ABADIE (J.): Gemeralisation de la methode du gradient reduit de Wolfe au cas de contraintes non line aires. In: Proceedings of the 4th International Conference on Operational Research (Boston 1966). Wiley~ New York (to appear). CARROLL (C. W.): The created response surface technique for optimizing nonlinear restrained systems. Operations Res.!!. (1961)~ 169-184. CAR TER (I. P. V.): Optimization techniques. Nordisk Tidskr. Informations-Behandling ~ (1963)~ 69-92. CAUCHY (A.): Methode generale pour la resolution des syst~mes d'equations simultanees. C. R. Acad. Sci. Paris 25 (1847)~ 536-538. Also in: OEuvres complmes d' Augustin Cauchy~ Tome X~ pp. 399-406. Gauthier-Villars. Paris~ 1901., CEA (J.): Les methodes de "descente" dans la theorie de l'optimisation. Rev. Franc;aise Informat. Recherche Operationnelle ~ (1968)~ no. 13~ 79-101. CHADDA ( S. S.): A decomposition principle for fractional programming. Opsearch (India)! (l967)~ no. 3~ 123-132. CHANDRA (S.): The capacitated transportation preblem in linear fractional functional programming. J. Operations Res. Soc. Japan.!.Q. (1967L 18-26.

- 95 - --- : Decomposition principle for linear fractional functional programs. Rev. Fran<;:aise Inform at. Recherche Operationnelle ~ (1968)" no. 10" 65-71. CHARNES (A.): The geometry of convergence of simple perceptrons. J. Math. Anal. Appl. J.. (1963).. 475-481. --- : Some fundamental theorems of perceptron theory and their geometry. Computer and Information Sciences (J. T. Tou & R. H. Wilcox eds. L pp. 67-74. Spartan Books.. Washington.. 1964. --.. CLOWER (R. W.).. KORTANEK (K.): Effective control through coherent decentralization with preemptive goals. Econometrica ~ (1967).. 294-320. ---.. COOPER (W. W.): Nonlinear power of adjacent extreme point methods of linear programming. Econometrica ~ (1957). 132-153. ---.. --- : Nonlinear network flows and convex programming over incidence matrices. Naval Res. Logist. Quart. ~ (1958).. 231-240. ---.. --- : Programming with linear fractional functionals. Naval Res. Logist. Quart. ~ (1962).. 181-186. ---.. --- : Deterministic equivalents for optimizing and satisficing under chance constraints. Operations Res..!:l (1963).. 18-39. ---.. --- : Optimizing engineering designs under inequality constraints. Cahiers Centre Etudes Recherche Oper. ~ (1964).. 181-187. ---.. --- : A note on the 'fail-safe' properties of the "generalized Lagrange multiplier method". Operations Res. II (1965).. 674-677. ---.. --- : A convex approximant method for noneonvex extensions of geometric programming. Proc. Nat. Acad. Sci. USA ~ (1966).. 1361-1364. ---.. ---.. KOR T ANEK (K. 0.): Duality.. Haar programs.. and finite sequence spaces. Proc. Nat. Acad. Sci. USA 48 (1962).. 783-786. A duality theory for convex programs with convex constraints. Bull. Amer. Math. Soc. 68 (1962).. 605-608.

- 96 - ~ ~ --- : Duality in semi-infinite programs and some works of Haar and Caratheodory. Management Sci. 9 (1963)~ 209-228.; erratum~ ibid. ~ (1963). 701. --- ~ --- ~ --- : Duality in semi-infinite programming and some works of Haar and, Caratheodory. Proceedings of the 3rd International Conference on Operational Research (Oslo 1963)~ pp. 107-117. Dunod~ Paris~ 1964. --- ~ --- ~ --- : On representations of semi-infinite programs which have no duality gaps. Management Sci. ~ (1965). 113-121. --- ~ --- ~ --- : Semi-infinite programming~ differentiability and geometric programming. II. Aplikace Mat.!! (1969)~ 15-22. --- ~ --- ~ --- : On the theory of semi-infinite programming and a generalization of the Kuhn- Tucker saddle point theorem for arbitrary convex functions. Naval Res. Logist. Quart. ~ (1969)~ 41-51. --- ~ FIACCO (A. V.)~ LITTLECHILD (S. C.): Convex approximants and decentralization: A SUMT approach. Systems Research Memorandum No. 165. The Technological Institute~ Northwestern University~ Evanston, 1966. --- ~ KIRBY (M.): Modular design~ generalized inverses and convex programming. Operations Res. ~ (1965)~ 836-847. --- ~ KOR T ANEK (K. 0.): A generalization of a theorem of Edmund Eisenberg. Systems Research Memorandum No. 128. The Technological Institute~ Northwestern University. Evanston~ 1965. ~ : A note on the discrete maximum principle and distribution problems. J. Math. and Phys. 45 (1966)~ 121-126. ~ LEMKE (C. E.): Minimization of non-linear separable convex functionals. Naval Res. Logist. Quart. 1:. (1954)~ 301-312. CHAZAN (D.): A new proof of a min-max theorem. IBM Research Report RC 1909. IBM Research Center~ Heights~ N. Y 1967. Yorktown

- 97 - -- : Profit functions and optimal control: an alternate description of the control problem. J. Math. Anal. Appl. ~ (1968).. 169-206... MIRANKER (W. L.): A non-gradient and parallel algorithm for unconstrained minimization. IBM Research Report RC 2206. IBM Research Center.. Yorktown.. Heights N. Y... 1968. CHENERY (H. B.).. UZAWA (H.): Non-linear programming in economic development. [Arrow.. Hurwiez & Uzawa.. 1968].. pp. 203-229. CHENEY (E. W.).. GOLDSTEIN (A. A.): NeWton's method for convex programming and Tchebycheff approximation. Numer. Math..!.. (1959).. 253-268. --.. --- : Proximity maps for convex sets. Proc. Amer. Math. Soc..!..Q (1959), 448-450. --.. --- : Tchebycheff approximation in locally convex spaces. Bull. Amer. Math. Soc. 68 (1962), 449-450. --.. --- : Tchebychefi approximation and related extremal problems. J. Math. Mech. 14 (1965). 87-98.. LOEB (H. L.): Two new algorithms for rational approximation. Numer. Math. ~ (1961), 72-75. --.. --- : On rational Chebyshev approximation. Numer. Math. i (1962).. 124-127. CHERRUAULT (Y. ): Une methode directe de minimisation et applications. Rev. Franc;aise Informat. Recherche Operationnelle ~ (1968).. no. 10.. 31-52. CHOW (W. M.): A note on the calculation of certain constrained maxima. Technometrics i (1962). 135-137. CLIMESCU (A.): Algebraic programming. I. II.. III.. IV. Bul. Inst. Politehn. Iasi (N. S.) 8 (1962).. no. 1-2.. 1-4 (Romanian),; 8 (1962). no. 1-2.. 5-8 (French); 10 (1964). no. 1-2.. 1-4 (French). 11 (1965).. no. 1-2.. 1-5 (Romanian). COLLATZ (L.): Tschebyscheffsche Approximation. Randwertaufgaben und Optimierungsaufgaben. Wiss. Z. Hochsch. Architektur Bauwesen Weimar g (1965),504-509.

- 98 - --- : Lineare Randwertaufgaben und Approximationen von Funktionen. Mathematica (Cluj).!.Q (1968)1 53-63. --- : Zur mimerischen Behandlung der rationalen Tschebyscheff Approximation bei mehreren unabhangigen Veranderlichen. Aplikace Mat. ~ (1968)1 137-146. COLVILLE (A. R.): A comparative study of nonlinear programming codes. Technical Report No. 320-2949. IBM New York Scientific Center l New York l 1968. COROIU (R.): Simplex methods for solving quadratic programming problems. Econom. Comput. Econom. Cybernetics Stud. Res. (Bucharest)1968.. no.2.. 91-108. COTTLE (R. W.): A theorem of Fritz John in mathematical programming. RAND-Report RM- 3858- PRo The RAND Corp. 1 Santa Monica.. Calif. 1 1963. --- : Formal self-duality in nonlinear programming. Report ORC 63-19 1 pp. 1-8. Operations Research Center l University of California.. Berkeley.. 1963. --- : An infinite game with a convex-concave payoff kernel. Report ORC 63-19.. pp. 9-14. Operations Research Center.. University of California. Berkeley.. 1963. --- : Symmetric dual quadratic programs. Quart. Appl. Math. ~ (1963)1 237-243. --- : Note on a fundamental theorem in quadratic programming. SIAM J. Appl. Math. ~ (1964)1 663-665. --- : Nonlinear programs with positively bounded Jacobians. SIAM J. Appl. Math.!i (1966).. 147-158. --- : On the convexity of quadratic forms over convex sets. Operations Res. ~ (1967). 170-172. --- : Comments on the note by Kortanek and Jeroslow. Operations Res. ~ (1967)1 969-970. --- : The principal pivoting method of quadratic programming. [Dantzig & Veinott l 1968] 1 Part 11 pp. 144-162. --- : On a problem in linear inequalities. J. London Math. Soc. 43 (1968). 378-384.

- 99 -.. DANTZIG (G. B.): Complementary pivot theory of mathematical programming. Linear Algebra and Appl.!. (1968).. 103-125.II : Complementary pivot theory of mathematical programming. [Dantzig & Veinott.. 1968].. Part 1.. pp. 115-136. ---.II MOND (B.): Self-duality in mathematical programming. SIAM J. Appl. Math.!! (1966).. 420-424. CROCKETT (J. B.).. CHERNOFF (H.): Gradient methods of maximization. Pacific J. Math.E. (1955).. 33-50. CULLEN (D. E.): Solving nonlinear inequalties by relaxation.. with applications to nonlinear programming. Dissertation.. Washington University.. 1968. CURRY (H. B.): The method of steepest descent for nonlinear minimization problems. Quart. Appl. Math. ~ (1944L 258-263. CURTIS (A. R.).. POWELL (M. J. D.): Necessary conditions for minimax approximation. Computer J. ~ (1965).. 358-361. ---.. --- : On the convergence of exchange algorithms for calculating minim ax-approximations. Computer J. ~ (1966).. 78-80. CURTIS (P. C.).. FRANK (W. L.): An algorithm for the determination of the polynomial of best minimax approximation to a function defined on a finite point set. J. Assoc. Comput. Mach. ~ (1959).. 395-404. DA CUNHA (N. 0.).. POLAK (E.): Constrained minimization under vector valued criteria in finite dimensional spaces. J. Math. Anal. Appl.!2. (1967).. 103-124. --- '" --- : Constrained minimization under vector-valued criteria in linear topological spaces. [Balakrishnan & Neustadt", 1967J.. pp.96-108. DANIEL (J. W.): The conjugate gradient method for linear and nonlinear operator equations. SIAM J. Numer. Anal.! (1967).. 10-26. DANSKIN(J. M.): Fictitious play for continuous games. Naval Res. Logist. Quart.!. (1954).. 313-320.

- 100 - --- : The theory of min-max~ with applications. SIAM J. Appl. Math. 14 (l966)~ 641-664. --- : Note on the sequential maximization technique. Operations Res. ~ (l967)~ 828-829. --- : On suboptimization : an example. Operations Res. ~ (l968)~ 680-681. DANTZIG (G. B.): A proof of the equivalence of the programming problem and the game problem. rkoopmans~ 1951] ~ pp. 330-335. --- : Maximization of a linear function of variables subject to linear inequalities. [Koopmans~ 1951J ~ pp.339-347. --- : Note on B. Klein's IIDirect use of extremal principles in solving certain optimizing problems involving inequalities ll Operations Res. ± (1956)~ 247-249. --- : General convex objective forms. Mathematical Methods in the Social Sciences~ S. Karlin & P. Suppes eds.)~ pp. 151-158. Stanford University Press~ Stanford~ 1960. 1959 (K. J. Arrow~ --- : Quadratic programming. A variant of the Wolfe-Markowitz algorithms. Report ORC 61-3. Operations Research Center. University of California.. Berkeley.. 1961. --- : Optimization in Operations Research. Information Processing 1965 (Proceedings of IFIP Congress 65).. Vol. 1.. pp. 173-176. Spartan Books.. Washington D. C... 1965. --- : Linear control processes and mathematical programming. SIAM J. Control 4 (1966).. 56-60. Also in: [Dantzig -& Veinott.. 1968L Part 2.. pp. 31-36. --- : Application of generalized linear programming to control theory. [Ahadie~ 1967J.. pp. 281-286. ---.. COTTLE (R. W.): Positive (semi-) definite programming. rabadie.. 1967].. pp. 55-73. --.. EISENBERG (E.)~ COTTLE(R. W.): Symmetric dual nonlinear programs. Pacific J. Math. ~ (1965)~ 809-812.

- 101 - ~ FOLKMAN (J.)~ SHAPIRO (N.): On the continuity of the minimum set of a continuous function. J. Math. Anal. Appl.!1. (l967)~ 519-548. ~ FORD (L. R.)~ FULKERSON (D. R.): A primal-dual algorithm for linear programs. [Kuhn & Tucker~ 1956] ~ pp. 171-181. -- ~ ORDEN (A.)~ WOLFE (Ph.): The generalized simplex method for minimizing a linear form under linear inequality restraints. Pacific J. Math. ~ (1955)~ 183-195. ~ V AN SL YKE (R. M.): Generalized upper bounding techniques. J. Comput. System Sci.! (1967)~ 213-226. ~ WALD (A.): On the fundamental lemma of Neyman and Pearson. Ann. Math. Statist. 22 (1951)~ 87-93. --- ~ WOLFE (Ph.): Decomposition principle for linear programs. Operations Res. ~ (1960)~ 101-111. --- ~ -- : The decomposition algorithm for linear programs. Econometrica ~ (1961L 767-778. DAVID ON (W. C.): Var~able metric method for minimization. Atomic Energy Commission Report ANL-5990. Argonne National Laboratory~ Lemont~ ill. # 1959. --- : Variance algorithm for minimization. Computer J.!Q (1968L 406-410. DAVIS (P. J.)~ WILSON (M. W.): Non-negative interpolation formulas for uniformly elliptic equations. IBM Research Report RC 2211. IBM Research Center# Yorktown Heights~ N. Y. ~ 1968. DAVYDOV (E. G.): Application of Stieltjes moments (Russian). Z. Vycisl. Mat. i Mat. Fiz. J.. (1967)~ 1186-1193. DEBREU (G. E.): Definite and semidefinite quadratic forms. Econometrica 20 (l952)~ 295-300. --- : Economic equilibrium. Mat hematical Systems Theory and Economics I (H. W. Kuhn & G. P. Szeg6 eds.)~ pp. 11-22. Springer~ Berlin~ 1969. DEJON (B.)~ NICKEL (K.): A never failing~ fast converging rootfinding algorithm. Constructive Aspects of the Fundamental Theorem of Algebra (B. Dejon & p. Henrici eds.)~ pp. 1-35. Wiley~ New York~ 1969.

- 102 - DEMJ ANOV (V. F.): Solution of certain extremal problems (Russian). Avtomat. i Tel em ekh. 26 (1965)~ 1153-1160. Automat. Remote Control 26 (1965)~ 1144-1151 (English transl.). --- : Minimization of functions on convex bounded sets (Russian). Kibernetika (Kiev) 1965~ no. 6. 65-74. Cybernetics 1:. (1965) no. 6. 77-87 (English transl.). --- : On minimization of the maximal deviation (Russian). Vestnik Leningrad. Univ. ~ (1966)~ no. 7~ 21-28. --- : On the solution of certain minimax problems. I~ II (Russian). Kibernetika (Kiev) 1966~ no. 6~ 58-66; 1967~ no. 3. 62-66. --- : Successive approximations for finding saddle points (Russian). Dokl. Akad. Nauk SSSR 177 (1967). 21-24. Soviet Math. Dokl. ~ (1967)~ 1350-1353 (English transl.). --- : The investigation of saddle points (Russian). Vestnik Leningrad. Univ. ~ (1967). no. 19. 25-34. --- : The directional derivative of a maximin function (Russian). Dokl. Akad. Nauk SSSR 179 (1968). 1032-1033. --- : The use of second derivatives in the minimization of functions on bounded sets (Russian). Vestnik Leningrad. Univ. ~ (1968). no. 1. 24-32. ---. Algorithms for some minimax problems. J. Comput. System Sci. ~ (1968). 342-380. ---.., : Differentiation.., of the maximin function. I. II (Russian). Z. Vycisl. Mat. i Mat. Fiz.... (1968). 1186-1195; ~ (1969),55-67. ---. RUBINOV (A. M.): The minimization of a smooth convex functional on a convex set (Russian). Vestnik Leningrad. Univ. 19 (1964). no. 4~ 5-17. SIAM J. Control ~ (1967).280-294 (English transl.). ---. --- : On the problem of minimization of a smooth functional with convex constraints (Russian). Dokl. Akad. Nauk SSSR 160 (1965). 15-17. Soviet Math. Dokl. ~ (1965). 9-11 (English transl.).... : On necessary conditions for an extremum (Russian). Ekonom. i Mat. Metody ~ (1966)~ 406-417. : Minimization of functionals in normed spaces. SIAM J. Control ~ (1968). 73-88.