Quantum Einstein’s equations and constraints algebra

In this paper we shall address this problem: Is quantum gravity constraints algebra closed and what are the quantum Einstein’s equations. We shall investigate this problem in the de-Broglie-Bohm quantum theory framework. It is shown that the constraint algebra is weakly closed and the quantum Einstein’s equations are derived.     

On the Number of Inner Iterations Per Outer Iteration of a Globally Convergent Algorithm for Optimization with General Nonlinear Inequality Constraints and Simple Bounds

This paper considers the number of inner iterations required per outeriteration for the algorithm proposed by Conn et al.[9]. We show that asymptotically, under suitable reasonable assumptions, a single inner iteration suffices.     

Representation of the Lagrange Multipliers for Optimal Control Problems Subject to Differential-Algebraic Equations of Index Two

Necessary conditions are derived for optimal control problems subject to index-2 differential-algebraic equations, pure state constraints, and mixed control-state constraints. Differential-algebraic equations are composite systems of differential equations and algebraic equations, which arise frequently in practical applications. The structure of the optimal control problem under consideration is exploited and special emphasis is laid on the representation of the Lagrange multipliers resulting from the necessary conditions for infinite optimization problems.The author thanks the referees for careful reading and helpful suggestions and comments.     

Stochastic Programming with Equilibrium Constraints

In this paper, we discuss here-and-now type stochastic programs with equilibrium constraints. We give a general formulation of such problems and study their basic properties such as measurability and continuity of the corresponding integrand functions. We discuss also the consistency and rate of convergence of sample average approximations of such stochastic problems     

Optimal production mix

This paper deals with a production plant in which two different products can be produced. The plant consists of three subsystemsS _i . Before or after a phase of separate processing in subsystemsS ₁ andS ₂, the two products have to be processed in subsystemS ₃. Each of these subsystems has a limited capacity.In the first part, we assume empty stocks at the beginning; at a fixed timeT in the future, certain quantitiesX _i of the two products have to be delivered to the customers. Facing linear holding costs, convex production costs, and stringent capacity constraints, the problem is to decide when to produce which product at what rate.It is shown that the optimal solution consists of up to six different regimes and that the time paths of the production rates need not be monotonic. These results, which can be obtained analytically, are also illustrated in several numerical examples.Finally, the case is considered where the terminal demand at timeT is replaced by a continuous and seasonally fluctuating demand rate. It is demonstrated that the optimal production rates show an interesting and nontrivial behavior. In particular, it may happen that, on intervals where the demand for the one product increases, the optimal production rate decreases. This is also demonstrated by computer plots in some numerical examples.The first author gratefully acknowledges support from the Austrian Science Foundation under Grant S3204 and the second author from Stiftung Volkswagenwerk. An earlier version of this paper was presented at the DGOR-NSOR Joint Conference, Eindhoven, Holland, September 23–25, 1987.     

Dynamic routing in open queueing networks: Brownian models,cut constraints and resource pooling

We present an introductory review of recent work on the control of open queueing networks. We assume that customers of different types arrive at a network and pass through the system via one of several possible routes; the set of routes available to a customer depends on its type. A route through the network is an ordered set of service stations: a customer queues for service at each station on its route and then leaves the system. The two methods of control we consider are the routing of customers through the network, and the sequencing of service at the stations, and our aim is to minimize the number of customers in the system. We concentrate especially on the insights which can be obtained from heavy traffic analysis, and in particular from Harrison's Brownian network models. Our main conclusion is that in many respects dynamic routingsimplifies the behaviour of networks, and that under good control policies it may well be possible to model the aggregate behaviour of a network quite straightforwardly.Supported by SERC grant GR/F 94194.     

The Equality Constrained Indefinite Least Squares Problem: Theory and Algorithms

We present theory and algorithms for the equality constrained indefinite least squares problem, which requires minimization of an indefinite quadratic form subject to a linear equality constraint. A generalized hyperbolic QR factorization is introduced and used in the derivation of perturbation bounds and to construct a numerical method. An alternative method is obtained by employing a generalized QR factorization in combination with a Cholesky factorization. Rounding error analysis is given to show that both methods have satisfactory numerical stability properties and numerical experiments are given for illustration. This work builds on recent work on the unconstrained indefinite least squares problem by Chandrasekaran, Gu, and Sayed and by the present authors.     

Necessary and sufficient optimality conditions for mathematical programs with equilibrium constraints

In this paper we consider a mathematical program with equilibrium constraints (MPEC) formulated as a mathematical program with complementarity constraints. Various stationary conditions for MPECs exist in literature due to different reformulations. We give a simple proof to the M-stationary condition and show that it is sufficient for global or local optimality under some MPEC generalized convexity assumptions. Moreover, we propose new constraint qualifications for M-stationary conditions to hold. These new constraint qualifications include piecewise MFCQ, piecewise Slater condition, MPEC weak reverse convex constraint qualification, MPEC Arrow-Hurwicz-Uzawa constraint qualification, MPEC Zangwill constraint qualification, MPEC Kuhn-Tucker constraint qualification, and MPEC Abadie constraint qualification.     

A Limited-Memory Multipoint Symmetric Secant Method for Bound Constrained Optimization

A new algorithm for solving smooth large-scale minimization problems with bound constraints is introduced. The way of dealing with active constraints is similar to the one used in some recently introduced quadratic solvers. A limited-memory multipoint symmetric secant method for approximating the Hessian is presented. Positive-definiteness of the Hessian approximation is not enforced. A combination of trust-region and conjugate-gradient approaches is used to explore useful information. Global convergence is proved for a general model algorithm. Results of numerical experiments are presented.     

Reflections on the Gauss Principle of Least Constraint

The Gauss principle of least constraint is derived from a new point of view. Then, an extended principle of least constraint is derived to cover the case of nonideal constraints. Finally, a version of the principle for general underdetermined systems is adumbrated. Throughout, the notion of generalized inverses of matices plays a prominent role.