Optimization of an integrated lot sizing and cutting stock problem in the paper industry

CNPQ - CONSELHO NACIONAL DE DESENVOLVIMENTO CIENTÍFICO E TECNOLÓGICOFAPESP - FUNDAÇÃO DE AMPARO À PESQUISA DO ESTADO DE SÃO PAULOTwo important optimization problems occur in the planning and production scheduling inpaper industries: the lot sizing problem and the cutting stock problem. The lot sizing problem must determine the quantity of jumbos of different types of paper to be produced in each machine over a finite planning horizon. These jumbos are then cut in order to meet the demand of items for each period. In this paper, we deal with the integration of these two problems, aiming to minimize costs of production and inventory of jumbos, as well as the trim loss of paper generated during the cutting process. Two mathematical models for the integrated problem are considered, and these models are solved both heuristically and using an optimization package. Attempting to get lower bounds for the problem, relaxed versions of the models also have been solved. Finally, computational experiments are presented and discussed.Two important optimization problems occur in the planning and production scheduling inpaper industries: the lot sizing problem and the cutting stock problem. The lot sizing problem must determine the quantity of jumbos of different types of paper to be produced in each machine over a finite planning horizon. These jumbos are then cut in order to meet the demand of items for each period. In this paper, we deal with the integration of these two problems, aiming to minimize costs of production and inventory of jumbos, as well as the trim loss of paper generated during the cutting process. Two mathematical models for the integrated problem are considered, and these models are solved both heuristically and using an optimization package. Attempting to get lower bounds for the problem, relaxed versions of the models also have been solved. Finally, computational experiments are presented and discussed.173305320CNPQ - CONSELHO NACIONAL DE DESENVOLVIMENTO CIENTÍFICO E TECNOLÓGICOFAPESP - FUNDAÇÃO DE AMPARO À PESQUISA DO ESTADO DE SÃO PAULOCNPQ - CONSELHO NACIONAL DE DESENVOLVIMENTO CIENTÍFICO E TECNOLÓGICOFAPESP - FUNDAÇÃO DE AMPARO À PESQUISA DO ESTADO DE SÃO PAULO2010/10133-02013/07375-

A selective newsvendor approach to order management

Consider a supplier offering a product to several potential demand sources, each with a unique revenue, size, and probability that it will materialize. Given a long procurement lead time, the supplier must choose the orders to pursue and the total quantity to procure prior to the selling season. We model this as a selective newsvendor problem of maximizing profits where the total (random) demand is given by the set of pursued orders. Given that the dimensionality of a mixed-integer linear programming formulation of the problem increases exponentially with the number of potential orders, we develop both a tailored exact algorithm based on the L-shaped method for two-stage stochastic programming as well as a heuristic method. We also extend our solution approach to account for piecewise-linear cost and revenue functions as well as a multiperiod setting. Extensive experimentation indicates that our exact approach rapidly finds optimal solutions with three times as many orders as a state-of-the-art commercial solver. In addition, our heuristic approach provides average gaps of less than 1% for the largest problems that can be solved exactly. Observing that the gaps decrease as problem size grows, we expect the heuristic approach to work well for large problem instances. © 2008 Wiley Periodicals, Inc. Naval Research Logistics 2008Peer Reviewedhttp://deepblue.lib.umich.edu/bitstream/2027.42/61330/1/20320_ftp.pd

Models and algorithms for decomposition problems

This thesis deals with the decomposition both as a solution method and as a problem itself. A decomposition approach can be very effective for mathematical problems presenting a specific structure in which the associated matrix of coefficients is sparse and it is diagonalizable in blocks. But, this kind of structure may not be evident from the most natural formulation of the problem. Thus, its coefficient matrix may be preprocessed by solving a structure detection problem in order to understand if a decomposition method can successfully be applied. So, this thesis deals with the k-Vertex Cut problem, that is the problem of finding the minimum subset of nodes whose removal disconnects a graph into at least k components, and it models relevant applications in matrix decomposition for solving systems of equations by parallel computing. The capacitated k-Vertex Separator problem, instead, asks to find a subset of vertices of minimum cardinality the deletion of which disconnects a given graph in at most k shores and the size of each shore must not be larger than a given capacity value. Also this problem is of great importance for matrix decomposition algorithms. This thesis also addresses the Chance-Constrained Mathematical Program that represents a significant example in which decomposition techniques can be successfully applied. This is a class of stochastic optimization problems in which the feasible region depends on the realization of a random variable and the solution must optimize a given objective function while belonging to the feasible region with a probability that must be above a given value. In this thesis, a decomposition approach for this problem is introduced. The thesis also addresses the Fractional Knapsack Problem with Penalties, a variant of the knapsack problem in which items can be split at the expense of a penalty depending on the fractional quantity

Dynamic changes and multi-dimensional evolution of portfolio optimization

Although there has been an increasing number of studies investigate portfolio optimization from different perspectives, few attempts could be found that focus on the development trend and hotspots of this research area. Therefore, it motivates us to comprehensively investigate the development of portfolio optimization research and give some deep insights into this knowledge domain. In this paper, some bibliometric methods are utilized to analyse the status quo and emerging trends of portfolio optimization research on various aspects such as authors, countries and journals. Besides, ‘theories’, ‘models’ and ‘algorithms’, especially heuristic algorithms are identified as the hotspots in the given periods. Furthermore, the evolutionary analysis tends to presents the dynamic changes of the cutting-edge concepts of this research area in the time dimension. It is found that more portfolio optimization studies were at an exploration stage from mean-variance analysis to consideration of multiple constraints. However, heuristic algorithms have become the driving force of portfolio optimization research in recent years. Multidisciplinary analyses and applications are also the main trends of portfolio optimization research. By analysing the dynamic changes and multi-dimensional evolution in recent decades, we contribute to presenting some deep insights of the portfolio optimization research directly, which assists researchers especially beginners to comprehensively learn this research field

Portfolio Construction: The Efficient Diversification of Marketing Investments

Efforts in the marketing sciences can be distinguished between the analysis of individual customers and the examination of portfolios of customers, giving scarce theoretical guidance concerning the strategic allocation of promotional investments. Yet, strategic asset allocation is considered in financial economics theory to be the most important set of investment decisions. The problem addressed in this study was the application of strategic asset allocation theory from financial economics to marketing science with the aim of improving the financial results of investment in direct marketing promotions. This research investigated the components of efficient marketing portfolio construction which include multiattribute numerical optimization, stochastic Brownian motion, peer index tracking schemes, and data mining methods to formulate unique investable asset classes. Three outcomes resulted from this study on optimal diversification: (a) reduced saturative promotional activities balancing inefficient advertising cost and enterprise revenue objectives to achieve an investment equilibrium state; (b) the use of utility theory to assist in the lexicographic ordering of goal priorities; and (c) the solution approach to a multiperiod linear goal program with stochastic extensions. A performance test using a large archival set of customer data illustrated the benefits of efficient portfolio construction. The test asset allocation resulted in significantly more reward than that of the benchmark case. The results of this grounded theory study may be of interest to marketing researchers, operations research practitioners, and functional marketing executives. The social change implication is increased efficiency in allocation of large advertising budgets resulting in improved corporate performance