Heterogeneity correction in the construction of optimized planning in radiotherapy using linear programming

Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)

Optimization Strategies Based on Sequential Quadratic Programming Applied for a Fermentation Process for Butanol Production

Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)

Optimality conditions for infinite horizon control problems with state constraints

Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)

Kinematics of a spacetime with an infinite cosmological constant

A solution of the sourceless Einstein's equation with an infinite value for the cosmological constant L is discussed by using Inonu-Wigner contractions of the de Sitter groups and spaces. When Lambda --> infinity, spacetime becomes a four-dimensional cone, dual to Minkowski space by a spacetime inversion. This inversion relates the four-cone vertex to the infinity of Minkowski space, and the four-cone infinity to the Minkowski light-cone. The non-relativistic limit c --> infinity. is further considered, the kinematical group in this case being a modified Galilei group in which the space and time translations are replaced by the non-relativistic limits of the corresponding proper conformal transformations. This group presents the same abstract Lie algebra as the Galilei group and can be named the conformal Galilei group. The results may be of interest to the early Universe Cosmology.

Infinite symmetries in the Skyrme model

We show that the Skyrme theory possesses a submodel with an infinite number of local conserved currents. The constraints leading to the submodel explore a decomposition of SU(2) with a complex field parametrizing the symmetric space SU(2)/U(1) and a real field in the direction of U(1). We demonstrate that the Skyrmions of topological charges ii belong to such integrable sector of the theory. Our results open ways to the development of exact methods, compensating for the non-existence of a BPS type sector in the Skyrme theory. (C) 2001 Published by Elsevier B.V. B.V.

Stability results for impulsive functional differential equations with infinite delay

Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)

Design and management optimization of trickle irrigation systems using non-linear programming

A non-linear model is presented which optimizes the lay-out, as well as the design and management of trickle irrigation systems, to achieve maximum net benefit. The model consists of an objective function that maximizes profit at the farm level, subject to appropriate geometric and hydraulic constraints. It can be applied to rectangular shaped fields, with uniform or zero slope. The software used is the Gams-Minos package. The basic inputs are the crop-water-production function, the cost function and cost of system components, and design variables. The main outputs are the annual net benefit and pipe diameters and lengths. To illustrate the capability of the model, a sensitivity analysis of the annual net benefit for a citrus field is evaluated with respect to irrigated area, ground slope, micro-sprinkler discharge and shape of the field. The sensitivity analysis suggests that the greatest benefit is obtained with the smallest microsprinkler discharge, the greatest area, a square field and zero ground slope. The costs of the investment and energy are the components of the objective function that had the greatest effect in the 120 situations evaluated. (C) 1996 Academic Press Limited

Discrete approximations for strict convex continuous time problems and duality

Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq)

Efficient linear programming algorithm for the transmission network expansion planning problem

The transmission network planning problem is a non-linear integer mixed programming problem (NLIMP). Most of the algorithms used to solve this problem use a linear programming subroutine (LP) to solve LP problems resulting from planning algorithms. Sometimes the resolution of these LPs represents a major computational effort. The particularity of these LPs in the optimal solution is that only some inequality constraints are binding. This task transforms the LP into an equivalent problem with only one equality constraint (the power flow equation) and many inequality constraints, and uses a dual simplex algorithm and a relaxation strategy to solve the LPs. The optimisation process is started with only one equality constraint and, in each step, the most unfeasible constraint is added. The logic used is similar to a proposal for electric systems operation planning. The results show a higher performance of the algorithm when compared to primal simplex methods.

Comparative studies on non-convex optimization methods for transmission network expansion planning

We have investigated and extensively tested three families of non-convex optimization approaches for solving the transmission network expansion planning problem: simulated annealing (SA), genetic algorithms (GA), and tabu search algorithms (TS). The paper compares the main features of the three approaches and presents an integrated view of these methodologies. A hybrid approach is then proposed which presents performances which are far better than the ones obtained with any of these approaches individually. Results obtained in tests performed with large scale real-life networks are summarized.

Aggregation-based decomposition for multi-divisional models

The aggregation theory of mathematical programming is used to study decentralization in convex programming models. A two-level organization is considered and a aggregation-disaggregation scheme is applied to such a divisionally organized enterprise. In contrast to the known aggregation techniques, where the decision variables/production planes are aggregated, it is proposed to aggregate resources allocated by the central planning department among the divisions. This approach results in a decomposition procedure, in which the central unit has no optimization problem to solve and should only average local information provided by the divisions.

Robust state-derivative feedback LMI-based designs for multivariable linear systems

In some practical problems, for instance in the control systems for the suppression of vibration in mechanical systems, the state-derivative signals are easier to obtain than the state signals. New necessary and sufficient linear matrix inequalities (LMI) conditions for the design of state-derivative feedback for multi-input (MI) linear systems are proposed. For multi-input/multi-output (MIMO) linear time-invariant or time-varying plants, with or without uncertainties in their parameters, the proposed methods can include in the LMI-based control designs the specifications of the decay rate, bounds on the output peak, and bounds on the state-derivative feedback matrix K. These design procedures allow new specifications and also, they consider a broader class of plants than the related results available in the literature. The LMIs, when feasible, can be efficiently solved using convex programming techniques. Practical applications illustrate the efficiency of the proposed methods.

On a regular convex solver potential for an elastic-damage constitutive model: a theoretical analysis

This work is related with the proposition of a so-called regular or convex solver potential to be used in numerical simulations involving a certain class of constitutive elastic-damage models. All the mathematical aspects involved are based on convex analysis, which is employed aiming a consistent variational formulation of the potential and its conjugate one. It is shown that the constitutive relations for the class of damage models here considered can be derived from the solver potentials by means of sub-differentials sets. The optimality conditions of the resulting minimisation problem represent in particular a linear complementarity problem. Finally, a simple example is present in order to illustrate the possible integration errors that can be generated when finite step analysis is performed. (C) 2003 Elsevier Ltd. All rights reserved.

On the existence of infinite heteroclinic cycles in polynomial systems and its dynamic consequences

In this work we consider the dynamic consequences of the existence of infinite heteroclinic cycle in planar polynomial vector fields, which is a trajectory connecting two saddle points at infinity. It is stated that, although the saddles which form the cycle belong to infinity, for certain types of nonautonomous perturbations the perturbed system may present a complex dynamic behavior of the solutions in a finite part of the phase plane, due to the existence of tangencies and transversal intersections of their stable and unstable manifolds. This phenomenon might be called the chaos arising from infinity. The global study at infinity is made via the Poincare Compactification and the argument used to prove the statement is the Birkhoff-Smale Theorem. (c) 2004 WILEY-NCH Verlag GmbH & Co. KGaA, Weinheim.