本文对概率约束规划问题的稳定性进秆了探讨得出了当随机向量序列{（k）分布收敛于（w）时，相应于（k）（w）的概率约束规划问题的最优值收敛于原问题的最优值，这个结果为设计逼近算法和改进逼近解提供了一个理论基础。

In this paper we show how polynomial mappings of degree K from a union of disjoint intervals onto [−1, 1] generate a countable number of special cases of generalizations of Chebyshev polynomials. We also derive a new expression for these generalized Chebyshev polynomials for any genus g, from which the coefficients of xn can be found explicitly in terms of the branch points and the recurrence coefficients. We find that this representation is useful for specializing to polynomial mapping cases for small K where we will have explicit expressions for the recurrence coefficients in terms of the branch points. We study in detail certain special cases of the polynomials for small degree mappings and prove a theorem concerning the location of the zeroes of the polynomials. We also derive an explicit expression for the discriminant for the genus 1 case of our Chebyshev polynomials that is valid for any configuration of the branch point.

We obtain the rate of decay of the smallest eigenvalue of the Hankel matrices (∫tj+kW2(t) dt)n j,k=0 for a general class of even exponential weights W2=exp(−2Q) on an interval I. More precise asymptotics for more special weights have been obtained by many authors.

EOQ under date-terms supplier credit: a comment on a paper by Carlson and Rousseau.

This note is concerned with the inventory models with finite horizn and cost changes. We presented more specific on the optimal inventory policy than those in previous papers and showed that some of the resuts in Lev and Weiss' (1990) paper are not necessarily optimal.