In this paper we derive an optimal solution to the multi-item single-supplier inventory problem with two types of set-up costs. In the case considered, replenishment opportunities are restricted to the beginning of th...
详细信息
In this paper we derive an optimal solution to the multi-item single-supplier inventory problem with two types of set-up costs. In the case considered, replenishment opportunities are restricted to the beginning of the discrete time periods.
"An Optimal Method for a Deterministic Joint Replenishment Inventory Policy in discrete Time."Journal of the Operational Research Society, 46(11), p. 1404
"An Optimal Method for a Deterministic Joint Replenishment Inventory Policy in discrete Time."Journal of the Operational Research Society, 46(11), p. 1404
The problem of maximizing diversity deals with selecting a set of elements from some larger collection such that the selected elements exhibit the greatest variety of characteristics. A new model is proposed in which ...
详细信息
The problem of maximizing diversity deals with selecting a set of elements from some larger collection such that the selected elements exhibit the greatest variety of characteristics. A new model is proposed in which the concept of diversity is quantifiable and measurable. A quadratic zero-one model is formulated for diversity maximization. Based upon the formulation, it is shown that the maximum diversity problem is NP-hard. Two equivalent linear integer programs are then presented that offer progressively greater computational efficiency. Another formulation is also introduced which involves a different diversity objective. An example is given to illustrate how additional considerations can be incorporated into the maximum diversity model.
In this paper, we report on the application of set covering and maximal covering location models to the problem of locating emergency warning sirens in a midwestern city. Two siren types are available, each having dif...
详细信息
In this paper, we report on the application of set covering and maximal covering location models to the problem of locating emergency warning sirens in a midwestern city. Two siren types are available, each having different costs and covering radii. Using a modified version of the set covering location model, we analyze the cost implications of several policy options being considered by the city's planners. Results of the study indicate that location covering models can be powerful and efficient tools in the design of such systems, and their use can lead to significant cost savings. In addition, such models provide decision makers the flexibility to examine the inherent costs associated with various policy options.
A new LP-based algorithm is developed to determine the optimal solution to the two-group classification problem. The procedure is efficient when compared to current research in a simulation study.
A new LP-based algorithm is developed to determine the optimal solution to the two-group classification problem. The procedure is efficient when compared to current research in a simulation study.
Optimal linear discriminant models maximize percentage accuracy for dichotomous classifications, but are rarely used because a theoretical framework that allows one to make valid statements about the statistical signi...
详细信息
Optimal linear discriminant models maximize percentage accuracy for dichotomous classifications, but are rarely used because a theoretical framework that allows one to make valid statements about the statistical significance of the outcomes of such analyses does not exist. This paper describes an analytic solution for the theoretical distribution of optimal values for univariate optimal linear discriminant analysis, under the assumption that the data are random and continuous. We also present the theoretical distribution for sample sizes up to N= 30. The discovery of a statistical framework for evaluating the performance of optimal discriminant models should greatly increase their use by scientists in all disciplines.
A procedure is developed for determining two-group linear discriminant classifiers that misclassify the fewest number of observations in the training sample. An experimental study confirms the value of this approach. ...
详细信息
A procedure is developed for determining two-group linear discriminant classifiers that misclassify the fewest number of observations in the training sample. An experimental study confirms the value of this approach. [ABSTRACT FROM AUTHOR]
Systems development managers today are working with increasingly complex systems, revealing a need for computer-aided techniques in software system definition, design, and construction. The ultimate task of the softwa...
详细信息
Systems development managers today are working with increasingly complex systems, revealing a need for computer-aided techniques in software system definition, design, and construction. The ultimate task of the software engineer is the development of tools and procedures which reduce the effort involved in production of effective software. To be effective, software must possess characteristics of correctness, reliability, efficiency, documentation, and flexibility. This paper develops a measure for software effectiveness and a computer aid for determining process structure in program module specification. The proposed method uses various criteria and a mixed integer program to decompose a system graph into program modules. [ABSTRACT FROM AUTHOR]
Each of the many two-dimensional variations of the classical assignment problem has at least one counterpart in higher dimensions. This paper is a tutorial on these higher dimensional assignment models and their appli...
详细信息
Each of the many two-dimensional variations of the classical assignment problem has at least one counterpart in higher dimensions. This paper is a tutorial on these higher dimensional assignment models and their applications. It is a synthesis of a vast literature scattered throughout a great variety of journal articles and other miscellaneous sources. We have attempted to make the paper a complete bibliography with the emphasis on topics important to practitioners of decision sciences. These topics include original results by the authors, most notably, a polynomial solution approach for a class of multidimensional assignment problems which often arise in scheduling applications. [ABSTRACT FROM AUTHOR]
It is demonstrated how branch-and-bound algorithms can be modularized to obtain implementation efficiencies. For the manager, this advantage can be employed to obtain faster implementation o...
详细信息
It is demonstrated how branch-and-bound algorithms can be modularized to obtain implementation efficiencies. For the manager, this advantage can be employed to obtain faster implementation of algorithm results. For the scientist, it permits efficiencies in the construction of similar algorithms with different search and addressing structures for the purpose of testing to find a preferred algorithm. Modularizations of 3 common searches with the following addressing methods are described and contrasted: the best-bound search and 2 variants of the last-in first-out search. Using 4 assembly line balancing algorithms as examples, modularization is shown, and the search and addressing methods are contrasted. The application potential of modularization is broad and encompasses linear programming-based integer programming. Exploration is given to benefits and disadvantages of modularization, and computational results show the viability of the method.
暂无评论