The extended Betz–Lanchester limit

A proposal for an extended formulation of the power coefficient of a wind turbine is presented. This new formulation is a generalization of the Betz–Lanchester expression for the power coefficient as function of the axial deceleration of the wind speed provoked by the wind turbine in operation. The extended power coefficient takes into account the benefits of the power produced and the cost associated to the production of this energy. By the simple model proposed is evidenced that the purely energetic optimum operation condition giving rise to the Betz–Lanchester limit (maximum energy produced) does not coincide with the global optimum operational condition (maximum benefit generated) if cost of energy and degradation of the wind turbine during operation is considered. The new extended power coefficient is a general parameter useful to define global optimum operation conditions for wind turbines, considering not only the energy production but also the maintenance cost and the economic cost associated to the life reduction of the machine.

Extended formulations, nonnegative factorizations, and randomized communication protocols

An extended formulation of a polyhedron P is a linear description of a polyhedron Q together with a linear map π such that π(Q)=P. These objects are of fundamental importance in polyhedral combinatorics and optimization theory, and the subject of a number of studies. Yannakakis’ factorization theorem (Yannakakis in J Comput Syst Sci 43(3):441–466, 1991) provides a surprising connection between extended formulations and communication complexity, showing that the smallest size of an extended formulation of $$P$$P equals the nonnegative rank of its slack matrix S. Moreover, Yannakakis also shows that the nonnegative rank of S is at most 2^c, where c is the complexity of any deterministic protocol computing S. In this paper, we show that the latter result can be strengthened when we allow protocols to be randomized. In particular, we prove that the base-2 logarithm of the nonnegative rank of any nonnegative matrix equals the minimum complexity of a randomized communication protocol computing the matrix in expectation. Using Yannakakis’ factorization theorem, this implies that the base-2 logarithm of the smallest size of an extended formulation of a polytope P equals the minimum complexity of a randomized communication protocol computing the slack matrix of P in expectation. We show that allowing randomization in the protocol can be crucial for obtaining small extended formulations. Specifically, we prove that for the spanning tree and perfect matching polytopes, small variance in the protocol forces large size in the extended formulation.

Finite element analysis of anisotropic optical waveguide with arbitrary index profile

This work presents the application of a scalar finite element formulation for Ex (TE-like) modes in anisotropic planar and channel waveguides with diagonal permittivity tensor, diffused in both transversal directions. This extended formulation considers explicitly both the variations of the refractive index and their spatial derivates inside of each finite element. Dispersion curves for Ex modes in planar and channel waveguides are shown, and the results compared with solutions obtained by other formulations.

On the role of boundary terms in the AdS/CFT correspondence

We consider a scalar field theory on AdS, and show that the usual AdS/CFT prescription is unable to map to the boundary a part of the information arising from the quantization in the bulk. We propose a solution to this problem by defining the energy of the theory in the bulk through the Noether current corresponding to time displacements, and, in addition, by introducing a proper generalized AdS/CFT prescription. We also show how this extended formulation could be used to consistently describe double-trace interactions in the boundary. The formalism is illustrated by focusing on the non-minimally coupled case using Dirichlet boundary conditions. © 2004 Published by Elsevier B.V.

Reformulação para um problema integrado de dimensionamento e sequenciamento de lotes

In this paper, some new constraints and an extended formulation are presented for a Lot Sizing and Scheduling Model proposed in the literature. In the production process considered a key material is prepared and is transformed into different final items. The sequencing decisions are related to the order in which the materials are processed and the lot sizing decisions are related to the final items production. The mathematical formulation considers sequence-dependent setup costs and times. Results of the computational tests executed using the software Cplex 10.0 showed that the performance of the branch-and-cut method can be improved by the proposed a priori reformulation.

Enhanced Mixed Integer Programming Techniques and Routing Problems

