Business Commons^™

Grg User's Guide, Leon S. Lasdon, Allan D. Waren, Margery W. Ratner, Arvind Jain

Research Reports from the Department of Operations

This report was prepared as part of the joint activities of the Computer and Information Science Department, Cleveland State University and the Department of Operations Research, Case Western Reserve University, partially supported under Contract 00014-75-C-0240 with the Office of Naval Research and under National Science Foundation Grant SOC74-23808. Reproduction in whole or in part is permitted for any purpose by the United States Government.

1975-10-10, Morehead State Board Of Regents

Morehead State Board of Regents Agenda Books and Meeting Minutes

No abstract provided.

The Sfa Business Review Vol. 1 No. 2, Charles W. Brown, Don A. Evans, Thomas K. Hunter, John H. Lewis, Dillard Tinsley

SFA Business Review, 1975-1978

No abstract provided.

Set Covering Algorithm And Computer Program Usetco User's Manual, Harvey M. Salkin

Research Reports from the Department of Operations

These pages discuss the code USETCO which contains an algorithm for the set covering problem. (That is, minimize cx, subject to Ex ≥ e, x≥0, and x integer; where E is an m by n matrix of 1's and 0's, and e is an m vector of 1's.) The special problem structure permits a rather efficient, yet simple, solution procedure which is basically a zero-one search of the single branch type coupled with linear programming and a suboptimization technique. The algorithm has been found to be highly effective for a good number of relatively large problems. Problems from 30 to …

An Analysis Of A Method For Reducing Pretrial Delay In Court Systems, Burton V. Dean, John N. Barrer

Research Reports from the Department of Operations

An analysis is performed to measure the effect on court processing times produced by a project implemented by Lewis Katz of the Case Western Reserve University's School of Law. The project formalized the procedure known as plea bargaining through the cooperation of prosecuting and defense attorneys in each of three test cities - New Haven, Connecticut; Norfolk, Virginia; and Salt Lake City, Utah. The analysis reveals that the project reduced the average processing time in New Haven by 45%, but had no significant effect on the processing times in the other two cities. Differences in procedures between New Haven and …

Duality In Approximation And Conjugate Cones In Normed Linear Spaces, Vasant A. Ubhaya

Research Reports from the Department of Operations

Duality in a normed linear space X, refers to a relationship between a pair of extremum problems: the primal problem on X and the dual problem on the dual space X*. Given a closed convex cone K defined in terms of a set of continuous linear functionals in X*, the dual extremum problems associated with the primal problem. Necessary and sufficient conditions are established so that the "duality gaps" between pairs of primal-dual problems do not exist, that is, the extremal or the optimal values of the primal and dual problems are equal. These conditions prominently involve the conjugate cone …

Set Covering Algorithm And Computer Program Usetco Programmer's Manual, Harvey M. Salkin

Research Reports from the Department of Operations

These pages discuss the code USETCO which contains an algorithm for the set covering problem. (That is, minimize cx, subject to Ex ≥ e, x≥0, and x integer; where E is an m by n matrix of 1's and 0's, and e is an m vector of 1's.) The special problem structure permits a rather efficient, yet simple, solution procedure which is basically a zero-one search of the single branch type coupled with linear programming and a suboptimization technique. The algorithm has been found to be highly effective for a good number of relatively large problems. Problems from 30 to …

A Dental Management Game, Hamilton Emmons, Arnold Reisman, Susumu Morito, J. Shultz, Joe Mantell, N. Segal, Edward J. Green, Ronald Occhionero

Research Reports from the Department of Operations

This paper discusses progress on the development of a computer aided game to teach various management skills to dental students as well as to dental practitioners. The game first deals with the decisions concerning the establishment of a practice, e. g., preferences regarding location, the form (solo, associate or group) of practice, staff patterns and salaries, purchasing of facilities, etc. Next considered are decisions which must be made daily, e. g., patient and worker scheduling, control of supplies, etc. Performance is evaluated in terms of income, costs, care delivered, patient waiting time and personnel utilization.

Scheduling Independent Jobs On Parallel Machines To Minimize Two Objectives Related To Job Tardiness, Thomas S. Nunnikhoven

Research Reports from the Department of Operations

This research considers the scheduling on parallel machines of jobs which are independent and simultaneously available for processing and which have due dates and known processing times. Cases in which the machines are identical and in which they operate at different speeds are both covered. The principal objective treated is finding a schedule which meets all due dates and uses the minimum number of machines required for that criterion. It is shown that methods which solve for this first objective can easily be modified for a second, that of minimizing maximum tardiness on a given number of machines. An assumption …

Some Problems In Location Theory, Marcos J.A.P. Pacca

Research Reports from the Department of Operations

This dissertation deals with four problems in Location Theory, in which all the distances involved are Euclidean distances. The first problem is the Min-max-one-location problem with arbitrary positive weights. An algorithm to solve the problem of minimizing a ratio of a convex quadratic over a positive linear function subject to a convex set bound by linear constraints is given. It is shown that this ratio problem can be solved by parametrically solving quadratic programming problems. Complementary Pivot Theory is used (Cottle and Dantzig [10]). It is shown that Hearn's Fractional Dual [26], which provides the solution to the Min-max-one-location problem …

Optimization Models For Offshore Oil Field Development, Luiz Roberto Ferreira Da Costa

Research Reports from the Department of Operations

Three optimization models for offshore oil field development are studied: the platform location problem, the dual completion problem, and the scheduling problem in the drilling operation. Either more efficient procedures are proposed, or a better characterization for the optimal policy is obtained. The decision variables in the platform location problem are: the number, size and location of drilling platforms, and the allocation of targets to platforms so as to develop a field at a minimum cost. The "exact" solution for this problem is found when the platform cost is an increasing convex function of its size, via a linear programming …

The M/G/1 Queue In Heavy Traffic And Its Covariance Function, Teunis J. Ott

Research Reports from the Department of Operations

Let X(t) be the virtual waiting-time process of a stable M|G|1 queue. Let R(t) be the covariance function of the stationary process X(t), B(t) the busy-period distribution of X(t); and let E(t) = P{X(t) = 0|X(0) = 0}. For X(t) some heavy-traffic results are given, among which limiting expressions for R(t) and its derivatives and for B(t) and E(t). These results are used to find the covariance function of stationary Brownian Motion on [0,∞).

1975-07-31, Morehead State Board Of Regents

Morehead State Board of Regents Agenda Books and Meeting Minutes

No abstract provided.

The Feasibility Of A Faculty Research Profiles Information System At Case Western Reserve University, Burton V. Dean, John N. Barrer

Research Reports from the Department of Operations

This paper reports on the methods used and results obtained in the evaluation of the feasibility of a faculty research profile information system. The study is based on a previous study which established the flow of administrative and background information during the various stages of the research process.* A methodology for use in the conduct of this study is developed, along with questionnaires and interviewing procedures. Statistical tests are developed and applied to determine the specific reasons for information processing improvements. Alternative systems for accomplishing information requirement goals are proposed and evaluated using cost and benefit criteria. A sequential strategy …

The Covariance Function Of The Virtual Waiting-Time Process In An M/G/1 Queue, Teunis J. Ott

Research Reports from the Department of Operations

Let R(t) be the covariance function of the stationary virtual waiting-time process of a stable M|G|1 queue. It is proven that if R(t) exists, i.e., if the service-times have a finite third movement, then R(t) is positive and convex on [0,∞), with an absolutely continuous derivative R' and a bounded, non-negative second derivative R". Also, lim R(t) = 0 and R" can not be chosen monotone. Contrary to a finding by Beneš (1957) it is proven that ∫₀^∞ R(t) dt < ∞ if and only if the service-times have a finite fourth moment.

Scheduling Intermittently Arriving Jobs To Minimize The Weighted Number Tardy, Keki R. Dadachanji

Research Reports from the Department of Operations

The problem of scheduling n jobs on one machine to minimize the weighted number tardy is considered, when job arrival times, processing times, due dates and weights are given constants. It is assumed that jobs may be interrupted at any time, and later resumed without penalty. A taxonomy of special cases for this problem is developed. Polynomial-bounded algorithms are given for some of the special cases and some other special cases are shown to belong to the set of NP-complete problems. A branch-bound solution is presented for the case in which all jobs have the same weight. The algorithm is …

A Comparison Of Research Administration Costs And Performances At A Sample Of Major U. S. Universities, Burton V. Dean, John N. Barrer, Raghavendra N. Rao

Research Reports from the Department of Operations

As part of an ongoing study of research administration methods and procedures at Case Western Reserve University, a survey of research administrators at a sample of major U.S. institutions of higher education was conducted. A written questionnaire was completed at the time of the interview. Information was collected on (1) annual university budget and research income; (2) faculty size and number of proposals submitted and awarded; and (3) research administration size, manpower, distribution, income, budget, and task performance. Research administration performance was evaluated for each of the institutions. A measure of performance was positively correlated with the annual research income …

Forest City/University Hospitals Telemedicine System Project Evaluation: Progress Report Ii, F. J. Staub, D.W. Eastwood, W. Pittard, Edward A. Ernst, J. S. Gravenstein, Hamilton Emmons, Teunis J. Ott, Burton V. Dean, Arnold Reisman, P. Chou, Thomas George, Marylou Kiley, Pauline Crawford, Ronella Fields, Willie Callaham Lambright, Dennis L. Snyder, Charles S. Berry, M. Sabio

Research Reports from the Department of Operations

In June 1974, a task force comprised of faculty from the School of Medicine and faculty and graduate students from the Department of Operations Research, Case Western Reserve University, in association with the staff of Forest City Hospital, Cleveland, initiated an evaluation study of a proposed Telemedicine Link between University Hospitals of Cleveland and Forest City Hospital. The different stages of the Telemedicine study completed to date are: a definition of the project goals and objectives; formulation of parameters relevant to an evaluation of Telemedicine's impact on the quality of care delivered; design of data gathering instruments; and, finally, the …

Optimal Design Of Networks With Node Weighted Functions, Shailesh J. Mehta

Research Reports from the Department of Operations

The design of optimal networks on a set of points is an interesting and important problem. However, the majority of work done so far is in flow problems and on graphs with arc weights. In this dissertation, the problem of constructing optimal networks with node weights is considered. The objective function depends on the weights assigned to the nodes and the degree of the nodes. Special cases of the general design problem of constructing networks or graphs with node weights and arc weights are also treated. The intent of the research was to develop polynomially bounded algorithms. The general design …

Economic Lot Size Determination In Multi-Item, Multi-Level Production-Inventory Systems With Acyclic Network Structures, Phiroz P. Darukhanavala

Research Reports from the Department of Operations

The research presented here is oriented toward a company organized as a multi-level, production-inventory system, which can be represented by an acyclic network structure. In our model, we consider dependent stochastic demand and incorporate the concept of service level along with the associated costs of carrying safety stocks at different levels of the manufacturing chain. We develop and test an algorithm that specifically derives the dependent demand distributions and then computes optimal order quantities based on a trade-off between setup, holding, and safety stock costs at all levels. The algorithm, which is iterative in nature, can be easily incorporated into …

Antipollution Activities In Input-Output Analysis: An Application To Water Quality Management, Kwang-Soo Lee

Research Reports from the Department of Operations

This thesis is concerned with the following problems involved in the analysis of economic systems with antipollution activities: (i) a mathematical formulation of the problem of determining their equilibrium, (ii) a solution technique for this model, (iii) approximation of interregional transaction figures, and (iv) the formulation of a general model for water quality management of a watershed basin economy. Extending the Leontief input-output model, an economic system with pollution abatement activities is formulated as a complementarity problem with upper bounding constraints. The complementarity problems for M-matrices are studied, and it is shown that the model is always feasible and that …

Corporate Tax Structures And A Special Class Of Set Partitioning Problems, Chien-Hua Lin

Research Reports from the Department of Operations

This thesis discusses a special integer program, a complete set partitioning problem in context of a real world situation; namely, that of paying unemployment compensation tax. In the United States, employers are required to pay contribution to a state administered unemployment compensation fund to protect the employees in the event of unemployment. A corporation can often be considered as a composition of subsidiaries, each with their own accounting data. In many states including Ohio, these subsidiaries may be treated individually or in various aggregations, each aggregation becoming a subsidiary, prior to computing the contribution payment. The payment is a function …

Determining And Responding To The Demand For Residential Products In Metropolitan Areas, Barry Marshall Richmond

Research Reports from the Department of Operations

This thesis describes the development and subsequent use of a comprehensive model of the community development process designed to aid management in evaluating the long-term demand for residential products within a given metropolitan area (or series of areas) and then in determining an optimal development response to this demand. The presentation is divided into three parts, followed by a set of Technical Appendices. The first two parts treat the two tasks identified above. The final part is devoted to a presentation of some results which were obtained with the model in an actual application to a new community presently under …

Optimal Rearrangement Of Objects, Ashok Kumar Mittal

Research Reports from the Department of Operations

This dissertation deals with finding an optimal way of changing a given arrangement to a (specified) new arrangement. Two types of problems are considered. In the first type of problem, there is no extra storage space available for storage of the objects. The rearrangement is done by a sequence of pairwise exchanges. In the second type of problem there is extra storage space available for storage. The rearrangement in this case is done by a vehicle which moves one object at a time. Problems are further classified by type of arrangement as basic cycles, cycles--and general arrangement- and by the …

Transient Distributions Of Some Processes Related To The Wiener Process With Drift, Teunis J. Ott

Research Reports from the Department of Operations

This report presents an alternative derivation for the transient distribution of Brownian Motion Processes on [0,∞) with drift and a reflecting boundary at zero. The result is applied to determine the joint distributions of the maximum and minimum values of the process X_H over specified intervals. The Brownian Motion Process is also examined on (−∞,∞) with drift but without boundaries. The findings extend known results to cases with drift, offering broader insights into the behavior of Brownian motion processes under these conditions.

Critical Path Problem Under Assignment Constraints With The Number Of Men Less Than The Number Of Activities, S. Kumar, D. Wagner, R. Chandrasekaran

Research Reports from the Department of Operations

The paper concerns the problem of determining the shortest time of project completion under the constraint that the number of men available is less than the number of activities to be performed. Additionally, it is assumed that men differ in skills. In order to solve this problem, two related problems are formulated. The first one does not take into account the constraint that a man cannot perform more than one job at a time. The second one is discrete in time and is used to make a solution of the former problem feasible. An iterative procedure for solving the basic …

A Survey And Critical Analysis Of Current Literature On The Post Audit Of Capital Expenditure, Gene Albert Katke

Dissertations and Theses

Several writers in the field of capital budgeting have charged that present day literature on the subject fails to adequately address the post audit phase of capital expenditure programs. This study is essentially a survey of current literature designed to determine the validity of this charge. To accomplish this task, the study compares each author’s published views on selected post audit factors with other responses from the literature and analyzes collective agreements and differences. Armed with this information, an attempt is made to provide answers to three pertinent questions:

l. Does general agreement exist among writers on what constitutes the …

1975-05-09, Morehead State Board Of Regents

Morehead State Board of Regents Agenda Books and Meeting Minutes

No abstract provided.

Progress Report Intensive Care For Neonates In Ohio, I, Teunis J. Ott, M. Anvari

Research Reports from the Department of Operations

The Neonatal Project is a research project undertaken by faculty and staff from the departments of Operations Research in the School of Management and Pediatrics in the School of Medicine, Case Western Reserve University. Phase I of the project (Jan. 1 - June 30, 1975) is funded by the State of Ohio Department of Health. The ultimate purpose of the project is to produce well documented recommendations on locations of Intensive Care Units for Newborns (to be called "NICU's") in the state of Ohio, and if possible, to produce well documented recommendations on the modes of transportation to be used …

Aggregating Corporate Subsidiaries Under A Given Tax Structure, Harvey M. Salkin, Burton V. Dean, Chien-Hua Lin

Research Reports from the Department of Operations

Employers in the United States are required to pay contribution to a state administered unemployment compensation fund to protect the employees in the event of unemployment. Contributions imposed by compensation laws are in reality taxes on the right to employ, and may be considered as direct costs. A corporation can often be considered as a composition of subsidiaries, each with their own accounting data. In many states including Ohio, these subsidiaries may be treated individually or in various aggregations, each aggregation becoming a subsidiary, prior to computing the contribution payment. The payment is a function of a known tax schedule …