A simplex-like technique for the maximization of a convex quadratique function under linear constraints

Authors

  • I. Maruşciac "Babeş-Bolyai" University, Cluj-Napoca, Romania
Abstract views: 166

Abstract

Not available.

Downloads

Download data is not yet available.

References

Altman, M., Bilinear programming. Bull. Acad. Polon. Sci. Sér. Sci. Math. Astronom. Phys. 16 1968 741-746, MR0258450.

Konno, Hiroshi, Maximization of a convex quadratic function under linear constraints. Math. Programming 11 (1976), no. 2, 117-127, MR0449684, https://doi.org/10.1007/bf01580380

Konno, Hiroshi, Maximizing a convex quadratic function over a hypercube. J. Oper. Res. Soc. Japan 23 (1980), no. 2, 171-189, MR0580760, https://doi.org/10.15807/jorsj.23.171

Lebedev, V. Iu., Metod resenia zadać makisimizatzii polozitel'no opredel'onnoi cvadrutićnoi formy na mnogogranniki, Być. Mat. i Mat. Fiz. 22, 6, 1344-1351, 1982.

Maruşciac, I., On bilinear programming. Anal. Numér. Théor. Approx. 7 (1978), no. 1, 67-79, MR0530900.

Vandal, A., Bilinear programming, Ekonomska Analiza 4, 1-2, 21-41, 1970.

Downloads

Published

1984-08-01

How to Cite

Maruşciac, I. (1984). A simplex-like technique for the maximization of a convex quadratique function under linear constraints. Anal. Numér. Théor. Approx., 13(2), 125–142. Retrieved from https://ictp.acad.ro/jnaat/journal/article/view/1984-vol13-no2-art4

Issue

Vol. 13 No. 2 (1984)

Section

Articles

License

Copyright (c) 2015 Journal of Numerical Analysis and Approximation Theory

Creative Commons License

This work is licensed under a Creative Commons Attribution 4.0 International License.

Open Access. This article is distributed under the terms of the Creative Commons Attribution 4.0 International License, which permits unrestricted use, distribution, and reproduction in any medium, provided you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license, and indicate if changes were made.