Mixed integer programming is up today one of the most widely used techniques for dealing with hard optimization problems. On the one side, many practical optimization problems arising from real-world applications (such as, e.g., scheduling, project planning, transportation, telecommunications, economics and finance, timetabling, etc) can be easily and effectively formulated as Mixed Integer linear Programs (MIPs). On the other hand, 50 and more years of intensive research has dramatically improved on the capability of the current generation of MIP solvers to tackle hard problems in practice. However, many questions are still open and not fully understood, and the mixed integer programming community is still more than active in trying to answer some of these questions. As a consequence, a huge number of papers are continuously developed and new intriguing questions arise every year. When dealing with MIPs, we have to distinguish between two different scenarios. The first one happens when we are asked to handle a general MIP and we cannot assume any special structure for the given problem. In this case, a Linear Programming (LP) relaxation and some integrality requirements are all we have for tackling the problem, and we are ``forced" to use some general purpose techniques. The second one happens when mixed integer programming is used to address a somehow structured problem. In this context, polyhedral analysis and other theoretical and practical considerations are typically exploited to devise some special purpose techniques. This thesis tries to give some insights in both the above mentioned situations. The first part of the work is focused on general purpose cutting planes, which are probably the key ingredient behind the success of the current generation of MIP solvers. Chapter 1 presents a quick overview of the main ingredients of a branch-and-cut algorithm, while Chapter 2 recalls some results from the literature in the context of disjunctive cuts and their connections with Gomory mixed integer cuts. Chapter 3 presents a theoretical and computational investigation of disjunctive cuts. In particular, we analyze the connections between different normalization conditions (i.e., conditions to truncate the cone associated with disjunctive cutting planes) and other crucial aspects as cut rank, cut density and cut strength. We give a theoretical characterization of weak rays of the disjunctive cone that lead to dominated cuts, and propose a practical method to possibly strengthen those cuts arising from such weak extremal solution. Further, we point out how redundant constraints can affect the quality of the generated disjunctive cuts, and discuss possible ways to cope with them. Finally, Chapter 4 presents some preliminary ideas in the context of multiple-row cuts. Very recently, a series of papers have brought the attention to the possibility of generating cuts using more than one row of the simplex tableau at a time. Several interesting theoretical results have been presented in this direction, often revisiting and recalling other important results discovered more than 40 years ago. However, is not clear at all how these results can be exploited in practice. As stated, the chapter is a still work-in-progress and simply presents a possible way for generating two-row cuts from the simplex tableau arising from lattice-free triangles and some preliminary computational results. The second part of the thesis is instead focused on the heuristic and exact exploitation of integer programming techniques for hard combinatorial optimization problems in the context of routing applications. Chapters 5 and 6 present an integer linear programming local search algorithm for Vehicle Routing Problems (VRPs). The overall procedure follows a general destroy-and-repair paradigm (i.e., the current solution is first randomly destroyed and then repaired in the attempt of finding a new improved solution) where a class of exponential neighborhoods are iteratively explored by heuristically solving an integer programming formulation through a general purpose MIP solver. Chapters 7 and 8 deal with exact branch-and-cut methods. Chapter 7 presents an extended formulation for the Traveling Salesman Problem with Time Windows (TSPTW), a generalization of the well known TSP where each node must be visited within a given time window. The polyhedral approaches proposed for this problem in the literature typically follow the one which has been proven to be extremely effective in the classical TSP context. Here we present an overall (quite) general idea which is based on a relaxed discretization of time windows. Such an idea leads to a stronger formulation and to stronger valid inequalities which are then separated within the classical branch-and-cut framework. Finally, Chapter 8 addresses the branch-and-cut in the context of Generalized Minimum Spanning Tree Problems (GMSTPs) (i.e., a class of NP-hard generalizations of the classical minimum spanning tree problem). In this chapter, we show how some basic ideas (and, in particular, the usage of general purpose cutting planes) can be useful to improve on branch-and-cut methods proposed in the literature.

Source terms for calculations of vaporizing and burning fuel sprays with non-unity Lewis numbers in gases with temperature-dependent thermal conductivities

Liquid-fueled burners are used in a number of propulsion devices ranging from internal combustion engines to gas turbines. The structure of spray flames is quite complex and involves a wide range of time and spatial scales in both premixed and non-premixed modes (Williams 1965; Luo et al. 2011). A number of spray-combustion regimes can be observed experimentally in canonical scenarios of practical relevance such as counterflow diffusion flames (Li 1997), as sketched in figure 1, and for which different microscalemodelling strategies are needed. In this study, source terms for the conservation equations are calculated for heating, vaporizing and burning sprays in the single-droplet combustion regime. The present analysis provides extended formulation for source terms, which include non-unity Lewis numbers and variable thermal conductivities.

