Coordination of market decisions with other aspects of operations management such as production and inventory decisions has long been a meticulous research issue in supply chain management. Generally, changes to the original lot-sizing policy stimulated by market prices may impose remarkable deviation revenue throughout the supply and demand chain system. This paper examines how to set the chan...

In this paper, we study interchangeability in finite and discrete constraint satisfaction problems (CSPs). In many applications modeled as CSPs, it is important to be able to build on the spot equivalence classes of objects of the world to allow local modifications of the solutions and highlight opportunities for change. The concept of interchangeability, defined by Freuder [4], formalizes equi...

We study an n-player game with random payoffs and continuous strategy sets. The payoff function of each player is defined by its expected value the set a joint chance constraint. constraint vectors defining are dependent follow elliptically symmetric distributions. Archimedean copula used to capture dependence among vectors. propose reformulation player. Under mild assumptions on players’ funct...

5 Definability of Successor and Order 10 5.1 Degrees . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 11 5.2 Compactness . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 11 5.3 Finite-range Endomorphisms . . . . . . . . . . . . . . . . . . . . . . . . . 15 5.4 Petrus . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 17 ...

Design tasks in structural engineering have always involved the use of constraints to formulate design requirements. Most existing algorithms for constraint satisfaction require input consisting of binary constraints on variables that have discrete values. Such restrictions limit their use in structural engineering since typical structural design tasks involve discrete and numerical variables. ...

The amplitude-constrained capacity of a scalar Gaussian channel is shown to be achieved by a unique discrete random variable taking on a finite number of values. Necessary and sufficient conditions for the distribution of this random variable are obtained. These conditions permit determination of the random variable and capacity as a function of the constraint value. The capacity of the same Ga...

We present a distributed iterative improvement algorithm for solving coarse-grained distributed constraint satisfaction problems (DisCSPs). Our algorithm is inspired by the Distributed Breakout for coarse-grained DisCSPs where we introduce a constraint weight decay and a constraint weight learning mechanism in order to escape local optima. We also introduce some randomisation in order to give t...

This paper investigates the computational aspects of distributionally robust chance constrained optimization problems. In contrast to previous research that mainly focused on the linear case (with a few exceptions discussed in detail below), we consider the case where the constraints can be non-linear to the decision variable, and in particular to the uncertain parameters. This formulation is o...

This paper tackles linear programming problems with data uncertainty and applies it to an important inventory control problem. Each element of the constraint matrix is subject to uncertainty and is modeled as a random variable with a bounded support. The classical robust optimization approach to this problem yields a solution with guaranteed feasibility. As this approach tends to be too conserv...