This study presents a multimodal hub location problem which has the capability to split commodities by limited-capacity hubs and transportation systems, based on the assumption that demands are stochastic for multi-commodity network flows. In the real world cases, demands are random over the planning horizon and those which are partially fulfilled, are lost. Thus, the present study handles dema...

I our prior work on product diffusions in presence of a capacity constraint, we postulated that a firm operating in such an environment should always attempt to fulfill as much of the present demand as is possible with the capacity constraint. In other words, the firm would never have demand backlogged while accumulating inventory. In this note, we derive a sufficient condition for the optimali...

The random coding capacity of a vector Gaussian arbitrarily varying channel (VGAVC) is determined, along with a simple general method for computing this capacity. The VGAVC is a discrete-time memoryless vector channel with an input power constraint and additive Gaussian noise that is further corrupted by an additive “jamming signal.” The statistics of this jamming signal are unknown and may be ...

The applications of the general formulae of channel capacity developed in the quantum information theory to evaluation of information transmission capacity of optical channel are interesting subjects. In this review paper, we will point out that the formulation based on only classicalquantum channel mapping model may be inadequate when one takes into account a power constraint for noisy channel...

We present new capacity upper bounds for the discrete-time Poisson channel with no dark current and an average-power constraint. These bounds are a simple consequence of techniques developed by one of the authors for the seemingly unrelated problem of upper bounding the capacity of binary deletion and repetition channels. Previously, the best known capacity upper bound in the regime where the a...

We study the convex hull of the splittable flow arc set with capacity and minimum load constraints. This set arises as a relaxation of problems where clients have demand for a resource that can be installed in integer amounts and that has capacity limitations and lower bounds on utilization. We prove that the convex hull of this set is the intersection of the convex hull of the set with a capac...

This paper investigates the performance impact of lot-sizing rule (LSR) selection and freezing of the master production schedule (MPS) in multi-item single-level systems with a single resource constraint under deterministic demand. The results of the study show that the selection of LSRs and the parameters for freezing the MPS have a significant impact on total cost, schedule instability, and t...

We measure the capacity output of a firm as the maximum amount producible by a firm given a specific quantity of the quasi-fixed input and an overall expenditure constraint for its choice of variable inputs. We compute this indirect capacity utilization measure for the total manufacturing sector in the US as well as for a number of disaggregated industries, for the period 1970-2001. We find con...

In this paper, we present a novel multi-objective mathematical model for capacitated single allocation hub location problem. There are the vehicle capacity constraint and capacity restrictions amount of the incoming flow to the hub while the balancing requirements of incoming quantities of flow to the each hub is considered. Moreover, there is a set of available capacities for each potential hu...