Mathematical Programming Models for Influence Maximization on Social Networks

In this dissertation, we apply mathematical programming techniques (i.e., integer programming and polyhedral combinatorics) to develop exact approaches for influence maximization on social networks. We study four combinatorial optimization problems that deal with maximizing influence at minimum cost over a social network. To our knowl- edge, all previous work to date involving influence maximization problems has focused on heuristics and approximation. We start with the following viral marketing problem that has attracted a significant amount of interest from the computer science literature. Given a social network, find a target set of customers to seed with a product. Then, a cascade will be caused by these initial adopters and other people start to adopt this product due to the influence they re- ceive from earlier adopters. The idea is to find the minimum cost that results in the entire network adopting the product. We first study a problem called the Weighted Target Set Selection (WTSS) Prob- lem. In the WTSS problem, the diffusion can take place over as many time periods as needed and a free product is given out to the individuals in the target set. Restricting the number of time periods that the diffusion takes place over to be one, we obtain a problem called the Positive Influence Dominating Set (PIDS) problem. Next, incorporating partial incentives, we consider a problem called the Least Cost Influence Problem (LCIP). The fourth problem studied is the One Time Period Least Cost Influence Problem (1TPLCIP) which is identical to the LCIP except that we restrict the number of time periods that the diffusion takes place over to be one. We apply a common research paradigm to each of these four problems. First, we work on special graphs: trees and cycles. Based on the insights we obtain from special graphs, we develop efficient methods for general graphs. On trees, first, we propose a polynomial time algorithm. More importantly, we present a tight and compact extended formulation. We also project the extended formulation onto the space of the natural vari- ables that gives the polytope on trees. Next, building upon the result for trees---we derive the polytope on cycles for the WTSS problem; as well as a polynomial time algorithm on cycles. This leads to our contribution on general graphs. For the WTSS problem and the LCIP, using the observation that the influence propagation network must be a directed acyclic graph (DAG), the strong formulation for trees can be embedded into a formulation on general graphs. We use this to design and implement a branch-and-cut approach for the WTSS problem and the LCIP. In our computational study, we are able to obtain high quality solutions for random graph instances with up to 10,000 nodes and 20,000 edges (40,000 arcs) within a reasonable amount of time.

An extended BEM formulation for plates reinforced by rectangular beams

This article presents a BEM formulation developed particularly for analysis of plates reinforced by rectangular beams. This is an extended version of a Previous paper that only took into account bending effects. The problem is now re-formulated to consider bending and membrane force effects. The effects of the reinforcements are taken into account by using a simplified scheme that requires application of ail initial stress field to locally correct the bending and stretching stiffness of the reinforcement regions. The domain integrals due to the presence of the reinforcements are then transformed to the reinforcement/plate interface. To reduce the number of degrees of freedom related to the presence of the reinforcement, the proposed model was simplified to consider only bending and stretching rigidities in the direction of the beams. The complete model can be recovered by applying all six internal force correctors, corresponding to six degrees of freedom per node. Examples are presented to confirm the accuracy of the formulation and to illustrate the level of simplification introduced by this strong reduction in the number of degrees of freedom. (C) 2008 Elsevier Ltd. All rights reserved.

Extended Fault-Location Formulation for Power Distribution Systems

