Ein Verfahren der zulässigen Richtungen

  • H. P. Künzi
  • W. Oettli
Part of the Lecture Notes in Operations Research and Mathematical Systems book series (LNE, volume 16)

Zusammenfassung

Problem:
$$ \begin{array}{*{20}{l}} {Min\left\{ {F(x)|x \in S} \right\}mit} \\ {S = \left\{ {x|x \in C;{f_j}(x) \leqslant 0f\ddot ur allej \in J} \right\}.} \end{array} $$
(9.1)

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Literatur

  1. [9.1]
    . Zoutendijk, G.: Methodsfofeasibledirections. Elsevier,Amsterdam, (1960).Google Scholar
  2. [9.2]
    . Frank, M. and Wolfe, Ph. : An algorithmfor quadratic pro-gramming. Naval Res. Logist. Quart., 3 (1965)., p. 95–110.CrossRefGoogle Scholar
  3. [9.3]
    Zukhovitskij, S. I., Poljak, R. A. and Primak, M. E. : An algorithm for thesolution of the convex programming problem. Soviet Math. Dokl. 4(1963), p. 1754–1757.Google Scholar

Copyright information

© Springer-Verlag Berlin · Heidelberg 1969

Authors and Affiliations

  • H. P. Künzi
    • 1
  • W. Oettli
    • 2
  1. 1.Universität und ETHZürichSchweiz
  2. 2.IBM ForschungslaboratoriumZürichSchweiz

Personalised recommendations