Página 1 dos resultados de 967 itens digitais encontrados em 0.018 segundos

An integer linear programming approach for approximate string comparison

RITT, Marcus; COSTA, Alysson M.; MERGEN, Sergio; ORENGO, Viviane M.
Fonte: ELSEVIER SCIENCE BV Publicador: ELSEVIER SCIENCE BV
Tipo: Artigo de Revista Científica
Português
Relevância na Pesquisa
76.25%
We introduce a problem called maximum common characters in blocks (MCCB), which arises in applications of approximate string comparison, particularly in the unification of possibly erroneous textual data coming from different sources. We show that this problem is NP-complete, but can nevertheless be solved satisfactorily using integer linear programming for instances of practical interest. Two integer linear formulations are proposed and compared in terms of their linear relaxations. We also compare the results of the approximate matching with other known measures such as the Levenshtein (edit) distance. (C) 2008 Elsevier B.V. All rights reserved.; Brazilian Ministry of Education; Ministério da Educação do Brasil (MEC); CAPES; Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES)

An integer linear programming approach for bilinear integer programming

Freire, Alexandre da Silva; Moreno, Eduardo; Vielma, Juan Pablo
Fonte: ELSEVIER SCIENCE BV; AMSTERDAM Publicador: ELSEVIER SCIENCE BV; AMSTERDAM
Tipo: Artigo de Revista Científica
Português
Relevância na Pesquisa
96.35%
We introduce a new Integer Linear Programming (ILP) approach for solving Integer Programming (IP) problems with bilinear objectives and linear constraints. The approach relies on a series of ILP approximations of the bilinear P. We compare this approach with standard linearization techniques on random instances and a set of real-world product bundling problems. (C) 2011 Elsevier B.V. All rights reserved.; ANILLO; ANILLO [ACT-88]; CAPES; CAPES

Biodiesel: análise e dimensionamento da rede logística no Brasil usando programação linear.; Biodiesel: supply chain analyses and facilities location using mixed integer linear programming.

Carvalho, Éden de Rezende
Fonte: Biblioteca Digitais de Teses e Dissertações da USP Publicador: Biblioteca Digitais de Teses e Dissertações da USP
Tipo: Dissertação de Mestrado Formato: application/pdf
Publicado em 18/09/2008 Português
Relevância na Pesquisa
96.24%
Neste trabalho foi desenvolvido um modelo de programação linear inteira mista para localização das instalações da rede logística do biodiesel no Brasil, de forma a que se possa, com sua aplicação, avaliar o potencial de produção de oleaginosas no país, assim como identificar as zonas mais promissoras para a localização dos diversos elos da cadeia do biodiesel, a partir da demanda gerada pela mistura de um percentual de biodiesel ao diesel fóssil. O modelo incorpora quatro elos da cadeia produtiva (fase agrícola, extração de óleo, produção de biodiesel e pontos de demanda). Os parâmetros do modelo foram estimados com base em informações reais de mercado disponíveis (base de dezembro/2007). Obteve-se com a aplicação do modelo a diversos cenários, os municípios mais indicados para produção das oleaginosas, as oleaginosas utilizadas, o volume de produção em cada local e, por fim, a localização e porte das fábricas de óleo e das usinas de biodiesel. Análises de sensibilidade de alguns parâmetros foram executadas para verificação do comportamento do modelo face a incertezas. O trabalho incorpora sugestões e recomendações para aprimoramento do modelo.; In this research a mixed integer linear programming model was developed to locate facilities related to the biodiesel supply chain in Brazil...

Modelagem integrada para a programação de voos e a alocação de frotas: abordagens baseadas em programação linear inteira e na meta-heurística colônia de formigas.; An integrated model for flight scheduling and fleet assignment based on integer linear programming and on ant colony meta-heuristic.

