Copyright © 2025 Authors retain the copyright of this article. This article is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

@article{152315,
        author = {rajiv kumar},
        title = {mathematical programming formulation of transportation modles},
        journal = {International Journal of Innovative Research in Technology},
        year = {},
        volume = {8},
        number = {2},
        pages = {899-906},
        issn = {2349-6002},
        url = {https://ijirt.org/article?manuscript=152315},
        abstract = {The next generation of transportation, location, models will most probably emerge from mathematical programming formulations. Presented are simple numerical examples of trip assignment and population location, both described as optimization problems, in mathematical programming formulations. A trip assignment model with constant link costs less described first, and then the same model is modified to show the consequences of a How-dependent link cost formulation. In similar fashion, a linear model of least cost population location is transformed into a nonlinear model that incorporates dispersion of location due to differences in locators' preferences or perceptions. It less then showed how the trip assignment model and the location model can be combined into a single nonlinear programming formulation that solves both problems simultaneously.},
        keywords = {Transportation problem, Bottleneck Transportation Problem, Mathematical Programming},
        month = {},
        }