On duality for generalized pseudomonotonic programming

Authors

  • Ştefan Ţigan Ministery of Education and Science, Bucharest, Romania
Abstract views: 115

Abstract

Not available.

Downloads

Download data is not yet available.

References

Bector, C. R., Bhatt, S. K., Pseudomonotonic Integral Programming, Nav. Res. Log. Quart., 25 (1978), pp. 309-314, https://doi.org/10.1002/nav.3800250211

Bector, C. R., Jolly, P. L., Pseudomonotonic Integer Programming, In: Proceedings of the Seventh Maniloba Conference on Numerical Mathematics and computing, Univ. of Manitoba, Winnipeg, Manitoba (1977), pp. 133-145.

Bector, C. R., Jolly, P. L., Programming problems with pseudomonotonic objectives, Math. Operationsforsch. und Statist., ser. Optimization, 15 (1984), 2, pp. 217-229, https://doi.org/10.1080/02331938408842927,

Bhatt, S. L., Linezarization Technique for Linear Fractional and Pseudo-monotonic Programs Revisited, Cahiers du CERO, 23 (1981), pp. 53-56.

Dantzig, G. B., Linear Programming and Extensions, Princeton University Press, Princeton, New-Jersey, 1963.

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

Kortanek, K. O., Evans, J. P., Pseudo-concave programming and Lagrange regularitz, Opns. Res., 15 (1967), pp. 882-891, https://doi.org/10.1287/opre.15.5.882

Kucher, B. M., Pro oden algorithm rişhennia zadachi monotonovo programuvannia, Dopovidy Akad. Nauk Ukrain. SSR, s.A, 10 (1967), pp. 869-873 (Russian).

Martos, B., The Direct Power of Adjacent Vertex Programming Methods, Man. Sci., 12 (1965), pp. 241-252.

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

Mond, B., Techiques for pseudo-monotonic programming, LaTrobe University, Pure Math. Res. Paper No. 82-12, Melbourne, 1982.

Thuente, D., Duality theory for generalized programs with computational methods, Oper. Res., 28(4) (1980), pp. 1005-1011, https://doi.org/10.1287/opre.28.4.1005

Tigan, S., Sur quelques problèmes d'optimisation, SEMA (Metra International), Paris, Note de Travail No. 157, 1971.

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

Tigan, S., On the linearization technique for quasimonotonic optimization problems, Rev. Analyse Numer. theor. Approx., 12 (1983), 1, pp. 89-96.

Tigan, 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.

Downloads

Published

1991-08-01

How to Cite

Ţigan, Ştefan. (1991). On duality for generalized pseudomonotonic programming. Anal. Numér. Théor. Approx., 20(1), 111–116. Retrieved from https://ictp.acad.ro/jnaat/journal/article/view/1991-vol20-nos1-2-art14

Issue

Vol 20, Nos 1-2 (1991)

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.