Optimality conditions for infinite horizon control problems with state constraints

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

Transmission network expansion planning with security constraints

A mathematical model and a methodology to solve the transmission network expansion planning problem with security constraints are presented. The methodology allows one to find an optimal and reliable transmission network expansion plan using a DC model to represent the electrical network. The security (n-1) criterion is used. The model presented is solved using a genetic algorithm designed to solve the reliable expansion planning in an efficient way. The results obtained for several known systems from literature show the excellent performance of the proposed methodology. A comparative analysis of the results obtained with the proposed methodology is also presented.

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.

A nonlinear model for the long-term hydro-thermal generation scheduling problem over multiple areas with transmission constraints

This paper presents a nonlinear model with individual representation of plants for the centralized long-term hydrothermal scheduling problem over multiple areas. In addition to common aspects of long-term scheduling, this model takes transmission constraints into account. The ability to optimize hydropower exchange among multiple areas is important because it enables further minimization of complementary thermal generation costs. Also, by considering transmission constraints for long-term scheduling, a more precise coupling with shorter horizon schedules can be expected. This is an important characteristic from both operational and economic viewpoints. The proposed model is solved by a sequential quadratic programming approach in the form of a prototype system for different case studies. An analysis of the benefits provided by the model is also presented. ©2009 IEEE.

Particle creation in a f(R) theory with cosmological constraints

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

Reformulações e relaxação Lagrangiana para o problema de dimensionamento de lotes com várias plantas

Pós-graduação em Matemática - IBILCE

Reformulation and a Lagrangian heuristic for lot sizing problem on parallel machines

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

Modelos Matemáticos e Métodos de Solução para Problemas de Dimensionamento de Lotes

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

Safety in road crossing of children with cerebral palsy

Aim: Children with cerebral palsy (CP) are regularly confronted with physical constraints during locomotion. Because abnormalities in motor control are often related to perceptual deficits, the aim of this study was to find out whether children with CP were able to walk across a road as safely as their non-handicapped peers. Method: Ten children with CP and 10 non-handicapped children aged 4-14 y were asked to cross a simulated road if they felt the situation was safe. Results: With respect to safety and accuracy of crossings, the behaviour of children with CP was comparable with that of non-handicapped children. However, a closer examination of children's individual crossing behaviour showed considerable differences within the CP group. In contrast to children with damage to the left hemisphere, children with damage to the right hemisphere made unsafe decisions and did not compensate for them by increasing walking speed.Conclusion: the differences in unsafe behaviour and in the ability to compensate for it within the group of children with CP might be related to damage to specific regions of the brain that are involved in the processing of spatial or temporal information.

Extended Hierarchical Censored Production Rules (EHCPRs) system: An approach toward generalized knowledge representation

One common problem in all basic techniques of knowledge representation is the handling of the trade-off between precision of inferences and resource constraints, such as time and memory. Michalski and Winston (1986) suggested the Censored Production Rule (CPR) as an underlying representation and computational mechanism to enable logic based systems to exhibit variable precision in which certainty varies while specificity stays constant. As an extension of CPR, the Hierarchical Censored Production Rules (HCPRs) system of knowledge representation, proposed by Bharadwaj & Jain (1992), exhibits both variable certainty as well as variable specificity and offers mechanisms for handling the trade-off between the two. An HCPR has the form: Decision If(preconditions) Unless(censor) Generality(general_information) Specificity(specific_information). As an attempt towards evolving a generalized knowledge representation, an Extended Hierarchical Censored Production Rules (EHCPRs) system is suggested in this paper. With the inclusion of new operators, an Extended Hierarchical Censored Production Rule (EHCPR) takes the general form: Concept If (Preconditions) Unless (Exceptions) Generality (General-Concept) Specificity (Specific Concepts) Has_part (default: structural-parts) Has_property (default:characteristic-properties) Has_instance (instances). How semantic networks and frames are represented in terms of an EHCPRs is shown. Multiple inheritance, inheritance with and without cancellation, recognition with partial match, and a few default logic problems are shown to be tackled efficiently in the proposed system.

Transmission network expansion planning in full open market considering security constraints

This paper presents a mathematical model and a methodology to solve the transmission network expansion planning problem with security constraints in full competitive market, assuming that all generation programming plans present in the system operation are known. The methodology let us find an optimal transmission network expansion plan that allows the power system to operate adequately in each one of the generation programming plans specified in the full competitive market case, including a single contingency situation with generation rescheduling using the security (n-1) criterion. In this context, the centralized expansion planning with security constraints and the expansion planning in full competitive market are subsets of the proposal presented in this paper. The model provides a solution using a genetic algorithm designed to efficiently solve the reliable expansion planning in full competitive market. The results obtained for several known systems from the literature show the excellent performance of the proposed methodology.

A música como recurso didático-pedagógico na aula de língua inglesa da rede pública de ensino

Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES)

Utilização de um algoritmo de caminho mínimo no processo de recolhimento do palhiço da cana-de-açúcar

Pós-graduação em Agronomia (Energia na Agricultura) - FCA

Formulações fortes para o problema de dimensionamento de lotes com várias plantas

This paper considers the multi-plant lot sizing problem. Each item can be produced in any plant and it is possible to meet the demand of a particular plant with production from one (or several) other plants, in this case, incurs a transfer cost. The objective is todevelop strong formulations for this problem. Reformulations that based on the shortest path problem and facility location problem are investigated. Finally, some computational results are presented comparing all the proposed formulations.