Dynamic inventory and pricing policy in a capacitated stochastic inventory system with fixed ordering cost

We study a dynamic inventory and pricing optimization problem in a periodic review inventory system with setup cost and finite ordering capacity in each period. We show that the optimal inventory control is characterized by an (s,s^′,p) policy in four regions of the starting inventory level.     

Labeling bipartite permutation graphs with a condition at distance two

An L(p,q)-labeling of a graph G is an assignment f from vertices of G to the set of non-negative integers {0,1,…,λ} such that |f(u)−f(v)|≥p if u and v are adjacent, and |f(u)−f(v)|≥q if u and v are at distance 2 apart. The minimum value of λ for which G has L(p,q)-labeling is denoted by λ_p,q(G). The L(p,q)-labeling problem is related to the channel assignment problem for wireless networks.In this paper, we present a polynomial time algorithm for computing L(p,q)-labeling of a bipartite permutation graph G such that the largest label is at most (2p−1)+q(bc(G)−2), where bc(G) is the biclique number of G. Since λ_p,q(G)≥p+q(bc(G)−2) for any bipartite graph G, the upper bound is at most p−1 far from optimal.     

Convergence of SSOR methods for linear complementarity problems

In this paper, by applying the SSOR splitting, we propose two new iterative methods for solving the linear complementarity problem LCP (M,q). Convergence results for these two methods are presented when M is an H-matrix (and also an M-matrix). Finally, two numerical examples are given to show the efficiency of the presented methods.     

Iterative approximation of a zero of accretive operator in Banach space

This paper introduces an iteration scheme for viscosity approximation of a zero of accretive operator in a reflexive Banach space with weakly continuous duality mapping. A new iterative sequence is introduced and strong convergence of the algorithm {x_n} is proved. The results improve and extend the results of Su [Xiaolong Qin, Yongfu Su, Approximation of a zero point of accretive operator in Banach spaces, J. Math. Anal. Appl. 320 (2007) 415-424] and some others.     

Sloane's box stacking problem

Recently, Sloane suggested the following problem: We are given n boxes, labeled 1,2,…,n. For i=1,…,n, box i weighs (m-1)i grams (where m?2 is a fixed integer) and box i can support a total weight of i grams. What is the number of different ways to build a single stack of boxes in which no box will be squashed by the weight of the boxes above it? Prior to this generalized problem, Sloane and Sellers solved the case m=2. More recently, Andrews and Sellers solved the case m?3. In this note we give new and simple proofs of the results of Sloane and Sellers and of Andrews and Sellers, using a known connection with m-ary partitions.     

Darcy's law as long-time limit of adiabatic porous media flow

It is conjectured that Darcy's law governs the motion of compressible porous media flow in large time. This has been justified for one-dimensional isentropic flows. In this work, we show the conjecture is true for one-dimensional adiabatic flows with generic small smooth initial data.     

Precoloring extension on unit interval graphs

In the precoloring extension problem a graph is given with some of the vertices having preassigned colors and it has to be decided whether this coloring can be extended to a proper k-coloring of the graph. Answering an open question of Hujter and Tuza [Precoloring extension. III. Classes of perfect graphs, Combin. Probab. Comput. 5 (1) (1996) 35-56], we show that the precoloring extension problem is NP-complete on unit interval graphs.     

Complexity results on restricted instances of a paint shop problem for words

We study the following problem: an instance is a word with every letter occurring twice. A solution is a 2-coloring of its letters such that the two occurrences of every letter are colored with different colors. The goal is to minimize the number of color changes between adjacent letters.This is a special case of the paint shop problem for words, which was previously shown to be NP-complete. We show that this special case is also NP-complete and even APX-hard. Furthermore, derive lower bounds for this problem and discuss a transformation into matroid theory enabling us to solve some specific instances within polynomial time.     

On convergence of closed convex sets

In this paper we introduce a convergence concept for closed convex subsets of a finite-dimensional normed vector space. This convergence is called C-convergence. It is defined by appropriate notions of upper and lower limits. We compare this convergence with the well-known Painlevé-Kuratowski convergence and with scalar convergence. In fact, we show that a sequence (An)_n∈NC-converges to A if and only if the corresponding support functions converge pointwise, except at relative boundary points of the domain of the support function of A, to the support function of A.     

Estimates of the dilatation function of Beurling-Ahlfors extension

In this paper we estimate the dilatation function of the Beurling-Ahlfors extension in the most general case. By introducing ?h,m-function, we obtain an inequality which is sharp up to a constant.