Linearly-Constrained Entropy Maximization Problem with Quadratic Cost and Its Applications to Transportation Planning Problems

DOI10.1287/trsc.29.4.353zbMath0853.90090MaRDI QIDQ4888171

Shu-Cherng Fang, H.-S. Jacob Tsao

Publication date: 6 January 1997

Published in: Transportation Science (Search for Journal in Brave)

Full work available at URL: https://scholarworks.sjsu.edu/indust_syst_eng_pub/3

zbMATH Keywords

transportation problems; quadratic rate of convergence; quadratic cost; Lagrangian dual; linearly-constrained entropy maximization; unconstrained convex programming dual approach

Mathematics Subject Classification ID

90C25: Convex programming

90C90: Applications of mathematical programming

90B06: Transportation, logistics and supply chain management

Related Items

An improved Stirling approximation for trip distribution models, A maximum entropy estimator for the aggregate hierarchical logit model, A hierarchical gravity model with spatial correlation: Mathematical formulation and parameter estimation, Entropy maximization model for the trip distribution problem with fuzzy and random parameters, A microeconomic interpretation of the maximum entropy estimator of multinomial logit models and its equivalence to the maximum likelihood estimator, A non-linear goal programming model and solution method for the multi-objective trip distribution problem in transportation engineering