Open Access. Powered by Scholars. Published by Universities.®

Business Administration, Management, and Operations Commons™

Open Access. Powered by Scholars. Published by Universities.®

Case Western Reserve University

Discipline
Keyword
Publication Year
Publication
Publication Type

Articles 961 - 990 of 1196

Full-Text Articles in Business Administration, Management, and Operations

Technical Management And Control Of Large-Scale Urban Studies: A Comparative Analysis Of Two Cases, Juri Pill Jun 1971

Technical Management And Control Of Large-Scale Urban Studies: A Comparative Analysis Of Two Cases, Juri Pill

Research Reports from the Department of Operations

This paper examines the factors influencing the success or failure of large-scale urban studies, focusing on two Cleveland-based projects: the Downtown Agency for Transportation Action (ALPHA) and the Output Evaluation of the Jewish Community Federation agencies (BETA). Using a systematic framework of qualitative descriptors, the study analyzes the processes, outcomes, and "soft" differences, such as interdisciplinary communication, derived from participant surveys. Key findings highlight the importance of technical collaboration between consultants and clients, flexible objectives, and individuals capable of bridging disciplinary and political gaps. The research also identifies challenges in integrating rational decision-making tools when isolated from end-users and navigating …

Go to article

Supply And Demand Of Teachers And Supply And Demand Of Ph.D'S 1971-1980, Burton V. Dean, Arnold Reisman, Edward Rattner, Alfred R. Michenzi, Sun K. Kim, S. Srinivasan Jun 1971

Supply And Demand Of Teachers And Supply And Demand Of Ph.D'S 1971-1980, Burton V. Dean, Arnold Reisman, Edward Rattner, Alfred R. Michenzi, Sun K. Kim, S. Srinivasan

Research Reports from the Department of Operations

This study addresses concerns over a potential surplus of teachers and Ph.D. holders in the 1970s at Case Western Reserve University. A systematic approach was developed, including mathematical models linking student flows in higher education to teacher and Ph.D. production, methods for estimating teacher demand at various educational levels, and models for forecasting Ph.D. demand in industry and government. Statistical techniques were employed to derive parameters from historical data, supplemented by a consensus method to account for changes in technology, budget constraints, and policy. The study generated actionable recommendations and a methodology for the Office of Education to plan for …

Go to article

Generalized Upper Bounding Methods In Production Scheduling And Distribution, Leon S. Lasdon Jun 1971

Generalized Upper Bounding Methods In Production Scheduling And Distribution, Leon S. Lasdon

Research Reports from the Department of Operations

Generalized Upper Bounding (GUB) is an efficient specialization of the Simplex Method for problems with disjoint rows of ones. The principles of the method are briefly reviewed, and an application to multi-item production scheduling is presented. A multifacility extension of the scheduling model is formulated and solved using GUB in conjunction with Bender's Partitioning algorithm. Application of GUB to integrated production and distribution problems is also discussed.

Go to article

Quantitative Techniques For Research Program Planning In Structural Mechanics, Burton V. Dean Jun 1971

Quantitative Techniques For Research Program Planning In Structural Mechanics, Burton V. Dean

Research Reports from the Department of Operations

The Committee* has concluded that systematic procedures for research program formulation in structural mechanics have promise as methods for optimizing the allocation of research resources. Inasmuch as such procedures are not helpful in anticipating scientific breakthroughs, twenty-five per cent (25%) of the over-all research budget should be allocated, on the discretionary judgment of the Branch Staff Members, to fundamental research which has broad promise of application to Naval Missions. The matrix method is considered as the most promising planning technique. The Committee has recommended that a trial program be established within the Structural Mechanics Branch of the Office of Naval …

Go to article

Application Of Preparedness Maintenance Policy, Vasant B. Kaujalgi Jun 1971

Application Of Preparedness Maintenance Policy, Vasant B. Kaujalgi

Research Reports from the Department of Operations

This report describes a maintenance policy of a nonmonitored part in the presence of a set of monitored parts. This policy is called (ni,N) policy. The applications of this policy to the maintenance of a standby power unit and to a fire extinguisher have been described with the actual data. The optimal values for these two examples have been computed. A possible extension of this model to a system consisting of a set of non-monitored parts in the presence of a set of monitored parts has been proposed.

Go to article

A Systems Approach To Performance Evaluation In Baseball, Melvin Brown Jun 1971

