On the linearization technique for quasimonotonic optimization problems

Authors

  • Ştefan Ţigan Territorial Computing Center, Cluj-Napoca, Romania
Abstract views: 139

Abstract

Not available.

Downloads

Download data is not yet available.

References

Bector, C. R., Jolly, P. L,. Pseudo-monotonic integer programming. Proceedings of the Seventh Manitoba Conference on Numerical Mathematics and Computing (Univ. Manitoba, Winnipeg, Man., 1977), pp. 211-218, Congress. Numer., XX, Utilitas Math., Winnipeg, Man., 1978, MR0535010.

Bector, C. R., Bhatt, S. K., Pseudomonotonic interval programming. Naval Res. Logist. Quart. 25 (1978), no. 2, 309-314, MR0509180.

Bhatt, S. K., Linearization technique for linear fractional and pseudomonotonic programs revisited. Cahiers Centre Études Rech. Opér. 23 (1981), no. 1, 53-56, MR0626895.

Chandrasekaran, R., Minimal ratio spanning trees. Networks 7 (1977), no. 4, 335-342, MR0464667.

Dantzig, G.B., Blattner W.O., Rao, M.R., Finding a cycle in a graph with minimum cost to time ratio with application to a ship routing problem, Théorie des Graphes, pp. 77-83, Proc. of the International Symp., Rome, 1966.

Dragomirescu M., Maliţa M., Programare neliniară, Editura Ştiinţifică, Bucureşti, 1972.

Gondran, Michel, Minoux, Michel, Graphes et algorithmes. (French) [Graphs and algorithms] Collection de la Direction des Études et Recherches d'Électricité de France [Collection of the Department of Studies and Research of Électricité de France], 37. Éditions Eyrolles, Paris, 1979. xxvii+518 pp., MR0615739.

Kortanek, K. O., Evans, J. P., Pseudo-concave programming and Lagrange regularity. Operations Res. 15 1967 882-891, MR0224374.

Kucher, B.M., Pro oden algoritm reşenia zadaci monotonogo programuvannia, Dopovidî Akad. Nauk. Ukrain. SSR, s.A, 10, 869-872, 1967.

Martos, B., The direct power of adjacent vertex programming methods. Management Sci. 12 1965 241-252, MR0189824.

Peteanu V., Ţigan Ş., O nouă problemă de drum optim în grafe, Al II-lea Simp. "Informatică şi conducere", Cluj-Napoca, vol. II, 169-173, 1976.

Rockafellar, R., Tyrrell Convex analysis. Princeton Mathematical Series, No. 28 Princeton University Press, Princeton, N.J. 1970 xviii+451 pp., MR0274683.

Ţigan, Ştefan, Sur une méthode de décomposition pour le problème de programmation monotone. (French) Mathematica (Cluj) 13(36) (1971), 347-354, MR0329649.

Ţigan, Ş., Sur quelques problèmes d'affectation, SEMA (Metra International) Paris, Note de travail no. 157, 1971.

Downloads

Published

1983-02-01

How to Cite

Ţigan, Ştefan. (1983). On the linearization technique for quasimonotonic optimization problems. Anal. Numér. Théor. Approx., 12(1), 89–96. Retrieved from https://ictp.acad.ro/jnaat/journal/article/view/1983-vol12-no1-art11

Issue

Vol. 12 No. 1 (1983)

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.