131 resultados para Mixed Binary Linear Programming
Resumo:
Tailoring specified vibration modes is a requirement for designing piezoelectric devices aimed at dynamic-type applications. A technique for designing the shape of specified vibration modes is the topology optimization method (TOM) which finds an optimum material distribution inside a design domain to obtain a structure that vibrates according to specified eigenfrequencies and eigenmodes. Nevertheless, when the TOM is applied to dynamic problems, the well-known grayscale or intermediate material problem arises which can invalidate the post-processing of the optimal result. Thus, a more natural way for solving dynamic problems using TOM is to allow intermediate material values. This idea leads to the functionally graded material (FGM) concept. In fact, FGMs are materials whose properties and microstructure continuously change along a specific direction. Therefore, in this paper, an approach is presented for tailoring user-defined vibration modes, by applying the TOM and FGM concepts to design functionally graded piezoelectric transducers (FGPT) and non-piezoelectric structures (functionally graded structures-FGS) in order to achieve maximum and/or minimum vibration amplitudes at certain points of the structure, by simultaneously finding the topology and material gradation function. The optimization problem is solved by using sequential linear programming. Two-dimensional results are presented to illustrate the method.
Resumo:
This paper studies a simplified methodology to integrate the real time optimization (RTO) of a continuous system into the model predictive controller in the one layer strategy. The gradient of the economic objective function is included in the cost function of the controller. Optimal conditions of the process at steady state are searched through the use of a rigorous non-linear process model, while the trajectory to be followed is predicted with the use of a linear dynamic model, obtained through a plant step test. The main advantage of the proposed strategy is that the resulting control/optimization problem can still be solved with a quadratic programming routine at each sampling step. Simulation results show that the approach proposed may be comparable to the strategy that solves the full economic optimization problem inside the MPC controller where the resulting control problem becomes a non-linear programming problem with a much higher computer load. (C) 2010 Elsevier Ltd. All rights reserved.
Resumo:
The objective of this paper is to develop a mathematical model for the synthesis of anaerobic digester networks based on the optimization of a superstructure that relies on a non-linear programming formulation. The proposed model contains the kinetic and hydraulic equations developed by Pontes and Pinto [Chemical Engineering journal 122 (2006) 65-80] for two types of digesters, namely UASB (Upflow Anaerobic Sludge Blanket) and EGSB (Expanded Granular Sludge Bed) reactors. The objective function minimizes the overall sum of the reactor volumes. The optimization results show that a recycle stream is only effective in case of a reactor with short-circuit, such as the UASB reactor. Sensitivity analysis was performed in the one and two-digester network superstructures, for the following parameters: UASB reactor short-circuit fraction and the EGSB reactor maximum organic load, and the corresponding results vary considerably in terms of digester volumes. Scenarios for three and four-digester network superstructures were optimized and compared with the results from fewer digesters. (C) 2009 Elsevier B.V. All rights reserved.
Resumo:
Stability of matchings was proved to be a new cooperative equilibrium concept in Sotomayor (Dynamics and equilibrium: essays in honor to D. Gale, 1992). That paper introduces the innovation of treating as multi-dimensional the payoff of a player with a quota greater than one. This is done for the many-to-many matching model with additively separable utilities, for which the stability concept is defined. It is then proved, via linear programming, that the set of stable outcomes is nonempty and it may be strictly bigger than the set of dual solutions and strictly smaller than the core. The present paper defines a general concept of stability and shows that this concept is a natural solution concept, stronger than the core concept, for a much more general coalitional game than a matching game. Instead of mutual agreements inside partnerships, the players are allowed to make collective agreements inside coalitions of any size and to distribute his labor among them. A collective agreement determines the level of labor at which the coalition operates and the division, among its members, of the income generated by the coalition. An allocation specifies a set of collective agreements for each player.
Resumo:
Electrical impedance tomography is a technique to estimate the impedance distribution within a domain, based on measurements on its boundary. In other words, given the mathematical model of the domain, its geometry and boundary conditions, a nonlinear inverse problem of estimating the electric impedance distribution can be solved. Several impedance estimation algorithms have been proposed to solve this problem. In this paper, we present a three-dimensional algorithm, based on the topology optimization method, as an alternative. A sequence of linear programming problems, allowing for constraints, is solved utilizing this method. In each iteration, the finite element method provides the electric potential field within the model of the domain. An electrode model is also proposed (thus, increasing the accuracy of the finite element results). The algorithm is tested using numerically simulated data and also experimental data, and absolute resistivity values are obtained. These results, corresponding to phantoms with two different conductive materials, exhibit relatively well-defined boundaries between them, and show that this is a practical and potentially useful technique to be applied to monitor lung aeration, including the possibility of imaging a pneumothorax.
Resumo:
Objective: To analyse the effect of integrated orthodontic treatment, orthognathic surgery and orofacial myofunctional therapy on masseter muscle thickness in patients with class III dentofacial deformity three years after orthognathic surgery. Design: A longitudinal study was conducted on 13 patients with class III dentofacial deformities, denoted here as group P1 (before surgery) and group P3 (same patients 3 years to 3 years and 8 months after surgery). Fifteen individuals with no changes in facial morphology or dental occlusion were assigned to the control group (CG). Masseter muscle ultrasonography was performed in the resting and biting situations in the three groups. Data were analysed statistically by a mixed-effects linear model considering a level of significance of P < 0.05. Results: Significantly higher values (P < 0.01) of masseter muscle thickness (cm) were detected in group P3 (right rest: 0.82 +/- 0.16, left rest: 0.87 +/- 0.21, right bite: 1 +/- 0.22, left bite: 1.04 +/- 0.28) compared to group P1 (right rest: 0.63 +/- 0.19, left rest: 0.64 +/- 0.15, right bite: 0.87 +/- 0.16, left bite: 0.88 +/- 0.14). Between P3 and CG (right rest: 1.02 +/- 0.19, left rest: 1 +/- 0.19, right bite: 1.18 +/- 0.22, left bite: 1.16 +/- 0.22) there was a significant difference on the right side of the muscle (P < 0.05) in both situations and on the left side at rest. Conclusion: The proposed treatment resulted in improved masseter muscle thickness in patients with class III dentofacial deformity. (C) 2011 Elsevier Ltd. All rights reserved.
Resumo:
The constrained compartmentalized knapsack problem can be seen as an extension of the constrained knapsack problem. However, the items are grouped into different classes so that the overall knapsack has to be divided into compartments, and each compartment is loaded with items from the same class. Moreover, building a compartment incurs a fixed cost and a fixed loss of the capacity in the original knapsack, and the compartments are lower and upper bounded. The objective is to maximize the total value of the items loaded in the overall knapsack minus the cost of the compartments. This problem has been formulated as an integer non-linear program, and in this paper, we reformulate the non-linear model as an integer linear master problem with a large number of variables. Some heuristics based on the solution of the restricted master problem are investigated. A new and more compact integer linear model is also presented, which can be solved by a branch-and-bound commercial solver that found most of the optimal solutions for the constrained compartmentalized knapsack problem. On the other hand, heuristics provide good solutions with low computational effort. (C) 2011 Elsevier BM. All rights reserved.
Resumo:
In this article we propose a 0-1 optimization model to determine a crop rotation schedule for each plot in a cropping area. The rotations have the same duration in all the plots and the crops are selected to maximize plot occupation. The crops may have different production times and planting dates. The problem includes planting constraints for adjacent plots and also for sequences of crops in the rotations. Moreover, cultivating crops for green manuring and fallow periods are scheduled into each plot. As the model has, in general, a great number of constraints and variables, we propose a heuristics based on column generation. To evaluate the performance of the model and the method, computational experiments using real-world data were performed. The solutions obtained indicate that the method generates good results.
Resumo:
We consider an agricultural production problem, in which one must meet a known demand of crops while respecting ecologically-based production constraints. The problem is twofold: in order to meet the demand, one must determine the division of the available heterogeneous arable areas in plots and, for each plot, obtain an appropriate crop rotation schedule. Rotation plans must respect ecologically-based constraints such as the interdiction of certain crop successions, and the regular insertion of fallows and green manures. We propose a linear formulation for this problem, in which each variable is associated with a crop rotation schedule. The model may include a large number of variables and it is, therefore, solved by means of a column-generation approach. We also discuss some extensions to the model, in order to incorporate additional characteristics found in field conditions. A set of computational tests using instances based on real-world data confirms the efficacy of the proposed methodology. (C) 2009 Elsevier B.V. All rights reserved.
Resumo:
The aim of task scheduling is to minimize the makespan of applications, exploiting the best possible way to use shared resources. Applications have requirements which call for customized environments for their execution. One way to provide such environments is to use virtualization on demand. This paper presents two schedulers based on integer linear programming which schedule virtual machines (VMs) in grid resources and tasks on these VMs. The schedulers differ from previous work by the joint scheduling of tasks and VMs and by considering the impact of the available bandwidth on the quality of the schedule. Experiments show the efficacy of the schedulers in scenarios with different network configurations.
Resumo:
The focus of study in this paper is the class of packing problems. More specifically, it deals with the placement of a set of N circular items of unitary radius inside an object with the aim of minimizing its dimensions. Differently shaped containers are considered, namely circles, squares, rectangles, strips and triangles. By means of the resolution of non-linear equations systems through the Newton-Raphson method, the herein presented algorithm succeeds in improving the accuracy of previous results attained by continuous optimization approaches up to numerical machine precision. The computer implementation and the data sets are available at http://www.ime.usp.br/similar to egbirgin/packing/. (C) 2009 Elsevier Ltd, All rights reserved.
Resumo:
Given a fixed set of identical or different-sized circular items, the problem we deal with consists on finding the smallest object within which the items can be packed. Circular, triangular, squared, rectangular and also strip objects are considered. Moreover, 2D and 3D problems are treated. Twice-differentiable models for all these problems are presented. A strategy to reduce the complexity of evaluating the models is employed and, as a consequence, instances with a large number of items can be considered. Numerical experiments show the flexibility and reliability of the new unified approach. (C) 2007 Elsevier Ltd. All rights reserved.
Resumo:
The thermo-solvatochromism of 2,6-dibromo-4-[(E)-2-(1-methylpyridinium-4-yl)ethenyl] phenolate, MePMBr(2), has been studied in mixtures of water, W, with ionic liquids, ILs, in the temperature range of 10 to 60 degrees C, where feasible. The objectives of the study were to test the applicability of a recently introduced solvation model, and to assess the relative importance of solute-solvent solvophobic interactions. The ILs were 1-allyl-3-alkylimidazolium chlorides, where the alkyl groups are methyl, 1-butyl, and 1-hexyl, respectively. The equilibrium constants for the interaction of W and the ILs were calculated from density data; they were found to be linearly dependent on N(C), the number of carbon atoms of the alkyl group; van't Hoff equation (log K versus 1/T) applied satisfactorily. Plots of the empirical solvent polarities, E(T) (MePMBr(2)) in kcal mol(-1), versus the mole fraction of water in the binary mixture, chi(w), showed non-linear, i.e., non-ideal behavior. The dependence of E(T) (MePMBr(2)) on chi(w), has been conveniently quantified in terms of solvation by W, IL, and the ""complex"" solvent IL-W. The non-ideal behavior is due to preferential solvation by the IL and, more efficiently, by IL-W. The deviation from linearity increases as a function of increasing N(C) of the IL, and is stronger than that observed for solvation of MePMBr(2) by aqueous 1-propanol, a solvent whose lipophilicity is 12.8 to 52.1 times larger than those of the ILs investigated. The dependence on N(C) is attributed to solute-solvent solvophobic interactions, whose relative contribution to solvation are presumably greater than that in mixtures of water and 1-propanol.
Resumo:
This paper presents results on a verification test of a Direct Numerical Simulation code of mixed high-order of accuracy using the method of manufactured solutions (MMS). This test is based on the formulation of an analytical solution for the Navier-Stokes equations modified by the addition of a source term. The present numerical code was aimed at simulating the temporal evolution of instability waves in a plane Poiseuille flow. The governing equations were solved in a vorticity-velocity formulation for a two-dimensional incompressible flow. The code employed two different numerical schemes. One used mixed high-order compact and non-compact finite-differences from fourth-order to sixth-order of accuracy. The other scheme used spectral methods instead of finite-difference methods for the streamwise direction, which was periodic. In the present test, particular attention was paid to the boundary conditions of the physical problem of interest. Indeed, the verification procedure using MMS can be more demanding than the often used comparison with Linear Stability Theory. That is particularly because in the latter test no attention is paid to the nonlinear terms. For the present verification test, it was possible to manufacture an analytical solution that reproduced some aspects of an instability wave in a nonlinear stage. Although the results of the verification by MMS for this mixed-order numerical scheme had to be interpreted with care, the test was very useful as it gave confidence that the code was free of programming errors. Copyright (C) 2009 John Wiley & Sons, Ltd.
Resumo:
Surface pressure (pi)-molecular area (A) curves were used to characterize the packing of pseudo-ternary mixed Langmuir monolayers of egg phosphatidylcholine (EPC), 1,2-dioleoyl-3-trimethylammonium propane (DOTAP) and L-alpha-dioleoyl phosphatidylethanolamine (DOPE). This pseudo-ternary mixture EPC/DOPE/DOTAP has been successfully employed in liposome formulations designed for DNA non-viral vectors. Pseudo-binary mixtures were also studied as a control. Miscibility behavior was inferred from pi-A curves applying the additivity rule by calculating the excess free energy of mixture (Delta G(Exc)). The interaction between the lipids was also deduced from the surface compressional modulus (C(s)(-1)). The deviation from ideality shows dependence on the lipid polar head type and monolayer composition. For lower DOPE concentrations, the forces are predominantly attractive. However, if the monolayer is DOPE rich, the DOTAP presence disturbs the PE-PE intermolecular interaction and the net interaction is then repulsive. The ternary monolayer EPC/DOPE/DOTAP presented itself in two configurations, modulated by the DOPE content, in a similar behavior to the DOPE/DOTAP monolayers. These results contribute to the understanding of the lipid interactions and packing in self-assembled systems associated with the in vitro and in vivo stability of liposomes. (C) 2010 Elsevier B.V. All rights reserved.