×

A new method for solving conditioned maxima problems. (English) Zbl 0127.11102


PDF BibTeX XML Cite
Full Text: DOI

References:

[1] Carrol, Ch, The created response surface technique for optimizing nonlinear restrained systems, Operations Res., 2, 169-183 (1961)
[2] Motzkin, T. S.; Schoemberg, J., The relaxation method for linear inequalities, Can. J. Math., 6, 393-404 (1954) · Zbl 0055.35002
[3] Rosen, B., The gradient projection method for nonlinear programming, Part I. Linear constraints, J. Soc. Ind. Appl. Math., 8, 181-217 (1960) · Zbl 0099.36405
[4] Rosen, B., The gradient projection method for nonlinear programming, Part II. Nonlinear constraints, J. Soc. Ind. Appl. Math., 4, 514-532 (1961) · Zbl 0231.90048
[5] Tucker, A. W., Linear and nonlinear programming, Operations Res., 2, 244-257 (1957) · Zbl 1414.90220
[6] Wolfe, Ph, Some simplex-like nonlinear programming procedures, Operations Res., 4, 438-447 (1962) · Zbl 0109.14004
[7] Zoudentijk, G., Methods of Feasible Directions (1960), Elsevier: Elsevier Amsterdam
[8] Frisch, K. R., The multiplex method for linear programming, Sankhyã, 18, 329-362 (1957) · Zbl 0084.15803
[10] Johansen, L., The Free Maximum Method for Solving Linear Programming Problems (1956), Sosialøkonomisk Inst. Univ.,: Sosialøkonomisk Inst. Univ., Oslo, Memo.
[11] Parisot, G. R., Les Programmes Logarithmiques—Application aux Calculs des Programmes Convexes (1960), IBM France, Unesco, NS, ICIP, D.1.5 · Zbl 0114.36104
[12] Sandee, J.; Vaneijk, C. J., Quantitative determination of an optimum economic policy, Econometrica, 27, 1-13 (1959) · Zbl 0085.35805
[13] Caldwell, G. C., A note on the down-hill method, J. Assoc. Comp. Mach., 6, 223-225 (1959) · Zbl 0099.33101
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.