A closed-form representation of mixed-integer program value functions

We identify a class of formulas computable in polynomial time such that the functions defined by these formulas are precisely the value functions of mixed-integer programs with rational constraint coefficients.     

Positive value of information in games

We exhibit a general class of interactive decision situations in which all the agents benefit from more information. This class includes as a special case the classical comparison of statistical experiments à la Blackwell. AMS 2000 Subject Classification:Primary 91A35.The work of Bruno Bassan and Marco Scarsini was partially supported by MIUR-COFIN. The authors express their thanks to Sylvain Sorin for enlightening comments.     

Perfect information two-person zero-sum markov games with imprecise transition probabilities

Based on an extension of the controlled Markov set-chain model by Kurano et al. (in J Appl Prob 35:293–302, 1998) into competitive two-player game setting, we provide a model of perfect information two-person zero-sum Markov games with imprecise transition probabilities. We define an equilibrium value for the games formulated with the model in terms of a partial order and then establish the existence of an equilibrium policy pair that achieves the equilibrium value. We further analyze finite-approximation error bounds obtained from a value iteration-type algorithm and discuss some applications of the model.     

A Family of Fifth-Order Runge-Kutta Pairs

The construction of a Runge-Kutta pair of order with the minimal number of stages requires the solution of a nonlinear system of order conditions in unknowns. We define a new family of pairs which includes pairs using function evaluations per integration step as well as pairs which additionally use the first function evaluation from the next step. This is achieved by making use of Kutta's simplifying assumption on the original system of the order conditions, i.e., that all the internal nodes of a method contributing to the estimation of the endpoint solution provide, at these nodes, cost-free second-order approximations to the true solution of any differential equation. In both cases the solution of the resulting system of nonlinear equations is completely classified and described in terms of five free parameters. Optimal Runge-Kutta pairs with respect to minimized truncation error coefficients, maximal phase-lag order and various stability characteristics are presented. These pairs were selected under the assumption that they are used in Local Extrapolation Mode (the propagated solution of a problem is the one provided by the fifth-order formula of the pair). Numerical results obtained by testing the new pairs over a standard set of test problems suggest a significant improvement in efficiency when using a specific pair of the new family with minimized truncation error coefficients, instead of some other existing pairs.

     

Uniform Rice-like CdS Particles Prepared from Water-in-oil Microemulsions

IntroductionNano-sized semiconductors are of great interestdue to their special optical and electronic proper-ties[1,2].As one of the mostimportantⅡ—Ⅵsemicon-ductors,CdS has importantapplications in many fields,such as the solar cell field,non linear o…     

Marginal filtering in large state spaces

Recognising everyday activities including information about the context requires to handle large state spaces. The usage of wearable sensors like six degree of freedom accelerometers increases complexity even more. Common approaches are unable to maintain an accurate belief state within such complex domains. We show how marginal filtering can overcome limitations of standard particle filtering and efficiently infer the context of actions. Symbolic models of human behaviour are used to recognise activities in two different settings with different state space sizes. Based on these scenarios we compare the marginal filter to the standard particle filter. An evaluation shows that the marginal filter performs comparably in small state spaces but outperforms the particle filter in large state spaces.     

区间合成模糊对策

给出了一种新的合成模糊对策模型——区间合成模糊对策,研究了区间合成模糊对策的区间稳定集、区间核心、区间Shapley值、区间Banzhaf-Coleman势指标以及与子区间模糊对策的关系。区间合成模糊对策作为一种特殊的模糊数合成模糊对策,对于研究其它具有模糊数的模糊合成对策有一定的参考价值。     

Finite dimensional approximation in infinite dimensional mathematical programming

We consider the problem of approximating an optimal solution to a separable, doubly infinite mathematical program (P) with lower staircase structure by solutions to the programs (P(N)) obtained by truncating after the firstN variables andN constraints of (P). Viewing the surplus vector variable associated with theNth constraint as a state, and assuming that all feasible states are eventually reachable from any feasible state, we show that the efficient set of all solutions optimal to all possible feasible surplus states for (P(N)) converges to the set of optimal solutions to (P). A tie-breaking algorithm which selects a nearest-point efficient solution for (P(N)) is shown (for convex programs) to converge to an optimal solution to (P). A stopping rule is provided for discovering a value ofN sufficiently large to guarantee any prespecified level of accuracy. The theory is illustrated by an application to production planning.The work of Robert L. Smith was partially supported by the National Science Foundation under Grant ECS-8700836.     

The design of robust value-creating supply chain networks: A critical review

This paper discusses Supply Chain Network (SCN) design problem under uncertainty, and presents a critical review of the optimization models proposed in the literature. Some drawbacks and missing aspects in the literature are pointed out, thus motivating the development of a comprehensive SCN design methodology. Through an analysis of supply chains uncertainty sources and risk exposures, the paper reviews key random environmental factors and discusses the nature of major disruptive events threatening SCN. It also discusses relevant strategic SCN design evaluation criteria, and it reviews their use in existing models. We argue for the assessment of SCN robustness as a necessary condition to ensure sustainable value creation. Several definitions of robustness, responsiveness and resilience are reviewed, and the importance of these concepts for SCN design is discussed. This paper contributes to framing the foundations for a robust SCN design methodology.