A Systems Approach To Performance Evaluation In Baseball, Melvin Brown

Research Reports from the Department of Operations

This study examines baseball as a stochastic system, developing quantitative measures to evaluate player performance as batters and fielders. These measures offer significant advantages over traditional indices such as batting average, fielding average, and slugging percentage. The research also provides a prototype for creating performance metrics applicable in business, social, and governmental contexts. The study addresses the strategic problem of determining an optimal batting order by formulating it as a cubic assignment problem solvable via dynamic programming. A simplified version of baseball is defined to generate representative performance data. A computer program, running on an RCA Spectra 70/45 in time-sharing …

Go to article

Analysis And Codification Of The Pre And Post Operative Anesthesia Related Tasks, Arnold Reisman, Augustine O. Esogbue, Peter M. Lewy, Vasant B. Kaujalgi, A. Tamir May 1971

Analysis And Codification Of The Pre And Post Operative Anesthesia Related Tasks, Arnold Reisman, Augustine O. Esogbue, Peter M. Lewy, Vasant B. Kaujalgi, A. Tamir

Research Reports from the Department of Operations

This study adapts traditional Industrial Engineering techniques to describe and codify tasks involved in anesthesia related services to patients in a large teaching hospital. Application is directed towards tasks carried out outside the operating room.

Go to article

On The Uses Of Linear Regression Analysis In The Determination Of Continuous Utility Functions, Michael S. Salvador May 1971

On The Uses Of Linear Regression Analysis In The Determination Of Continuous Utility Functions, Michael S. Salvador

Research Reports from the Department of Operations

This paper investigates the characteristics of subjective estimation, specifically with regard to those techniques used in the measurement of utility as a function of some decision alternative. Regression analysis is applied to such bivariate estimates for the purpose of obtaining a generalized representation of the functional relationship expressed by same. Then, because of special properties of the subjective estimates themselves, certain statistics are shown to exist which simultaneously provide global measures of goodness of fit and consensus; furthermore, assuming the use of an iterative data collection process, there is also provided a measure of the rate of convergence of the …

Go to article

Integer Programming : Primal All-Integer Programming, Harvey M. Salkin May 1971

Integer Programming : Primal All-Integer Programming, Harvey M. Salkin

Research Reports from the Department of Operations

This work represents the seventh chapter of a forthcoming textbook entitled “Integer Programming” to be written by Harvey M. Salkin.

Go to article

Nonlinear Optimization With Upper And Lower Bounds, Vaughn E. Huckfeldt Apr 1971

Nonlinear Optimization With Upper And Lower Bounds, Vaughn E. Huckfeldt

Research Reports from the Department of Operations

Many nonlinear programming problems containing only upper and lower bounds are currently solved as unconstrained problems using transformation, or penalty methods of optimization. In this thesis it is shown that (1) Goldfarb's conjugate gradient algorithm can be simplified for NLP problems containing only upper and lower bounds, (2) the simplified algorithm requires less computer storage, and fewer multiplications per iteration with no loss in accuracy, and (3) the simplified algorithm is superior to transformation, or penalty methods when tested on published nonlinear test problems. A FORTRAN code for the nonlinear algorithm for upper and lower bounds, including complete documentation, is …

Go to article

Integer Programming : Dual All-Integer Integer Programming (Gomory [2]), Harvey M. Salkin Apr 1971

Integer Programming : Dual All-Integer Integer Programming (Gomory [2]), Harvey M. Salkin

Research Reports from the Department of Operations

This work represents the sixth chapter of a forthcoming textbook “Integer Programming” to be written by Harvey M. Salkin. The cutting plane algorithm for the integer program presented in this chapter was developed by Ralph Gomory in 1960. Its similarity to the fractional method (Chapter 3) is principally due to the utilization of the (lexicographic) dual simplex method and the maintenance of (lexicographic) positive columns. The basic approach is, however, different from the fractional technique: there is no optimization, generating a constraint, reoptimization, etc. Rather, inequalities are generated at each iteration starting with the very first. Further, each of these …

Go to article

An R & D Management Game, Klaus Truemper, Burton V. Dean Apr 1971

An R & D Management Game, Klaus Truemper, Burton V. Dean

Research Reports from the Department of Operations

The principles of R&D project management have been combined with an existing business management game. The paper outlines the critical elements of the game, provides an analysis of results-to-date, and suggests further extensions of the game.

Go to article

