Künzi, H. P.; Tzschach, H. The duoplex-algorithm. (English) Zbl 0132.13803 Numer. Math. 7, 222-225 (1965). Reviewer: H. J. Töpfer Page: −5 −4 −3 −2 −1 ±0 +1 +2 +3 +4 +5 Show Scanned Page Cited in 1 ReviewCited in 2 Documents MSC: 90C30 Nonlinear programming Keywords:operations research PDF BibTeX XML Cite \textit{H. P. Künzi} and \textit{H. Tzschach}, Numer. Math. 7, 222--225 (1965; Zbl 0132.13803) Full Text: DOI EuDML References: [1] If the number of independent variablesn is ?2 and the constraint is not redundant, the maximum is assumed on this constraint. This can easily be proved. But ifn>2 this need not be true. See alsoJ. C. G. Boot: ?Quadratic Programming?, p. 93; North-Holland Publishing Company [2] SeeKünzi, H. P.: Die Simplexmethode zur Bestimmung einer Ausgangslösung bei bestimmten linearen Programmen. Unternehmensforschung2 (1958). · Zbl 0085.35806 [3] SeeKünzi, H. P.: Die Douplex-Methode. Unternehmensforschung7, 103ff. (1963). · Zbl 0114.36103 This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.