Caetano, Daniel Jorge
Fonte: Biblioteca Digitais de Teses e Dissertações da USP Publicador: Biblioteca Digitais de Teses e Dissertações da USP
Tipo: Tese de Doutorado Formato: application/pdf
Publicado em 12/05/2011 Português
Relevância na Pesquisa
86.18%
Este trabalho propõe modelos matemáticos e heurísticas para a definição da malha de voos de uma empresa aérea, como parte de seu planejamento operacional, visando à maior eficiência de operação frente às restrições relacionadas aos aeroportos, a equipamentos e à demanda. Em especial, é proposta uma função objetivo, baseada no momento de transporte, para a modelagem integrada dos problemas de Programação de Voos e Alocação de Frotas que inclui elementos específicos para a consideração de slots de pouso e decolagem. A abordagem tem aplicação especialmente relevante no âmbito de empresas aéreas de pequeno e médio porte atuando em mercados regionais, cuja malha é composta principalmente por voos de curta duração, em geral operando com aeronaves de pequeno e médio porte. Nestas condições, tais empresas trabalham com margens de lucro limitadas e, portanto, podem-se beneficiar sensivelmente da definição de uma malha mais eficiente e eficaz. Os modelos desenvolvidos, baseados em programação linear inteira e na meta-heurística Ant Colony Optimization, foram aplicados com sucesso ao caso de uma empresa aérea regional, com atuação no mercado brasileiro, possibilitando a definição de malhas alternativas...

Optimal conductor size selection and reconductoring in radial distribution systems using a mixed-integer LP approach

Franco, John F.; Rider, Marcos J.; Lavorato, Marina; Romero, Rubén
Fonte: Universidade Estadual Paulista Publicador: Universidade Estadual Paulista
Tipo: Artigo de Revista Científica Formato: 10-20
Português
Relevância na Pesquisa
76.37%
This paper presents a mixed-integer linear programming model to solve the conductor size selection and reconductoring problem in radial distribution systems. In the proposed model, the steady-state operation of the radial distribution system is modeled through linear expressions. The use of a mixed-integer linear model guarantees convergence to optimality using existing optimization software. The proposed model and a heuristic are used to obtain the Pareto front of the conductor size selection and reconductoring problem considering two different objective functions. The results of one test system and two real distribution systems are presented in order to show the accuracy as well as the efficiency of the proposed solution technique. © 1969-2012 IEEE.

A mixed-integer LP model for the reconfiguration of radial electric distribution systems considering distributed generation

Franco, John F.; Rider, Marcos J.; Lavorato, Marina; Romero, Rubén
Fonte: Universidade Estadual Paulista Publicador: Universidade Estadual Paulista
Tipo: Artigo de Revista Científica Formato: 51-60
Português
Relevância na Pesquisa
76.42%
The problem of reconfiguration of distribution systems considering the presence of distributed generation is modeled as a mixed-integer linear programming (MILP) problem in this paper. The demands of the electric distribution system are modeled through linear approximations in terms of real and imaginary parts of the voltage, taking into account typical operating conditions of the electric distribution system. The use of an MILP formulation has the following benefits: (a) a robust mathematical model that is equivalent to the mixed-integer non-linear programming model; (b) an efficient computational behavior with exiting MILP solvers; and (c) guarantees convergence to optimality using classical optimization techniques. Results from one test system and two real systems show the excellent performance of the proposed methodology compared with conventional methods. © 2012 Published by Elsevier B.V. All rights reserved.

A mixed-integer LP model for the optimal allocation of voltage regulators and capacitors in radial distribution systems

Franco, John F.; Rider, Marcos J.; Lavorato, Marina; Romero, Rubén
Fonte: Universidade Estadual Paulista Publicador: Universidade Estadual Paulista
Tipo: Artigo de Revista Científica Formato: 123-130
Português
Relevância na Pesquisa
76.37%
This paper presents a mixed-integer linear programming model to solve the problem of allocating voltage regulators and fixed or switched capacitors (VRCs) in radial distribution systems. The use of a mixed-integer linear model guarantees convergence to optimality using existing optimization software. In the proposed model, the steady-state operation of the radial distribution system is modeled through linear expressions. The results of one test system and one real distribution system are presented in order to show the accuracy as well as the efficiency of the proposed solution technique. An heuristic to obtain the Pareto front for the multiobjective VRCs allocation problem is also presented. © 2012 Elsevier Ltd. All rights reserved.

A mixed-integer linear programming approach for optimal type, size and allocation of distributed generation in radial distribution systems

