On a bicriterion max-min fractional problem

Authors

  • Ştefan Ţigan Ministry of Education and Science, Bucharest, Romania
  • I. M. Stancu-Minasian Centre of Mathematical Statistics, Bucharest, Romanian Academy, Romania
Abstract views: 119

Abstract

Not available.

Downloads

Download data is not yet available.

References

Belenkii, A. S., Minimax scheduling problems with linear constraints and methods o their solutions, Avt. i Telemeh., 10 (1981), pp. 157-170.

Charnes, A., Cooper, W. W., Programming with linear fractional functionals, Naval Res. Logist. Quart., 9 (1962), pp. 181-186, https://doi.org/10.1002/nav.3800090303

Choo, E. U., Atkins, D. R., Bicriteria linear fractional programming, J. Optim. Theor. Appl., 36, (1982) 2, pp. 203-220, https://doi.org/10.1007/bf00933830

Cimoca, G., Tigan, S., O problemă polinomială de max+min cu restricţii linieare, Seminarul "T. Angheluţă", Inst. Politeh., Cluj-Napoca (Romania), 1983, pp. 35-38.

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

Geoffrion, A.M., Solving bicriterion mathematical programs, Opns. Res., 15 (1967), pp. 39-54, https://doi.org/10.1287/opre.15.1.39

Patkar, V. N., Stancu-Minasian, I. M., a disjunctive linear-fractional max-min problem, Portugal Math., (to appear).

Ritter, K., A parametric method for solving certain nonconcave maximization problems, J. Comput. Syst. Sci., 1 (1967), pp. 44-54.

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

Stancu-Minasian, I. M., Tigan, S., the minimum risk approach to max-min bilinear programming, An. Sttinţ. Univ. Al. I. Cuza Iaşi, N. ser., Secţ. 1a, 31 (1985), pp. 205-209.

Stancu-Minasian, I. M., Tigan, S., Generalized pseudofractional max-min problems, Itinerant Sem. Functional Eq., approx. and convexity, Cluj-Napoca Univ. (Romania), 1988, pp. 295-302.

Tigan, S., Sur quelques problèmes de programmation pseudofractionaire, Analyse Num. Th. Approx., 11 (1982), 1-2, pp. 167-174.

Tigan, S., A quasimonotonic max-min programming problem with linked constraints, Itinerant Sem. functional Eq., approx. and convexity, Cluj-Napoca Univ. (Romania), 1986, pp. 279-284.

Tigan, S., Numerical methods for solving some max-min pseudofractional problems, Simpozionul de Matematici şi Aplicaţii, Inst. Politeh. Timişoara (Romania), 1987, pp. 93-97.

Warburton, A. R., Parametric solution of bicriterion linear fractional programs, Opns. Res., 33 (1985), 1, pp. 74-84, https://doi.org/10.1287/opre.33.1.74

Weber, R., Pseudomonotonic Multiobjective Programming, Discussion Papers B8203, Institute of Operations Research, Univ. or Saarland, Saarbruecken, 1982.

Fujishige, S., Katoh, N., Ichimori, T., The fair resource allocation problem with submodular constraints, Mathematics of Operations Research, 13 (1988), pp. 164-173, https://doi.org/10.1287/moor.13.1.164

Downloads

Published

1991-08-01

How to Cite

Ţigan, Ştefan, & Stancu-Minasian, I. M. (1991). On a bicriterion max-min fractional problem. Anal. Numér. Théor. Approx., 20(1), 117–125. Retrieved from https://ictp.acad.ro/jnaat/journal/article/view/1991-vol20-nos1-2-art15

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.