The Alternating Stock Size Problem and the Gasoline Puzzle

Given a set S of integers whose sum is zero, consider the problem of finding a permutation of these integers such that: (i) all prefix sums of the ordering are nonnegative, and (ii) the maximum value of a prefix sum is minimized. Kellerer et al. referred to this problem as the "Stock Size Problem" and showed that it can be approximated to within 3/2. They also showed that an approximation ratio of 2 can be achieved via several simple algorithms. We consider a related problem, which we call the "Alternating Stock Size Problem", where the number of positive and negative integers in the input set S are equal. The problem is the same as above, but we are additionally required to alternate the positive and negative numbers in the output ordering. This problem also has several simple 2-approximations. We show that it can be approximated to within 1.79. Then we show that this problem is closely related to an optimization version of the gasoline puzzle due to Lov\'asz, in which we want to minimize the size of the gas tank necessary to go around the track. We present a 2-approximation for this problem, using a natural linear programming relaxation whose feasible solutions are doubly stochastic matrices. Our novel rounding algorithm is based on a transformation that yields another doubly stochastic matrix with special properties, from which we can extract a suitable permutation

Adapted Downhill Simplex Method for Pricing Convertible Bonds

The paper is devoted to modeling optimal exercise strategies of the behavior of investors and issuers working with convertible bonds. This implies solution of the problems of stock price modeling, payoff computation and min-max optimization. Stock prices (underlying asset) were modeled under the assumption of the geometric Brownian motion of their values. The Monte Carlo method was used for calculating the real payoff which is the objective function. The min-max optimization problem was solved using the derivative-free Downhill Simplex method. The performed numerical experiments allowed to formulate recommendations for the choice of appropriate size of the initial simplex in the Downhill Simplex Method, the number of generated trajectories of underlying asset, the size of the problem and initial trajectories of the behavior of investors and issuers.Comment: 18 pages, 8 figure

The Alternating Stock Size Problem and the Gasoline Puzzle

International audienc

Lot-sizing with stock upper bounds and fixed charges

Here we study the discrete lot-sizing problem with an initial stock variable and an associated variable upper bound constraint. This problem is of interest in its own right, and is also a natural relaxation of the constant capacity lot-sizing problem with upper bounds and fixed charges on the stock variables. We show that the convex hull of solutions of the discrete lot-sizing problem is obtained as the intersection of two simpler sets, one involving just 0-1 variables and the second a mixing set with a variable upper bound constraint. For these two sets we derive both inequality descriptions and polynomial-size extended formulations of their respective convex hulls. Finally we carry out some limited computational tests on single-item constant capacity lot-sizing problems with upper bounds and fixed charges on the stock variables in which we use the extended formulations derived above to strengthen the initial mixed integer programming formulations.mixed integer programming, discrete lot-sizing, stock fixed costs, mixing sets

Exact Results for the Roughness of a Finite Size Random Walk

We consider the role of finite size effects on the value of the effective Hurst exponent H. This problem is motivated by the properties of the high frequency daily stock-prices. For a finite size random walk we derive some exact results based on Spitzer's identity. The conclusion is that finite size effects strongly enhance the value of H and the convergency to the asymptotic value (H=1/2) is rather slow. This result has a series of conceptual and practical implication which we discuss.Comment: 5 pages, 3 figure

Distribution Network Configuration Considering Inventory Cost

