On a quasimonotonic max-min problem

Authors

  • Ştefan Ţigan Cluj-Napoca, Romania
Abstract views: 166

Abstract

Not available.

Downloads

Download data is not yet available.

References

Balinski, M. L., An algorithm for finding all vertices of convex polyhedral sets, J. Soc. Indust. Appl. Math., 9 (1961), pp. 72-88, https://doi.org/10.1137/0109008

Bector, C. R., Jolly, P. L., Programming problems with pseudo-monotonic objectives, Math. Operationsforsch., und Statists., ser. Optimization, 15(1984), 2, pp. 217-229.

Belenkiy, A.S., Minimization of a monotone function on a polyhedral set, Avt. i Telemeh., 9 (1982), pp. 112-121.

Belenkiy, A.S., On minimas problems with monotone functions on polyhedral sets, Avt. i Telemeh., 10(1982), pp. 94-106.

Bhatt, S. K., Linearization technique for linear-fractional and pseudomonotonic programs revisited, Cahiers du C.E.R.O., 23(1981), 1, 53-56.

Cook, W. D., Kirby, M. J. L., Mehndiratta, S.L., A linear-fractional Max-min problem, Operations Research, 23(1975), 3, pp. 511-521, https://doi.org/10.1287/opre.23.3.511

Falk, J.E., A linear max-min problem, Math. Progr. 5(1973), pp. 169-188, https://doi.org/10.1007/bf01580119

Martos, B., Nonlinear Programming. North-Holland Pub. Co., 1975.

Mond, B., Techniques for pseudomonotonic programming, La Trobe University, Melbourne, Pure Math. Res. Paper, No. 82-12, 1982.

Stancu-Minasian, I. M., Patkar, V., A note on nonlinear fractional max-min problem, Nat. Acad. Sci. Letters (India), 8(1985), 2, pp. 39-41.

Ţigan, S., Sur une méthode de décomposition pour le problème de programmation monotone, Mathematica, 13(36) (1971), 2, pp. 347-354.

Ţigan, S., On the linearization technique for quasimonotonic optimization problems, Rev. Analyse Numer. Théor. Approx., 12(1983), 1, pp. 89-96.

Ţigan, S., A quasimonotonic max-min programming problem with linked constraints, Itinerant Sem. on functional eq., approx. and conv., Cluj-Napoca, University, (1986), pp. 279-284.

Weber, R., Pseudomonotonic multiobjective Programming, Discussion Paper, Institute of Operations Research, University of Saarland, Sarbruecken, B 8203, 1982.

Downloads

Published

1990-02-01

How to Cite

Ţigan, Ştefan. (1990). On a quasimonotonic max-min problem. Anal. Numér. Théor. Approx., 19(1), 85–91. Retrieved from https://ictp.acad.ro/jnaat/journal/article/view/1990-vol19-no1-art14

Issue

Vol. 19 No. 1 (1990)

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.