On the solution of mathematical programming problems with equilibrium constraints

Mathematical programming problems with equilibrium constraints (MPEC) are nonlinear programming problems where the constraints have a form that is analogous to first-order optimality conditions of constrained optimization. We prove that, under reasonable sufficient conditions, stationary points of the sum of squares of the constraints are feasible points of the MPEC. In usual formulations of MPEC all the feasible points are nonregular in the sense that they do not satisfy the Mangasarian-Fromovitz constraint qualification of nonlinear programming. Therefore, all the feasible points satisfy the classical Fritz-John necessary optimality conditions. In principle, this can cause serious difficulties for nonlinear programming algorithms applied to MPEC. However, we show that most feasible points do not satisfy a recently introduced stronger optimality condition for nonlinear programming. This is the reason why, in general, nonlinear programming algorithms are successful when applied to MPEC.

Bound constrained smooth optimization for solving variational inequalities and related problems

Variational inequalities and related problems may be solved via smooth bound constrained optimization. A comprehensive discussion of the important features involved with this strategy is presented. Complementarity problems and mathematical programming problems with equilibrium constraints are included in this report. Numerical experiments are commented. Conclusions and directions of future research are indicated.

Reliability of timber bridges using nailed plywood box beams

The Nailed Box Beam structural efficiency is directly dependent of the flange-web joint behavior, which determines the partial composition of the section, as the displacement between elements reduces the effective rigidity of the section and changes the stress distribution and the total displacement of the section. This work discusses the use of Nailed Plywood Box Beams in small span timber bridges, focusing on the reliability of the beam element. It is presented the results of tests carried out in 21 full scale Nailed Plywood Box Beams. The analysis of maximum load tests results shows that it presents a normal distribution, permitting the characteristic values calculation as the normal distribution theory specifies. The reliability of those elements was analyzed focusing on a timber bridge design, to estimate the failure probability in function of the load level.

Free time and mixed constrained optimal control problems

We consider free time optimal control problems with pointwise set control constraints u(t) ∈ U(t). Here we derive necessary conditions of optimality for those problem where the set U(t) is defined by equality and inequality control constraints. The main ingredients of our analysis are a well known time transformation and recent results on necessary conditions for mixed state-control constraints. ©2010 IEEE.

Necessary conditions of optimality for state constrained infinite horizon differential inclusions

This article presents and discusses necessary conditions of optimality for infinite horizon dynamic optimization problems with inequality state constraints and set inclusion constraints at both endpoints of the trajectory. The cost functional depends on the state variable at the final time, and the dynamics are given by a differential inclusion. Moreover, the optimization is carried out over asymptotically convergent state trajectories. The novelty of the proposed optimality conditions for this class of problems is that the boundary condition of the adjoint variable is given as a weak directional inclusion at infinity. This improves on the currently available necessary conditions of optimality for infinite horizon problems. © 2011 IEEE.

A maximum principle for constrained infinite horizon dynamic control systems

This article presents and discusses a maximum principle for infinite horizon constrained optimal control problems with a cost functional depending on the state at the final time. The main feature of these optimality conditions is that, under reasonably weak assumptions, the multiplier is shown to satisfy a novel transversality condition at infinite time. It is also shown that these conditions can also be obtained for impulsive control problems whose dynamics are given by measure driven differential equations. © 2011 IFAC.

Optimal reactive power dispatch using stochastic chance-constrained programming

Deterministic Optimal Reactive Power Dispatch problem has been extensively studied, such that the demand power and the availability of shunt reactive power compensators are known and fixed. Give this background, a two-stage stochastic optimization model is first formulated under the presumption that the load demand can be modeled as specified random parameters. A second stochastic chance-constrained model is presented considering uncertainty on the demand and the equivalent availability of shunt reactive power compensators. Simulations on six-bus and 30-bus test systems are used to illustrate the validity and essential features of the proposed models. This simulations shows that the proposed models can prevent to the power system operator about of the deficit of reactive power in the power system and suggest that shunt reactive sourses must be dispatched against the unavailability of any reactive source. © 2012 IEEE.

Constrained intervals and interval spaces