Inter-city distribution network structure is considered as one of which determine the quantity of economic activities in each city. In the field of operations research, several types of optimal facility location problem and algorithms for them have been proposed. Such problems typically minimize the logistic cost with given inter-city transportation cost and facility location cost. But, when we take inventory to coop with fluctuating demands into account, facility size becomes different for each location reflecting the level of uncertainty of demand there. As observed in many developed countries, customers require more variety of commercial goods, and we must prepare more number of commercial goods. Moreover, life length of each product becomes shorter. Without highly organized management, large inventory for many products yield large risk of depreciation of commercial value as well as large cost for floor space for stocking. Considering those, inventory cost should be explicitly considered in distribution network configuration problem. There is an essential trade off between inventory cost and transportation cost: when you set smaller number of distribution center having thicker demands there, relative stock size to coop with fluctuations become small and then, we need less inventory cost. But such concentrated location pattern results longer transportation to the customers and larger transportation cost. Nozick and Turnquist(2001) formulated a two-echelon distribution network formation problem considering inventory cost at plant and distribution centers. They used optimal inventory assignment considering the expected penalty of distribution center stock-out and plant stock-out. Stock-out was considered as the situation when Poisson distributed demand exceeded stock size, and the mean demand there was given by optimal facility location model. Inventory size of distribution center alters the location cost of distribution center, therefore optimal facility location problem was refreshed and solved again. The paper proposed iterative algorithm to get optimal inventory locations. Our paper expands their model in two ways; first we admit the difference of unit location cost for distribution centers by geographical locations, and secondly, we consider different uncertainties for customer orders by departing from simple Poisson distribution. The first alternation gives new explanation for the following situations: highly dense metropolitan regions have relatively larger number of centers and smaller coverage of each center. But such propensity usually contradicts with the land price; then center location should be limited considering higher land price in metropolitan areas. Then the optimal locations cannot be prospected in straight forwardly. The second model expansion allows our model to analyze how regularity of demands affects on the network structure. Our paper applies the model to the realistic Japanese transportation network, and show which cities may possess distribution center function in the nationwide distribution network. Without the back-stock in plant level, each distribution center must prepare inventory for their demand, but such inventory sometime requires unrealistic large location cost in metropolitan area such as Tokyo. On the other hand, if distribution center can rely on the back stock in plant, the centers in metropolitan regions stand without their own inventory.

The power of some standard tests of stationarity against changes in the unconditional variance

Abrupt changes in the unconditional variance of returns have been recently revealed in many empirical studies. In this paper, we show that traditional KPSS-based tests have a low power against nonstationarities stemming from changes in the unconditional variance. More precisely, we show that even under very strong abrupt changes in the unconditional variance, the asymptotic moments of the statistics of these tests remain unchanged. To overcome this problem, we use some CUSUM-based tests adapted for small samples. These tests do not compete with KPSS-based tests and can be considered as complementary. CUSUM-based tests confirm the presence of strong abrupt changes in the unconditional variance of stock returns, whereas KPSS-based tests do not. Consequently, traditional stationary models are not always appropriate to describe stock returns. Finally, we show how a model allowing abrupt changes in the unconditional variance is well appropriate for CAC 40 stock returns.KPSS test, panel stationarity test, unconditional variance, abrupt changes, stock returns, size-power curve.

Bin Packing and Related Problems: General Arc-flow Formulation with Graph Compression

We present an exact method, based on an arc-flow formulation with side constraints, for solving bin packing and cutting stock problems --- including multi-constraint variants --- by simply representing all the patterns in a very compact graph. Our method includes a graph compression algorithm that usually reduces the size of the underlying graph substantially without weakening the model. As opposed to our method, which provides strong models, conventional models are usually highly symmetric and provide very weak lower bounds. Our formulation is equivalent to Gilmore and Gomory's, thus providing a very strong linear relaxation. However, instead of using column-generation in an iterative process, the method constructs a graph, where paths from the source to the target node represent every valid packing pattern. The same method, without any problem-specific parameterization, was used to solve a large variety of instances from several different cutting and packing problems. In this paper, we deal with vector packing, graph coloring, bin packing, cutting stock, cardinality constrained bin packing, cutting stock with cutting knife limitation, cutting stock with binary patterns, bin packing with conflicts, and cutting stock with binary patterns and forbidden pairs. We report computational results obtained with many benchmark test data sets, all of them showing a large advantage of this formulation with respect to the traditional ones

Moral Hazard Problems in Fisheries Regulation: The Case og Illegal Landings

This paper treats illegal landings as a moral hazard problem that arises, since individual catches are unobservable to society and hence private information. A tax/subsidy mechanism taking into account the asymmetric information problem is formulated as a solution to problems with illegal landings. The incentive scheme uses fish stock size as the tax variable, and can be seen as an alternative to a control policy. Rough estimates from a simulation study suggest that the incentive scheme is potentially useful. The incentive scheme also has potential application as an instrument to the solution of by-catch and discard problems.