zbMATH — the first resource for mathematics

Preliminary insights into optimal pricing and space allocation at intermodal terminals with elastic arrivals and capacity constraint. (English) Zbl 1098.91041
Summary: This paper discusses derivations, and implications of, formulae to compute optimal space allocation and pricing for storage at container terminals. The case discussed in the paper considers elastic arrivals and container dwelling times, which is a more general version of the case considered by the authors in their first publication on the subject. In general terms, the optimal prices have three components that capture the different facets of the process. The first element captures the combined effect of willingness to pay and marginal cost, i.e., the classic solution after Ramsey (1927). The second element represents the contribution of the capacity constraint, i.e., the element introduced in Holguín-Veras and Jara-Díaz (1999). The third element captures the role of elastic arrivals and represents the main contribution of this paper. The role of the cost structure is also analyzed.

91B24 Microeconomic theory (price theory and economic markets)
Full Text: DOI Link
[1] Holguín-Veras J, Jara-Díaz S (1999) Optimal space allocation and pricing for priority service at container ports. Transp Res Part B 33(2):81–106
[2] Karush W (1939) Minima of functions of several variables with inequalities as side conditions. M.S. thesis, Department of Mathematics, University of Chicago
[3] Kuhn HW, Tucker AW (1951) Nonlinear programming. In: Neyman J (ed) Proceedings of the Second Berkeley Symposium, University of California, Berkeley, pp 481–492
[4] Ramsey F (1927, March) A contribution on the theory of taxation. Econ J 37:47–61
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.