Computational Experience With A Traveling Salesmen Algorithm, Joseph A. Svestka, Vaughn E. Huckfeldt Apr 1971

Computational Experience With A Traveling Salesmen Algorithm, Joseph A. Svestka, Vaughn E. Huckfeldt

Research Reports from the Department of Operations

A formulation of the traveling salesman problem with more than one salesman is offered. The particular formulation has computational advantages over other formulations. Experience is obtained with an exact branch and bound algorithm employing both upper and lower bounds (mean run time for 55 city problems is one minute). Due to the special formulation, certain subtours may satisfy the constraints, thus reducing the search. A very good initial tour and upper bound are employed. The determination of these as well as the pathology of the formulation and the algorithm are discussed. No increase in computation time over the one salesman …

Go to article

Application Of Operations Research In Research Planning - A Case Study, Eric C. Johnson Mar 1971

Application Of Operations Research In Research Planning - A Case Study, Eric C. Johnson

Research Reports from the Department of Operations

In 1966 Kennecott Copper Corporation and its subsidiary, Chase Brass and Copper Company, launched a long range research effort--the Casting Laboratory-- designed to focus on the area of casting, specifically solidification and liquid metal processing. From the outset, the Casting Laboratory implemented formal activities for the identification and evaluation of research opportunities and activities so that the results could be used for long range planning of Casting Laboratory applied research programs. The author was responsible for these activities during 1967-1970. Drawing on specific activities carried out at the Casting Laboratory during the author's tenure there and activities in which he …

Go to article

Timeliness Of Library Materials Delivery: A Set Of Priorities, Arnold Reisman, J.P. Herling, M.G. Fancher Beeler, G. Kaminski, S. Srinivasan Mar 1971

Timeliness Of Library Materials Delivery: A Set Of Priorities, Arnold Reisman, J.P. Herling, M.G. Fancher Beeler, G. Kaminski, S. Srinivasan

Research Reports from the Department of Operations

This paper describes work performed to obtain a set of aggregate priorities and of values for the timeliness of delivery of library materials. The priorities were expressed through a set of weights and utility curves for eleven categories of materials handled in whole or in part by approximately 800 libraries located in the Greater Cleveland area. To obtain the needed data a panel of librarians representing several types of libraries used the Delphi Method of arriving at consensus. The results described in this paper are being used as input information in a project aimed at establishing optimum library delivery truck …

Go to article

Integer Programming : Dual Fractional Mixed Integer Programming (Gomory [2]), Harvey M. Salkin Mar 1971

Integer Programming : Dual Fractional Mixed Integer Programming (Gomory [2]), Harvey M. Salkin

Research Reports from the Department of Operations

This work represents the fourth chapter of a forthcoming textbook “Integer Programming” to be written by Harvey M. Salkin. The mixed integer programming algorithm developed by Ralph Gomory in 1960 and presented in this chapter is a direct extension of the integer programming algorithm discussed in Chapter 3. As before, the cutting plane technique utilizes the dual simplex method and allows fractional numbers in computation and is thus classified as "dual fractional." For ease of reference, we rewrite the basic approach.

Go to article

Integer Programming : Dual Fractional Integer Programming (Gomory [3]), Harvey M. Salkin Mar 1971

Integer Programming : Dual Fractional Integer Programming (Gomory [3]), Harvey M. Salkin

Research Reports from the Department of Operations

This work represents the third chapter of a forthcoming textbook “Integer Programming” to be written by Harvey M. Salkin. This chapter concerns itself with a cutting plane algorithm for the integer program which utilizes the dual simplex method and allows fractional numbers in computation - hence the "dual fractional" reference. We outline the basic approach for the integer program extension to the mixed case appears in the next chapter.

Go to article

An Efficient One-Dimensional Search Procedure For Barrier Function, Leon S. Lasdon, Richard L. Fox, Margery W. Ratner Mar 1971

An Efficient One-Dimensional Search Procedure For Barrier Function, Leon S. Lasdon, Richard L. Fox, Margery W. Ratner

Research Reports from the Department of Operations

Interior penalty functions are a popular approach for solving non-linear constrained optimization problems. Most current methods for minimizing such functions require a one-dimensional minimization along specified search directions, and this can be quite difficult, since the function approaches +∞ along the boundaries of the feasible set. A special purpose algorithm is described which alleviates this difficulty by using a simpler approximating function which also goes to infinity near the boundary. Numerical results are presented, showing that the number of function evaluations and computation time are reduced by factors of about three and two respectively. The ideas are easily extended to …