Constrained intervals, intervals as a mapping from [0, 1] to polynomials of degree one (linear functions) with non-negative slopes, and arithmetic on constrained intervals generate a space that turns out to be a cancellative abelian monoid albeit with a richer set of properties than the usual (standard) space of interval arithmetic. This means that not only do we have the classical embedding as developed by H. Radström, S. Markov, and the extension of E. Kaucher but the properties of these polynomials. We study the geometry of the embedding of intervals into a quasilinear space and some of the properties of the mapping of constrained intervals into a space of polynomials. It is assumed that the reader is familiar with the basic notions of interval arithmetic and interval analysis. © 2013 Springer-Verlag Berlin Heidelberg.

Evaluation of reusable cardboard box designs: Biomechanical and perceptual aspects

Reusable cardboard boxes can be ergonomically designed for internal transportation of dry products in industrial settings. In this study we compared the effects of handling a regular commercial box and two cardboard prototypes on upper limb postures through the evaluation of movements, myoelectrical activity, perceived grip acceptability and capacity for reuse. The ergonomic designs provided a more acceptable grip, safer wrist and elbow movements and lower wrist extensors and biceps activity. Biomechanical disadvantages were observed only for one of the prototypes when handling to high surface. The prototypes were durable and suitable for extensive reuse (more than 2000 handlings) in internal industrial transportation. Despite being slightly more expensive than regular cardboard, the prototypes showed good cost-benefit considering their high durability. Relevance to industry: Cardboard boxes can be efficiently redesigned for allowing safer upper limb movements and lower muscle workload in manual materials handling. New designs can also be extensively reused for internal industrial transportation with good cost-benefit. © 2012 Elsevier B.V.

Previsão da velocidade dos ventos por redes neurais artificiais e arima de box & jenkins

Pós-graduação em Engenharia Elétrica - FEIS

microRNA156-targeted SPL/ SBP box transcription factors regulate tomato ovary and fruit development

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

Distribution and population structure of the flecked box crab Hepatus pudibundus (Decapoda, Brachyura) in the western South Atlantic

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

The bias in reversing the Box-Cox transformation in time series forecasting: An empirical study based on neural networks

The Box-Cox transformation is a technique mostly utilized to turn the probabilistic distribution of a time series data into approximately normal. And this helps statistical and neural models to perform more accurate forecastings. However, it introduces a bias when the reversion of the transformation is conducted with the predicted data. The statistical methods to perform a bias-free reversion require, necessarily, the assumption of Gaussianity of the transformed data distribution, which is a rare event in real-world time series. So, the aim of this study was to provide an effective method of removing the bias when the reversion of the Box-Cox transformation is executed. Thus, the developed method is based on a focused time lagged feedforward neural network, which does not require any assumption about the transformed data distribution. Therefore, to evaluate the performance of the proposed method, numerical simulations were conducted and the Mean Absolute Percentage Error, the Theil Inequality Index and the Signal-to-Noise ratio of 20-step-ahead forecasts of 40 time series were compared, and the results obtained indicate that the proposed reversion method is valid and justifies new studies. (C) 2014 Elsevier B.V. All rights reserved.

A mixed-integer quadratically-constrained programming model for the distribution system expansion planning

This paper presents a mixed-integer quadratically-constrained programming (MIQCP) model to solve the distribution system expansion planning (DSEP) problem. The DSEP model considers the construction/reinforcement of substations, the construction/reconductoring of circuits, the allocation of fixed capacitors banks and the radial topology modification. As the DSEP problem is a very complex mixed-integer non-linear programming problem, it is convenient to reformulate it like a MIQCP problem; it is demonstrated that the proposed formulation represents the steady-state operation of a radial distribution system. The proposed MIQCP model is a convex formulation, which allows to find the optimal solution using optimization solvers. Test systems of 23 and 54 nodes and one real distribution system of 136 nodes were used to show the efficiency of the proposed model in comparison with other DSEP models available in the specialized literature. (C) 2014 Elsevier Ltd. All rights reserved.

Involutive constrained systems and Hamilton-Jacobi formalism

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