Rueda-Medina, Augusto C.; Franco, John F.; Rider, Marcos J.; Padilha-Feltrin, Antonio; Romero, Rubén
Fonte: Universidade Estadual Paulista Publicador: Universidade Estadual Paulista
Tipo: Artigo de Revista Científica Formato: 133-143
Português
Relevância na Pesquisa
96.41%
This paper presents a mixed-integer linear programming approach to solving the problem of optimal type, size and allocation of distributed generators (DGs) in radial distribution systems. In the proposed formulation, (a) the steady-state operation of the radial distribution system, considering different load levels, is modeled through linear expressions; (b) different types of DGs are represented by their capability curves; (c) the short-circuit current capacity of the circuits is modeled through linear expressions; and (d) different topologies of the radial distribution system are considered. The objective function minimizes the annualized investment and operation costs. The use of a mixed-integer linear formulation guarantees convergence to optimality using existing optimization software. The results of one test system are presented in order to show the accuracy as well as the efficiency of the proposed solution technique.© 2012 Elsevier B.V. All rights reserved.

Bilevel approach for optimal location and contract pricing of distributed generation in radial distribution systems using mixed-integer linear programming

Rider, Marcos J.; López-Lezama, Jesús María; Contreras, Javier; Padilha-Feltrin, Antonio
Fonte: Universidade Estadual Paulista Publicador: Universidade Estadual Paulista
Tipo: Artigo de Revista Científica Formato: 724-734
Português
Relevância na Pesquisa
86.27%
In this study, a novel approach for the optimal location and contract pricing of distributed generation (DG) is presented. Such an approach is designed for a market environment in which the distribution company (DisCo) can buy energy either from the wholesale energy market or from the DG units within its network. The location and contract pricing of DG is determined by the interaction between the DisCo and the owner of the distributed generators. The DisCo intends to minimise the payments incurred in meeting the expected demand, whereas the owner of the DG intends to maximise the profits obtained from the energy sold to the DisCo. This two-agent relationship is modelled in a bilevel scheme. The upper-level optimisation is for determining the allocation and contract prices of the DG units, whereas the lower-level optimisation is for modelling the reaction of the DisCo. The bilevel programming problem is turned into an equivalent single-level mixed-integer linear optimisation problem using duality properties, which is then solved using commercially available software. Results show the robustness and efficiency of the proposed model compared with other existing models. As regards to contract pricing, the proposed approach allowed to find better solutions than those reported in previous works. © The Institution of Engineering and Technology 2013.

Modelo de tomada de decisão integrando teoria das restrições, programação linear e simulação: estudo de caso numa Indústria Siderúrgica

Rodriguez, Luis Alberto Osés
Fonte: Universidade Estadual Paulista (UNESP) Publicador: Universidade Estadual Paulista (UNESP)
Tipo: Dissertação de Mestrado Formato: 180 f. : il.
Português
Relevância na Pesquisa
76.12%
Pós-graduação em Engenharia Mecânica - FEG; Para enfrentar os problemas do atual mundo globalizado e para se manter em atividade, as empresas vêm sendo obrigadas a empregar, em seu dia-a-dia, novos instrumentos de trabalho. A Teoria das Restrições, a Programação Linear Inteira e a Simulação de Sistemas surgem como potenciais ferramentas no auxílio à identificação e à solução dos problemas enfrentados pelas empresas nos dias de hoje. Este trabalho teve por objetivo principal desenvolver um método de planejamento e gerenciamento da produção, integrando essas três ferramentas. O método foi aplicado na linha de produção da Unidade de Cilindros para Laminação da empresa Aços Villares S/A com o intuito de melhorar o fluxo de produção e o cumprimento do prazo de liberação do produto entre as suas diversas áreas. Ao final do trabalho, concluiu-se que o referido método, além de facilitar e simplificar o processo de modelagem permite realizar análises mais aprofundadas do sistema real, em relação às que seriam conseguidas com a utilização das técnicas citadas, isoladamente.; In order to face the issues of the current globalized world and in order to keep working, companies have been pushed to put in practice new working tools. The Theory of Constraints...

Metodo heuristico eficiente para problemas de programação linear inteira com dimensão completa; Efficient heuristic method for integer linear programming problems with complete dimension

