Bilevel transportation problems

Authors

  • Dorel Duca Babeş-Bolyai University, Cluj-Napoca, Romania
  • Liana Lupşa Babeş-Bolyai University, Cluj-Napoca, Romania

DOI:

https://doi.org/10.33993/jnaat301-678
Abstract views: 205

Abstract

In this paper we formulate the bilevel transportation problem of the cost-time type and of the cost-cost type, we propose a general algorithm for solving this problems and we also give two examples.

Downloads

Download data is not yet available.

References

Y. Chen and M. Florian, The nonlinear bilevel programming problem: formulations, regularity and optimality conditions, Optimization, 32 (1995), 193-209, https://doi.org/10.1080/02331939508844048 DOI: https://doi.org/10.1080/02331939508844048

D. I. Duca, L. Lupşa and E. Duca, Bicriteria transportation problems, Rev. Anal. Numér. Théor. Approx., 27 (1998), 81-90.

D. I. Duca, E. Duca and L. Lupşa, Bicriteria transportation problems, in Research on Theory of Allure, Approximation, Convexity and Optimization, Editura SRIMA, Cluj-Napoca, Romania, 1999, 52-71.

L. Lupşa, D. I. Duca and E. Duca, An algorithm for multicriteria transportation problems, in Analysis, Functional Equations, Approximation and Convexity, Editura Carpatica, Cluj-Napoca, Romania, 1999, 137-141.

Downloads

Published

2001-02-01

How to Cite

Duca, D., & Lupşa, L. (2001). Bilevel transportation problems. Rev. Anal. Numér. Théor. Approx., 30(1), 25–34. https://doi.org/10.33993/jnaat301-678

Issue

Vol. 30 No. 1 (2001)

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.