Go to article

Mathematical Modeling Optimization And Simulation Improve Large-Scale Finished Goods Inventory Management, Michael S. Salvador, Muhittin Oral, Arnold Reisman, Burton V. Dean Feb 1971

Mathematical Modeling Optimization And Simulation Improve Large-Scale Finished Goods Inventory Management, Michael S. Salvador, Muhittin Oral, Arnold Reisman, Burton V. Dean

Research Reports from the Department of Operations

This article describes an inventory control study conducted for a large manufacturing company involving the distribution of over 7,000 line items through six major warehouses and nearly 800 authorized distributors across the U.S. The study's success, rare in systems of this scale, addressed challenges including unfamiliarity with research methods, inadequate evaluation of parameters, and lack of practical recommendations. A task force comprising operations research faculty, graduate students, and company managers collaborated to optimize inventory control while maintaining a predetermined service level. The study focused on evaluating holding, setup, and shortage costs, with a particular emphasis on shortage costs. Extensive computer …

Go to article

Integer Programming : Introduction To Integer Programming, Harvey M. Salkin Feb 1971

Integer Programming : Introduction To Integer Programming, Harvey M. Salkin

Research Reports from the Department of Operations

This work represents the second chapter of a forthcoming textbook “Integer Programming” to be written by Harvey M. Salkin.

Go to article

Toward A R&D Laboratory Evaluation Methodology, Edward S. Esbeck, Nandakumar M. Balwally, S. Srinivasan, Arnold Reisman, Burton V. Dean, S. Subba Rao Jan 1971

Toward A R&D Laboratory Evaluation Methodology, Edward S. Esbeck, Nandakumar M. Balwally, S. Srinivasan, Arnold Reisman, Burton V. Dean, S. Subba Rao

Research Reports from the Department of Operations

The objective of this study is to develop a methodology for evaluating the effectiveness of R&D laboratories. The methods are applied to: (1) determining the input and output variables and (2) weighting and measuring the subjective variables. The results of the study indicate that laboratory effectiveness can be meaningfully quantified and hence evaluated. Further experimentation will be aimed at specific application to the Department of Defense’s Project REFLEX laboratory evaluation.

Go to article

Algorithms For Stochastic Games: A Comparison Of Efficiency, Arvind Jain Jan 1971

Algorithms For Stochastic Games: A Comparison Of Efficiency, Arvind Jain

Research Reports from the Department of Operations

There are two convergent algorithms for the solution of two person zero sum nonterminating stochastic games. The first one is developed by Hoffman and Karp and the second one is recently developed by Nair, Rao and Chandrasekaran. This paper presents computer programs for the two algorithms and computational experiments for comparing the efficiency of the algorithms. The results show that the second algorithm requires fewer iterations and moreover, the computation time for each iteration in this is significantly lower. Further, the results show that the ratio of the computation of time of the first algorithms to that of the second …

Go to article

A Faster Algorithm For Nonterminating Stochastic Games, K.P. K. Nair, S. Subba Rao, R. Chandrasekaran Jan 1971

A Faster Algorithm For Nonterminating Stochastic Games, K.P. K. Nair, S. Subba Rao, R. Chandrasekaran

Research Reports from the Department of Operations

In this paper a two person zero sum nonterminating stochastic game with a finite number of positions or states is considered. The movement of the game from state to state is jointly controlled by the two players depending on their choices of strategies from a finite number of alternatives in each state available to each player, respectively. Considering an infinite number of transitions, Hoffman and Karp have provided a convergent algorithm for the solution of this game. This paper presents a new convergent algorithm for the solution of the above game. The proof of convergence shows also the existence of …

Go to article

Demonstrating Compliance With Anti Discrimination In Employment Laws: Applications Of I.E./O.R., Arnold Reisman, Burton V. Dean, David E. Sands, Joseph A. Svestka Jan 1971

Demonstrating Compliance With Anti Discrimination In Employment Laws: Applications Of I.E./O.R., Arnold Reisman, Burton V. Dean, David E. Sands, Joseph A. Svestka

Research Reports from the Department of Operations