Rodrigo Marchiori Dal Gallo
Fonte: Biblioteca Digital da Unicamp Publicador: Biblioteca Digital da Unicamp
Tipo: Dissertação de Mestrado Formato: application/pdf
Publicado em 16/05/2008 Português
Relevância na Pesquisa
76.25%
O trabalho tem como objetivo a implementação de um método heurístico para a resolução de problemas de programação inteira com dimensão completa. Nos atemos aos problemas de corte e empacotamento, mas a aplicação pode ser estendida a qualquer outro problema dessa classe. No problema de programação linear relaxado aplicamos o Método de Gilmore & Gomory e a partir da solução contínua obtida através do método simplex, aplicamos o método heurístico e comparamos os resultados com as soluções exatas obtidas a partir de Branch & Bound; The objective of this dissertation is the implementation of a heuristic method to solve integer linear programming problems with complete dimension. We worked specifically with cutting and stock problems, but it can be aplied to any other class of integer problems. We used the Gilmore & Gomory method of column generation and starting by the continuous solution obtained with simplex method, we aplied the heuristic method and made a comparation of results with the exact solutions obtained by the Branch&Bound method

An Algorithm for Approximating High-Order Pareto Frontier in Multiobjective Integer Linear Problems

Bushenkov, Vladimir; Fernandes, Manuela
Fonte: Universidade de Évora Publicador: Universidade de Évora
Tipo: Aula
Português
Relevância na Pesquisa
86.21%
An algorithm for approximating the Pareto frontier (PF) in multiobjective integer linear problems is presented. As known, the feasible set in the objective space (FSOS) for an integer linear programming problem is not convex and only a few points of its Pareto frontier (so called supported points) can be found when constructing its convex hull. To get these points at the fisrt iteration of our algorithm we construct the convex Edgeworth-Pareto hull (CEPH) of the FSOC, i.e. a broader convex set that has the same Pareto frontier. The algorithm for constructing CEPH is more simple then one for constructing convex hull. It gives the result in the form of both a set of vertices and a system of linear inequalities. Using this information we can specify an unexplored region in the objective space which contains all not found yet Pareto frontier’s points. This region is restricted by the CEPH’s Pareto frontier and the Pareto frontier of the union of cones dominated by corresponding CEPH’s vertices. It can be easily vizualized on computer display. At each iteration, one unexplored subregion is selected to construct its partial CEPH. To formulate this subproblem, vertices and hyperplanes of CEPHs calculated at the previous iterations are used. As a result...

Parametric programming technique for global optimization of wastewater treatment systems

Teles, João P.; Castro, Pedro; Matos, Henrique A.
Fonte: Laboratório Nacional de Energia e Geologia Publicador: Laboratório Nacional de Energia e Geologia
Tipo: Conferência ou Objeto de Conferência
Publicado em 06/06/2010 Português
Relevância na Pesquisa
76.17%
This paper presents a parametric programming technique for the optimal design of industrial wastewater treatment networks (WTN) featuring multiple contaminants. Inspired in scientific notation and powers of ten, the proposed approach avoids the non-convex bilinear terms through a piecewise decomposition scheme that combines the generation of artificial flowrate variables with a multi-parameterization of the outlet concentration variables. The general non-linear problem (NLP) formulation is replaced by a mixed-integer linear programming (MILP) model that is able to generate near optimal solutions, fast. The performance of the new approach is compared to that of global optimization solver BARON through the solution a few test cases.

Application of mixed-integer linear programming in a car seats assembling process

Rave,Jorge Iván Perez; Álvarez,Gloria Patricia Jaramillo
Fonte: Sociedade Brasileira de Pesquisa Operacional Publicador: Sociedade Brasileira de Pesquisa Operacional
Tipo: Artigo de Revista Científica Formato: text/html
Publicado em 01/12/2011 Português
Relevância na Pesquisa
96.23%
In this paper, a decision problem involving a car parts manufacturing company is modeled in order to prepare the company for an increase in demand. Mixed-integer linear programming was used with the following decision variables: creating a second shift, purchasing additional equipment, determining the required work force, and other alternatives involving new manners of work distribution that make it possible to separate certain operations from some workplaces and integrate them into others to minimize production costs. The model was solved using GAMS. The solution consisted of programming 19 workers under a configuration that merges two workplaces and separates some operations from some workplaces. The solution did not involve purchasing additional machinery or creating a second shift. As a result, the manufacturing paradigms that had been valid in the company for over 14 years were broken. This study allowed the company to increase its productivity and obtain significant savings. It also shows the benefits of joint work between academia and companies, and provides useful information for professors, students and engineers regarding production and continuous improvement.

Mixed integer linear programming and constraint logic programming : towards a unified modeling framework

