Bayesian linear prediction in finite populations

In this paper, Bayesian linear prediction of the total of a finite population is considered in situations where the observation error variance is parameter dependent. Connections with least squares prediction (Royall (1976, J. Amer. Statist. Assoc., 71, 657–664)) in mixed linear models (Theil (1971, Principles of Econometrics, Wiley, New York)), are established. Extensions to the case of dynamic (state dependent) superpopulation models are also proposed.     

On the convergence of cross decomposition

Cross decomposition is a recent method for mixed integer programming problems, exploiting simultaneously both the primal and the dual structure of the problem, thus combining the advantages of Dantzig—Wolfe decomposition and Benders decomposition. Finite convergence of the algorithm equipped with some simple convergence tests has been proved. Stronger convergence tests have been proposed, but not shown to yield finite convergence.In this paper cross decomposition is generalized and applied to linear programming problems, mixed integer programming problems and nonlinear programming problems (with and without linear parts). Using the stronger convergence tests finite exact convergence is shown in the first cases. Unbounded cases are discussed and also included in the convergence tests. The behaviour of the algorithm when parts of the constraint matrix are zero is also discussed. The cross decomposition procedure is generalized (by using generalized Benders decomposition) in order to enable the solution of nonlinear programming problems.     

On Linear Representations of Analytic Moufang Loops

Mathematical Notes -     

A Hybrid Approach to Scheduling with Earliness and Tardiness Costs

A hybrid technique using constraint programming and linear programming is applied to the problem of scheduling with earliness and tardiness costs. The linear model maintains a set of relaxed optimal start times which are used to guide the constraint programming search heuristic. In addition, the constraint programming problem model employs the strong constraint propagation techniques responsible for many of the advances in constraint programming for scheduling in the past few years. Empirical results validate our approach and show, in particular, that creating and solving a subproblem containing only the activities with direct impact on the cost function and then using this solution in the main search, significantly increases the number of problems that can be solved to optimality while significantly decreasing the search time.     

The Linear Rational Pseudospectral Method with Preassigned Poles

We present a linear rational pseudospectral (collocation) method with preassigned poles for solving boundary value problems. It consists in attaching poles to the trial polynomial so as to make it a rational interpolant. Its convergence is proved by transforming the problem into an associated boundary value problem. Numerical examples demonstrate that the rational pseudospectral method is often more efficient than the polynomial method.     

Robust Output Tracking Control of an Uncertain Linear System via a Modified Optimal Linear-Quadratic Method

This study investigates the robust output tracking problem for a class of uncertain linear systems. The uncertainties are assumed to be time invariant and to satisfy the matching conditions. According to the selected nominal parameters, an optimal solution with a prescribed degree of stability is determined. Then, an auxiliary input via the use of an adapting factor, connected to the nominal optimal control, is introduced to guarantee the robustness and prescribed degree of stability for the output tracking control of the uncertain linear systems. This method is very simple and effective and can reject bounded uncertainties imposed on the states. A maglev vehicle model example is given to show its effectiveness.     

Invariant Simultaneous Solutions of Evolution Equations of Integrable Hierarchies

We construct classical point symmetry groups for joint pairs of evolution equations (systems of equations) of integrable hierarchies related to the auxiliary equation of the method of the inverse problem of second order. For the two cases: the hierarchy of Korteweg--de Vries (KdV) equations and of the systems of Kaup equations, we construct simultaneous solutions invariant with respect to the symmetry group. The problem of the construction of these solutions can be reduced, respectively, to the first and second Painlevé equations depending on a parameter. The Painlevé equations are supplemented by the linear evolution equations defining the deformation of the solution of the corresponding Painlevé equation.     

On Oscillation Criteria of Fourth Order Linear Differential Equations

The paper deals with oscillation criteria of fourth order linear differential equations with quasi-derivatives.     

Optimal Operations Management and Network Planning of a District Heating System with a Combined Heat and Power Plant

District heating plants are becoming more common in European cities. These systems make it possible to furnish users with warm water while locating the production plants in the outskirts having the double benefit of lowering the impact of pollution on the center of the city and achieving better conversion performances. In order to amortize the costs throughout the year, the system often includes a combined heat and power (CHP) plant, to exploit the energy during the summer as well, when the demand for warm water decreases. A linear programming model for the optimal resource management of such a plant is presented and some results for a real case are reported. A distribution network design problem is also addressed and solved by means of mixed integer linear programming.     

Control of Stochastic Systems with Time-Varying Multiple Time Delays: LMI Approach

This paper deals with the class of continuous-time linear systems with Markovian jumps and multiple time delays. The systems that we are treating are assumed to have time-varying delays in their dynamics which can be different and also have uncertainties in the system parameters. The time-varying structure of the bounded uncertainties is considered. Delay-dependent conditions for stochastic stability and stochastic stabilizability and their robustness are considered. A design algorithm for a stabilizing memoryless controller is proposed. All the results are given in the LMI formalism.