L. G. Proll
- 1 Wolfson, M.L., and Wright, H.V. Combinatorial of Mthings taken N at a time. Comm. ,4CM 6, 4 (Apr. 1963), 161. Google Scholar
Digital Library
- 2 Pearson, K. (Ed.). Tables of the Incomplete Beta Function. Cambridge U. Press, Cambridge, England, 1948.Google Scholar
- 1 Lemke, C.E. Bimatrix equilibrium points and mathematical programming. Management Sci. 11 (1965), 681-689.Google ScholarDigital Library
- 2 Ravindran, A. Computational aspects of Lemke's complementary algorithm applied to linear programs. Opsearch 7 (1970), 241-262.Google Scholar
- 3 Ravindran, A. A comparison of the primal simplex and complementary pivot methods for linear programming. Naval Res. Log. Q. 20 (1972), 95-100.Google ScholarCross Ref
- 4 Eaves, B.C. On quadratic programming. Management Sci. 17 (1971), 698-711.Google ScholarCross Ref
- 5 Eaves, B.C. The linear complementarity problem. Management Sci. 17 (1971), 612-634.Google ScholarCross Ref
- 6 Clasen, R.J. Techniques for automatic tolerance control in linear programming. Comm. ACM9 (1966), 802-803. Google ScholarDigital Library
- 1 Bultheel, A. Remark on Algorithm 450. Comm. ACM 17, 8 (Aug. 1974), 470.Google Scholar
- 2 Williams, T.J., and Otto, R.E. A generalized chemical processing model for the investigation computer control. A.LE.E. Trans. 79, P. 1, Communications and Electronics, (1960), 458-473Google Scholar
- 3 Kleme, J., and Vasek, V. Methods for optimizing complex chemical processes. In P roe. 2nd Symp. on Use of Computers in Chemical Engineering, CVTS, IAstinad Labem, Czechoslovakia, Sept. 1973, pp. O 84-0 102Google Scholar
Index Terms
- A computer routine for quadratic and linear programming problems
Recommendations
Linear programming to approximate quadratic 0-1 maximization problems
ACM-SE 35: Proceedings of the 35th Annual Southeast Regional ConferenceMany authors have used the continuous relaxation of linear formulations of quadratic 0-1 optimization problems subject to linear constraints in order to obtain a bound of the optimal value by linear programming. But usually, optimal solutions are non-...
Quadratic programming problems and related linear complementarity problems
This paper investigates the general quadratic programming problem, i.e., the problem of finding the minimum of a quadratic function subject to linear constraints. In the case where, over the set of feasible points, the objective function is bounded from ...
Mixed-integer quadratic programming
This paper considers mixed-integer quadratic programs in which the objective function is quadratic in the integer and in the continuous variables, and the constraints are linear in the variables of both types. The generalized Benders' decomposition is a ...
Comments