Magatão, Leandro
Fonte: Curitiba Publicador: Curitiba
Tipo: Tese de Doutorado Formato: 1,54 MB
Português
Relevância na Pesquisa
86.31%
The struggle to model and solve Combinatorial Optimization Problems (COPs) has challenged the development of new approaches to deal with COPs. In one of the front lines of such approaches, Operational Research (OR) and Constraint Programming (CP) optimization techniques are beginning to converge, despite their very different origins. More specifically, Mixed Integer Linear Programming (MILP) and Constraint Logic Programming (CLP) are at the confluence of the OR and the CP fields. This thesis summarizes and contrasts the essential characteristics of MILP and CLP, and the ways that they can be fruitfully combined. Chapters 1 to 3 sketch the intellectual background for recent efforts at integration and the main results achieved. In addition, these chapters highlight that CLP is known by its reach modeling framework, and the MILP modeling vocabulary is just based on inequalities, which makes the modeling process hard and error-prone. Therefore, a combined CLP-MILP approach suffers from this MILP inherited drawback. In chapter 4, this issue is addressed, and some "high-level" MILP modeling structures based on logical inference paradigms are proposed. These structures help the formulation of MILP models, and can be seen as a contribution towards a unifying modeling framework for a combined CLP-MILP approach. In addition...

Short-term expansion planning of radial electrical distribution systems using mixed-integer linear programming

Goncalves, Rogerio R.; Franco, John F.; Rider, Marcos J.
Fonte: Inst Engineering Technology-iet Publicador: Inst Engineering Technology-iet
Tipo: Artigo de Revista Científica Formato: 256-266
Português
Relevância na Pesquisa
96.32%
Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq); Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP); This study presents a mixed-integer linear programming (MILP) model to solve the short-term expansion planning problem of radial electrical distribution systems. The proposed model defines the construction of new circuits, the reconductoring of existing circuits, the allocation of capacitor banks (as well as the type and the number of units in operation) and the allocation of voltage regulators to minimise the total annualised investment and operation costs. In the proposed formulation, the steady-state operation of the radial distribution system is mathematically modelled through linear expressions. The use of an MILP model guarantees convergence to optimality by using existing classical optimisation tools. The model was implemented in the mathematical modelling language AMPL and solved using the commercial solver CPLEX. A 54-node test system and 201-node real distribution system were used to demonstrate the accuracy of the mathematical model, as well as the efficiency of the proposed solution technique.

An integer linear program to schedule an Army installation's maneuver training

Kasimoglu, Fatih
Fonte: Monterey, California. Naval Postgraduate School Publicador: Monterey, California. Naval Postgraduate School
Tipo: Tese de Doutorado Formato: xvi, 44 p.
Português
Relevância na Pesquisa
76.17%
Approved for public release, distribution is unlimited; This thesis develops an integer linear program called MSAMT (Model to Schedule Army Maneuver Training) to schedule an Army installation's maneuver training. We demonstrate MSAMT using a data set containing 261 platoon-level, 67 company-level and 18 battalion-level units, and 7 major training areas located at Fort Hood, Texas. Using a typical near-term planning horizon from 6 to 8 weeks, MSAMT schedules daily training for a randomly selected set of the stationed units and training requirements. For a 6-week time period and almost 65% (63 platoons 16 companies and 5 battalions) of the units there are 151 platoon-level, 51 company-level and 11 battalion-level required tasks of which MSAMT can schedule 93%. When the subset of units is increased to 80% (75 platoons, 20 companies, 6 battalions), there are 187 platoon-level, 62 company-level and 11 battalion-level tasks of which MSAMT can schedule only 85%. Maintaining the 80% unit level but having an 8 weekperiod increases required training achieved to 94%. Such results can help determine the ability of an Army installation to satisfy training requirements of its stationed units as well as identify a shortage or excess in available training land. It can show the training impact of changing the quantity of units at an installation and thereby aid in base realignment and closure decisions.; First Lieutenant...

Enfoques de programación entera para el Problema del Viajante de Comercio con costos en función del tiempo; Integer programming approaches to the Time Dependent Travelling Salesman Problem

