177,691 research outputs found
A New Dantzig-Wolfe Reformulation And Branch-And-Price Algorithm For The Capacitated Lot Sizing Problem With Set Up Times
No full textThe textbook Dantzig-Wolfe decomposition for the Capacitated LotSizing Problem (CLSP),as already proposed by Manne in 1958, has animportant structural deficiency. Imposingintegrality constraints onthe variables in the full blown master will not necessarily givetheoptimal IP solution as only production plans which satisfy theWagner-Whitin condition canbe selected. It is well known that theoptimal solution to a capacitated lot sizing problem willnotnecessarily have this Wagner-Whitin property. The columns of thetraditionaldecomposition model include both the integer set up andcontinuous production quantitydecisions. Choosing a specific set upschedule implies also taking the associated Wagner-Whitin productionquantities. We propose the correct Dantzig-Wolfedecompositionreformulation separating the set up and productiondecisions. This formulation gives the samelower bound as Manne'sreformulation and allows for branch-and-price. We use theCapacitatedLot Sizing Problem with Set Up Times to illustrate our approach.Computationalexperiments are presented on data sets available from theliterature. Column generation isspeeded up by a combination of simplexand subgradient optimization for finding the dualprices. The resultsshow that branch-and-price is computationally tractable andcompetitivewith other approaches. Finally, we briefly discuss how thisnew Dantzig-Wolfe reformulationcan be generalized to other mixedinteger programming problems, whereas in theliterature,branch-and-price algorithms are almost exclusivelydeveloped for pure integer programmingproblems.branch-and-price;Lagrange relaxation;Dantzig-Wolfe decomposition;lot sizing;mixed-integer programming
Post-l1-penalized estimators in high-dimensional linear regression models
No full textIn this paper we study post-penalized estimators which apply ordinary, unpenalized linear regression to the model selected by first-step penalized estimators, typically LASSO. It is well known that LASSO can estimate the regression function at nearly the oracle rate, and is thus hard to improve upon. We show that post-LASSO performs at least as well as LASSO in terms of the rate of convergence, and has the advantage of a smaller bias. Remarkably, this performance occurs even if the LASSO-based model selection 'fails' in the sense of missing some components of the 'true' regression model. By the 'true' model we mean here the best s-dimensional approximation to the regression function chosen by the oracle. Furthermore, post-LASSO can perform strictly better than LASSO, in the sense of a strictly faster rate of convergence, if the LASSO-based model selection correctly includes all components of the 'true' model as a subset and also achieves a sufficient sparsity. In the extreme case, when LASSO perfectly selects the 'true' model, the post-LASSO estimator becomes the oracle estimator. An important ingredient in our analysis is a new sparsity bound on the dimension of the model selected by LASSO which guarantees that this dimension is at most of the same order as the dimension of the 'true' model. Our rate results are non-asymptotic and hold in both parametric and nonparametric models. Moreover, our analysis is not limited to the LASSO estimator in the first step, but also applies to other estimators, for example, the trimmed LASSO, Dantzig selector, or any other estimator with good rates and good sparsity. Our analysis covers both traditional trimming and a new practical, completely data-driven trimming scheme that induces maximal sparsity subject to maintaining a certain goodness-of-fit. The latter scheme has theoretical guarantees similar to those of LASSO or post-LASSO, but it dominates these procedures as well as traditional trimming in a wide variety of experiments.
Cutting plane methods for general integer programming
No full textInteger programming (IP) problems are difficult to solve due to the integer restrictions imposed on them. A technique for solving these problems is the cutting plane method. In this method, linear constraints are added to the associated linear programming (LP) problem until an integer optimal solution is found. These constraints cut off part of the LP solution space but do not eliminate any feasible integer solution. In this report algorithms for solving IP due to Gomory and to Dantzig are presented. Two other cutting plane approaches and two extensions to Gomory's algorithm are also discussed. Although these methods are mathematically elegant they are known to have slow convergence and an explosive storage requirement. As a result cutting planes are generally not computationally successful
Distributed optimization of linear programs using Dantzig-Wolfe decomposition
No full texthis thesis studies the optimization of block-angular linear programs using distributed computers. Our approach is based on the Dantzig-Wolfe decomposition algorithm. In a Dantzig-Wolfe decomposition, a block-angular linear program with R blocks is decomposed into R+1 semi-autonomous processes. One of them is the coordinating process which generates prices, and the remaining R processes will respond to the prices through the submission of proposals. Since these processes can be executed concurrently and asynchronously, the control of the flow of prices and proposals information among the processes is critical to the rate the entire system achieves optimality. How does the control of information flow affect the dynamics of the concurrent processes ? This is the subject of our study.
An information scheme in a distributed Dantzig-Wolfe decomposition controls the timing of the availability and utilization of the prices and proposals information. We focus on four information control schemes: the Basic Information Scheme (BIS), the Early Termination Information Scheme (ETIS), the Early Start Information Scheme (ESIS) and the Intermediate Prices Information Scheme (IPIS). The efficiency, load-balance, and communication requirements of using distributed Dantzig-Wolfe decomposition to solve block-angular LP\u27s are studied. For empirical experiments, a distributed Dantzig-Wolfe decomposition algorithm with various information schemes is implemented on the CRYSTAL multicomputer at the University of Wisconsin at Madison. A set of ten test problems, obtained mostly from real applications, is used to conduct the empirical studies. Results which are important in designing and implementing distributed optimization algorithms for solving large-scale LP\u27s are reported. These results also provide a framework for the study of information flow in many real life planning situations
Appropriate Similarity Measures for Author Cocitation Analysis
No full textWe provide a number of new insights into the methodological discussion about author cocitation analysis. We first argue that the use of the Pearson correlation for measuring the similarity between authors’ cocitation profiles is not very satisfactory. We then discuss what kind of similarity measures may be used as an alternative to the Pearson correlation. We consider three similarity measures in particular. One is the well-known cosine. The other two similarity measures have not been used before in the bibliometric literature. Finally, we show by means of an example that our findings have a high practical relevance.information science;Pearson correlation;cosine;similarity measure;author cocitation analysis
"Closing the R&D Gap, Evaluating the Sources of R&D Spending"
No full textBoth spending and tax policies have been implemented in the United States with the goal of stimulating private sector research and development (R&D). Karier questions whether current R&D policy, especially the research and experimentation tax credit, can contribute to closing the gap between nondefense expenditures on R&D in the United States and such expenditures in other countries, such as Japan and Germany. He also explores possible changes to our current R&D policy to make it more effective.
Going Beyond Counting First Authors in Author Co-citation Analysis
No full textThe present study examines one of the fundamental aspects of author co-citation analysis (ACA) - the way co-citation
counts are defined. Co-citation counting provides the data on which all subsequent statistical analyses and mappings
are based, and we compare ACA results based on two different types of co-citation counting - the traditional type that
only counts the first one among a cited work's authors on the one hand and a non-traditional type that takes into
account the first 5 authors of a cited work on the other hand. Results indicate that the picture produced through this non-traditional author co-citation counting contains more coherent author groups and is therefore considerably clearer. However, this picture represents fewer specialties in the research field being studied than that produced through the traditional first-author co-citation counting when the same number of top-ranked authors is selected and analyzed. Reasons for these effects are discussed
Letter from R. R. Zellick, Assistant Trust Officer, Anglo California National Bank of San Francisco, to Joseph R. Goodman, October 2, 1942
No full textLetter from R. R. Zellick, Assistant Trust Officer at The Anglo California National Bank of San Francisco, to Joseph R. Goodman, regarding property owned by Dave Tatsuno. Zellick mentions a dispute between current tenants and Tatsuno, and that Tatsuno has asked Goodman to help locate trustworthy tenants.Personal correspondence, organizational records, government documents, publications, and other papers created or collected by Joseph R. Goodman documenting the forced removal and incarceration of Japanese Americans during World War II, as well as organized resistance to incarceration. Included in the collection are records of the Japanese Young Men's Christian Association and the Japanese American Citizens' League in San Francisco, including papers of the Japanese YMCA's executive secretary Lincoln Kanai; Sakai family papers; Goodman's correspondence to and from Japanese American incarcerees, organizations opposing forced removal and incarceration of Japanese Americans, the War Relocation Authority, and others; publications, photographs, and ephemera from the Topaz Relocation Center, where Goodman taught high school; War Relocation Authority records and publications; and newspaper clippings, pamphlets, and reports about forced removal and incarceration created by various government, religious, and civic organizations, in California and nationwide
Combining Column Generation and Lagrangian Relaxation
No full textAlthough the possibility to combine column generation and Lagrangian relaxation has been known for quite some time, it has only recently been exploited in algorithms. In this paper, we discuss ways of combining these techniques. We focus on solving the LP relaxation of the Dantzig-Wolfe master problem. In a first approach we apply Lagrangian relaxation directly to this extended formulation, i.e. no simplex method is used. In a second one, we use Lagrangian relaxation to generate new columns, that is Lagrangian relaxation is applied to the compact for-mulation. We will illustrate the ideas behind these algorithms with an application in Lot-sizing. To show the wide applicability of these techniques, we also discuss applications in integrated vehicle and crew scheduling, plant location and cutting stock problems.column generation;Lagrangean relaxation;cutting stock problem;lotsizing;vehicle and crew scheduling
A Machine-Job Scheduling Model
No full textThis paper makes use of a device proposed by Fulkerson and Ford for maximal multi-commodity network flows (Ford, L. R. Jr., D. R. Fulkerson. 1958. A suggested computation for maximal multi-commodity network flows. The RAND Corporation, Paper P-1114, March 27, 1958. Also Management Sci. 5(1) 97-101.). A machine-job scheduling model is formulated that avoids the usual in-process inventories and thereby has fewer equations. The activities are the possible sequence for each job of machine steps and interspersed delays; this, of course, greatly multiplies the number of activities. However, a compact network representation of the set of possible activities is developed which permits generating just the activity to enter the basis on each iteration without explicitly generating the others. This is done by using one of the efficient procedures that now exist for computing the shortest route through a network (Dantzig, George B. 1960. On the shortest route through a network. Management Sci. 6(2); Moore, E. F. The shortest path through a maze. Unpublished mimeographed report, 16 pages; Bellman, Richard. 1958. On a routing problem. JORSA, XVI(1) 87-90.), (Ford, L. R. Jr. 1956. Network flow theory. The RAND Corporation, Paper P-923).
- …