The Equal Pay Act of 1963 and the Title VII of the Civil Rights Act of 1964 make it illegal to discriminate against women in all aspects of employment, any state statutes to the contrary notwithstanding. In recent months, several cases were tried and many are currently pending. This paper discusses work performed in preparation for expert witness testimony for two cases, both of which were decided in Federal Court, one of which is before a higher court on appeal. Methods of engineering economics, actuarial science, industrial engineering, computer simulation, and statistical analysis are utilized to prove that discrimination existed …

Go to article

A Corporate Production Planning And Inventory Control Policy, C. Pekmezciler Jan 1971

A Corporate Production Planning And Inventory Control Policy, C. Pekmezciler

Research Reports from the Department of Operations

A company which produces a large number of different products is taken as an example where the production of each item is made alternately in lots on the same facility. Depending on their demand forecast and inventory levels lot sizes determined and produced for order or inventory. Description of the production facilities, production, products groups, their inventory and demand pattern in the past is given and discussed. Problems generally faced in overall planning and scheduling of this kind of a company are identified. A dynamic programming approach for aggregate production capacity decision for the case when aggregate production, inventory and …

Go to article

An Efficient Algorithm For Minimizing Barrier And Penalty Functions, Leon S. Lasdon Dec 1970

An Efficient Algorithm For Minimizing Barrier And Penalty Functions, Leon S. Lasdon

Research Reports from the Department of Operations

Constrained minimization is often done via interior penalty functions. Such functions can be very difficult to minimize using existing algorithms. In this paper, a new algorithm is described which is specially constructed to deal with such functions. It generates search directions by linearizing the objective and constraints about the current (interior) point, substituting these linearizations into the penalty function, and minimizing the result. Properties of the algorithm are derived, an efficient method for solving the direction finding problem is suggested, and computational results are presented. Preliminary results are also given on an extension to quasi-barrier and exterior penalty functions.

Go to article

A Computerized Data Base Of Hardware For Real-Time Information Systems, Donald E. Pauley Dec 1970

A Computerized Data Base Of Hardware For Real-Time Information Systems, Donald E. Pauley

Research Reports from the Department of Operations

A strategy for evaluation of the information processing requirements of real-time systems is presented with a discussion of future research necessary for the development of algorithms for the automatic design and evaluation of real-time information systems. A model for a database containing the characteristics of the hardware for real-time systems is developed.

Go to article

Stochastic Cash Flow Formulae Under Conditions Of Inflation, Arnold Reisman, Arza K. Rao Dec 1970

Stochastic Cash Flow Formulae Under Conditions Of Inflation, Arnold Reisman, Arza K. Rao

Research Reports from the Department of Operations

This paper presents time-dependent deterministic and stochastic variations of common discounted cash flow formulae with explicit consideration given to inflation. The cash flows, the rates of discount or of compounding, and the rate of inflation are allowed to vary with time in a deterministic as well as random fashion in equations for the Compound Amount of a Single Payment, Present Worth of a Single Payment, Amount of an Annuity, Periodic Deposits to Accumulate a Future Amount, Present Worth of an Annuity, Capital Recovery, and the Present Worth of a Deferred Annuity.

Go to article

Toward A Tuition Credit Allocation Methodology For Institutions Of Higher Learning, Arnold Reisman, Burton V. Dean, Robert R. White Dec 1970

Toward A Tuition Credit Allocation Methodology For Institutions Of Higher Learning, Arnold Reisman, Burton V. Dean, Robert R. White

Research Reports from the Department of Operations

This paper describes a methodology developed at the Case Western Reserve University for the purposes of more rationally keeping track of the costs of education and for the allocation of tuition revenue credits. One of the co-authors recognized the lack of a database necessary for more rational decision making. This paper reports on a methodology designed to provide the tuition element segment of such a base.

Go to article

Dynamic Programming And Fuzzy Allocation Processes, Augustine O. Esogbue, Vengalathur Ramesh Nov 1970

Dynamic Programming And Fuzzy Allocation Processes, Augustine O. Esogbue, Vengalathur Ramesh

Research Reports from the Department of Operations

The modeling and computational aspects of certain allocation processes are studied through a new concept in systems theory --- fuzzy decision making. The use of these concepts will generally provide models of better proximity to the systems modelled than the traditional deterministic and stochastic approaches. Some concepts of fuzzy systems theory are first introduced. Fuzzy dynamic programming models with their corresponding flow charts are then provided for an allocation problem arising in R&D systems. The computational problems in fuzzy algorithms are discussed. An extensive bibliography on fuzzy decision theory is included.

Go to article

First Prev Next Last