Miranda Bront, Juan José
Fonte: Facultad de Ciencias Exactas y Naturales. Universidad de Buenos Aires Publicador: Facultad de Ciencias Exactas y Naturales. Universidad de Buenos Aires
Tipo: info:eu-repo/semantics/doctoralThesis; tesis doctoral; info:eu-repo/semantics/publishedVersion Formato: application/pdf
Publicado em //2012 Português
Relevância na Pesquisa
76.16%
El Problema del Viajante de Comercio Dependiente del Tiempo (PVCDT) es una generalización del clásico Problema del Viajante de Comercio (PVC) en el cual se busca un circuito de costo mínimo que recorra todos los clientes, donde los tiempos (o costos) de viaje entre ellos no son constantes y pueden variar dependiendo de diversos factores. Una de las motivaciones para considerar la dependencia del tiempo es que nos permite tener una mejor aproximación a muchas aplicaciones de la vida real, dentro de la industria y en el sector de servicios. En la literatura relacionada, existen distintas versiones del PVCDT que consideran que las variaciones se producen por diversos motivos y sobre distintos parámetros. Algunas de ellas estipulan que las variaciones se producen sobre los tiempos (y/o costos) de viaje mientras que otras asumen que las variaciones se producen sobre la velocidad de viaje. Más aún, para el primer caso, una variante asume que el tiempo de viaje depende de la posición del arco en el circuito mientras que otra asume que depende del instante en el que se comienza a atravesar el arco. Al igual que el PVC, el PVCDT pertence a la clase NP-Difícil y por lo tanto no se conoce un algoritmo que encuentre una solución en tiempo polinomial. En esta tesis abordamos dos de las variantes antes mencionadas mediante la formulación de modelos de Programación Lineal Entera. Para cada formulación...

An Integer linear programming formulation for tiling large rectangles using 4 x 6 and 5 x 7 tiles

Dietert, Grant
Fonte: Rochester Instituto de Tecnologia Publicador: Rochester Instituto de Tecnologia
Tipo: Tese de Doutorado
Português
Relevância na Pesquisa
86.23%
We consider the problem of tiling large rectangles using smaller rectangles with the prescribed dimensions 4 x 6 and 5 x 7. Problem B-3 on the 1991 William Lowell Putnam Examination asked "Does there exist a natural number L such that if m and n are integers greater than L, then an m x n rectangle may be expressed as a union of 4 x 6 and 5 x 7 rectangles, any two intersect at most along their boundaries?" Narayan and Schwenk showed in 2002 that all rectangles with length and width at least 34 can be partitioned into 4 x 6 and 5 x 7 rectangles. We investigate necessary and sufficient conditions for an m x n rectangle to be tiled with 4 x 6 and 5 x 7 rectangles. Ashley et al. answered this question for all but 37 cases. We use an integer linear programming approach to eliminate all but five of these cases.

AN INTEGER LINEAR PROGRAMMING APPROACH APPLIED TO THE CERRADO (SAVANNA) MANAGEMENT; AN INTEGER LINEAR PROGRAMMING APPROACH APPLIED TO THE CERRADO (SAVANNA) MANAGEMENT

Haddad, Henrique Moreira Dabien; UFLA; Gomide, Lucas Rezende; UFLA; Cruz, Bruno Rogério; UFLA; da Silva, Sérgio Teixeira; Ufla
Fonte: FUPEF DO PARANÁ Publicador: FUPEF DO PARANÁ
Tipo: info:eu-repo/semantics/article; info:eu-repo/semantics/publishedVersion; Artigo Avaliado pelos Pares Formato: application/pdf
Publicado em 08/01/2014 Português
Relevância na Pesquisa
76.36%
AbstractCerrado presents great potential for the use of its resources, whether timber or non-timber, as fruits, firewood and charcoal. Thus, this study aimed to test the use of forest regulation model type I in a remnant of cerrado, applying the integer linear programming. The studied area was a remnant of cerrado sensu stricto located in São Romão – MG. The type of forest management carried out was the strip cutting. with post regeneration conduction. The model type I was applied generating 8 scenarios considering 14 years of planning horizon. The tested scenarios considered the area control, volume control and also both controls in the same model, where the objective function was to maximize the present value of revenues (PVR). After data processing it was observed that scenario 5 was the best, because it obtained the lowest amplitude variation (425 – 575 ha/year) and volume (18.000 – 21.000 m3/year) of the exploited surface limits, presenting a PVR of R$4,004,561.58. It is possible to conclude that the developed models were able to regulate the volumetric yield in constant flows over the planning horizon, representing a promising alternative for the sustainable planning of the wood resources of the cerrado.Keywords: Mathematical programming; forest regulation; forest management.; AbstractCerrado presents great potential for the use of its resources...