In this paper, an extended impedance-based fault-location formulation for generalized distribution systems is presented. The majority of distribution feeders are characterized by having several laterals, nonsymmetrical lines, highly unbalanced operation, and time-varying loads. These characteristics compromise traditional fault-location methods performance. The proposed method uses only local voltages and currents as input data. The current load profile is obtained through these measurements. The formulation considers load variation effects and different fault types. Results are obtained from numerical simulations by using a real distribution system from the Electrical Energy Distribution State Company of Rio Grande do Sul (CEEE-D), Southern Brazil. Comparative results show the technique robustness with respect to fault type and traditional fault-location problems, such as fault distance, resistance, inception angle, and load variation. The formulation was implemented as embedded software and is currently used at CEEE-D`s distribution operation center.

Formulation and Implementation of Air Quality Control Pogrammes : Patterns of Interest Consideration

This article investigates some central aspects of the relationships between programme structure and implementation of sulphur dioxide air quality control policies. Previous implementation research, primarily adopting American approaches, has neglected the connections between the processes of programme formulation and implementation. 'Programme', as the key variable in implementation studies, has been defined too narrowly. On the basis of theoretical and conceptual reflections and provisional empirical results from studies in France, Italy, England, and the Federal Republic of Germany, the authors demonstrate that an integral process analysis using a more extended programme concept is necessary if patterns of interest recognition in policies are to be discovered. Otherwise, the still important question of critical social science cannot be answered, namely, what is the impact of special interests upon implementation processes.

Analysis of the Coupled Stretching-Bending Problem of Stiffened Plates by a BEM Formulation Based on Reissner's Hypothesis

In this work, the plate bending formulation of the boundary element method - BEM, based on the Reissner's hypothesis, is extended to the analysis of plates reinforced by beams taking into account the membrane effects. The formulation is derived by assuming a zoned body where each sub-region defines a beam or a slab and all of them are represented by a chosen reference surface. Equilibrium and compatibility conditions are automatically imposed by the integral equations, which treat this composed structure as a single body. In order to reduce the number of degrees of freedom, the problem values defined on the interfaces are written in terms of their values on the beam axis. Initially are derived separated equations for the bending and stretching problems, but in the final system of equations the two problems are coupled and can not be treated separately. Finally are presented some numerical examples whose analytical results are known to show the accuracy of the proposed model.

Linear analysis of building floor structures by a BEM formulation based on Reissner's theory

In this work, the plate bending formulation of the boundary element method (BEM) based on the Reissner's hypothesis is extended to the analysis of zoned plates in order to model a building floor structure. In the proposed formulation each sub-region defines a beam or a slab and depending on the way the sub-regions are represented, one can have two different types of analysis. In the simple bending problem all sub-regions are defined by their middle surface. on the other hand, for the coupled stretching-bending problem all sub-regions are referred to a chosen reference surface, therefore eccentricity effects are taken into account. Equilibrium and compatibility conditions are automatically imposed by the integral equations, which treat this composed structure as a single body. The bending and stretching values defined on the interfaces are approximated along the beam width, reducing therefore the number of degrees of freedom. Then, in the proposed model the set of equations is written in terms of the problem values on the beam axis and on the external boundary without beams. Finally some numerical examples are presented to show the accuracy of the proposed model.

A BEM formulation based on Reissner's theory to perform simple bending analysis of plates reinforced by rectangular beams

In this work, the plate bending formulation of the boundary element method (BEM), based on the Reissner's hypothesis, is extended to the analysis of plates reinforced by rectangular beams. This composed structure is modelled by a zoned plate, being the beams represented by narrow sub-regions with larger thickness. The integral equations are derived by applying the weighted residual method to each sub-region, and summing them to get the equation for the whole plate. Equilibrium and compatibility conditions are automatically imposed by the integral equations, which treat this composed structure as a single body. In order to decrease the number of degrees of freedom, some approximations are considered for both displacements and tractions along the beam width. The accuracy of the proposed model is illustrated by simple examples whose exact solution are known as well as by more complex examples whose numerical results are compared with a well-known finite element code.

A BOUNDARY ELEMENT FORMULATION FOR MASONRY WALLS: NON-LINEAR ANALYSIS

In this work, a non-linear Boundary Element Method (BEM) formulation with damage model is extended for numerical simulation of structural masonry walls in 2D stress analysis. The formulation is reoriented to analyse structural masonry, the component materials of which, clay bricks and mortar, are considered as damaged materials. Also considered are the internal variables and cell discretization of the domain. A damage model is used to represent the material behaviour and the domain discretization is also proposed and discussed. The paper presents the numerical parameters of the damage model for the material properties of the masonry components, clay bricks and mortar. Some examples are shown to validate the formulation.