-
作者：Barnhart, C; Hane, CA; Vance, PH
作者单位：Massachusetts Institute of Technology (MIT); Auburn University System; Auburn University
摘要：We present a column-generation model and branch-and-price-and-cut algorithm for origin-destination integer multicommodity flow problems. The origin-destination integer multicommodity flow problem is a constrained version of the linear multicommodity flow problem in which flow of a commodity (defined in this case by an origin-destination pair) may use only one path from origin to destination. Branch-and-price-and-cut is a variant of branch-and-bound, with bounds provided by solving linear progr...
-
作者：Fu, MC; Marcus, SI; Wang, IJ
作者单位：University System of Maryland; University of Maryland College Park; University System of Maryland; University of Maryland College Park; Johns Hopkins University; Johns Hopkins University Applied Physics Laboratory
摘要：We consider the problem of determining the optimal policy for staffing a queueing system over multiple periods, using a model that takes into account transient queueing effects. Formulating the problem in a dynamic programming setting, we show that the optimal policy follows a monotone optimal control by establishing the submodularity of the objective function with respect to the staffing level and initial queue size in a period. In particular, this requires proving that the system occupancy i...
-
作者：Feng, YY; Xiao, BC
作者单位：National University of Singapore; Long Island University; Long Island University Post
摘要：It is a common practice for industries to price the same products at different levels. For example, airlines charge various fares for a common pool of seats. Seasonal products are sold at full or discount prices during different phases of the season. This article presents a model that reflects this yield management problem. The model assumes that (1) products are offered at multiple predetermined prices over time; (2) demand is price sensitive and obeys the Poisson process; and (3) price is al...
-
作者：Mehrabian, S; Jahanshahloo, GR; Alirezaee, MR; Amin, GR
作者单位：Islamic Azad University
摘要：This paper clarifies the role of non-Archimedean infinitesimal epsilon in DEA models so that the associated linear programs may be infeasible (for the multiplier side) and unbounded (for the envelopment side) for certain values of epsilon. It is shown that the bound of epsilon proposed by Ali and Seiford (1993) is invalid for feasibility and boundedness of the linear programs. A procedure is presented for determining an assurance interval of epsilon. It is also shown that an assurance value fo...
