Integer Variables
Mostrando 25-33 de 33 artigos, teses e dissertações.
-
25. Otimização do posicionamento de componentes no layout de plantas quimicas
The adequate development of the layout of a chemical plant is very important because of economic, operational and safety reasons. The overall optimization of the plant must inc1ude the optimization of the placement of the components and the length and distribution of the pipes, satisfying safety constraints. The objective of this work was the development of
Publicado em: 2001
-
26. Otimização do transporte em oleodutos utilizando algoritmos geneticos e programação linear
This work treats the problem of petroleum transport, extracted from wells and stocked in containers, in order to achieve preprocessing plant. The purpose of this plant is take out the water and salt mixed within the oil, and after send the petroleum treated to refineries which produce derivative products. The goal of present work is to warranty a constant fl
Publicado em: 1999
-
27. Otimização da operação de sistemas de distribuição de agua abastecidos por bombeamento e reservatorios de regularização
In the present work it was developed an optimization model to water distribution systems operation, supplied by multiple pump stations and multiple reservoirs regulation. The difficulties to reach an appropriate modelling and the excessive simplification of the models have been delaying the appearance of practical solutions more adapted to dimensioning and o
Publicado em: 1999
-
28. ALGORITHM RELAX-AND-CUT FOR THE 0-1 QUADRATIC KNAPSACK PROBLEM / UM ALGORITMO RELAX-AND-CUT PARA O PROBLEMA QUADRÁTICO DA MOCHILA 0-1
We consider the 0-1 Quadratic Knapsack Problem (QKP), which consists of maximizing a quadratic Boolean function subject to a linear capacity constraint. The problem has applications in several areas such as telecommunications, financial engineering, location problems, graph theory (Max Clique). We propose a Branch-and-Bound algorithm to solve the QKP to opti
Publicado em: 1999
-
29. Planejamento da rede de transmissão em telecomunicações : o problema do enfeixamento
Telecommunications has experimented high growth rates, causing a rapid development of new technologies. In the transmission area, the SDH technology (Synchronous Digital Hierarchy) replaces the PDH technology (Plesyochronous Digital Hierarchy), offering several improvements in management, channels add-dropping on the main stream and network security. The SDH
Publicado em: 1997
-
30. Partição retangular minima de um retangulo em programação linear inteira
Given a rectangle R in the plane and a non empty finite set P of points in the interior of R, we study the problem of partitioning R into smaller rectangles such that no point in P is interior to any rectangle of the partition. The goal is to minimize the sum of the lengths of the straight line segments defining the partition. This problem is NP-hard and a g
Publicado em: 1997
-
31. REPRESENTATION OF MULTISTAGE STOCHASTIC PROBLEMS IN DECOMPOSITION: AN APPLICATION IN PLANNING OF THE EXPANTION OF ELECTRIC POWER SYSTEMS / REPRESENTAÇÃO DE PROBLEMAS ESTOCÁTICOS MULTI-ESTÁGIOS EM DECOMPOSIÇÃO: UMA APLICAÇÃO AO PLANEJAMENTO DA EXPANSÃO DE SISTEMAS DE ELÉTRICOS
The objective of this paper is to present a new methodology for the solution of hydrothermal systems expansion planning problems that takes into account uncertainties of future water inflows to the system reservoirs. The problem consists on the determination of a set of hydroeletric and thermoelectric plants that will be constructed in order to minimize the
Publicado em: 1994
-
32. Planejamento da expansão da geração de sistemas hidrotermicos de potencia, otimizando os usos multiplos da agua dos reservatorios
A substantial contribution to the development of generation expansion planninq for hydrothermal power systems is aimed at in this work. The possible multiple uses of the water from candidate hydro plant reservoirs are considered, employinq conversational techniques of multiobjective programminq. Initially, a modeling based on linear programming is presented
Publicado em: 1990
-
33. An observation on the structure of production sets with indivisibilities
A subset of the constraints of an integer programming problem is said to be binding if, when the remaining constraints are eliminated, the smaller problem has the same optimal solution as the original problem. It is shown that an integer programming problem with n variables has a set of binding constraints of cardinality less than or equal to 2n-1. The bound