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

Business Commons™

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

Business Administration, Management, and Operations

Institution
Keyword
Publication Year
Publication
Publication Type
File Type

Articles 17581 - 17610 of 19009

Full-Text Articles in Business

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

No. 76 1970 November Review Nov 1970

No. 76 1970 November Review

International Journal for Business Education

This initiative documents the preservation and digital release of the organization’s historical print archives, representing decades of scholarship in international business education. By converting legacy issues into accessible online formats, the project enhances global access to foundational research, pedagogical innovations, and early thought leadership that shaped the field. The digitized collection provides educators, researchers, and practitioners with a comprehensive record of evolving theories, instructional practices, and international business trends. Making these archival materials publicly available supports continued inquiry, enables longitudinal analysis, and strengthens the discipline’s historical continuity. This effort reflects the organization’s commitment to advancing international business education by ensuring …

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

A Special Linear Program, R. Chandrasekaran Nov 1970

A Special Linear Program, R. Chandrasekaran

Research Reports from the Department of Operations

This study addresses an optimization problem within a water resources system, focusing on the allocation of firm power. Demands for power occur in fixed ratios throughout the year, with total annual demand being substantial. The challenge lies in determining the total amount of power to supply for the year while ensuring it is distributed proportionally across months. At the beginning of a contractual period, a utility company must be promised a specified amount of power, delivered according to seasonal ratios (e.g., higher demand in winter). This paper formulates the problem in detail, providing a framework for optimizing the allocation of …

Go to article

Mechanical Rules For Trading In Wheat Futures, William J. Brown, Thomas B. Crabill, Burton V. Dean Nov 1970

Mechanical Rules For Trading In Wheat Futures, William J. Brown, Thomas B. Crabill, Burton V. Dean

Research Reports from the Department of Operations

An answer to the question of whether to buy, wait, or sell when trading in wheat futures is sought through the use of heuristic mechanical trading rules. Two basic models are examined. In the first, an updated price band is maintained about the daily close. The relationship between a given day's closing price and the previous day's price band is the signal to buy, wait, or sell. In the second approach, a linear regression is calculated for closing prices over time, and a tolerance band is established about the calculated line. Both fixed and variable bands are considered. Whenever a …

Go to article

A Pseudo Dual All-Integer Algorithm For The Set Covering Problem, Harvey M. Salkin, Ronald D. Koncal Nov 1970

A Pseudo Dual All-Integer Algorithm For The Set Covering Problem, Harvey M. Salkin, Ronald D. Koncal

Research Reports from the Department of Operations

A modified linear programming method for the inequality or equality set covering problem (i.e., minimize cx subject to Ex ≥ b or Ex = b, where E is a zero-one matrix, b is a column of ones, and c is a nonnegative integral row) is presented. The "almost unimodular" property of the (zero-one) constraint matrix suggested an algorithm in which one performs (dual) simplex interactions whenever unit pivots are available and adjoin Gomory all-integer cuts when they are not. Finiteness, time reducing criteria, the elimination of roundoff errors, and applications to enumerative schemes are discussed. Preliminary computational experience, being very …

Go to article

Stochastic Games With Semi-Markovian Rewards, R. Chandrasekaran, K.P. K. Nair, S. Subba Rao Oct 1970

Stochastic Games With Semi-Markovian Rewards, R. Chandrasekaran, K.P. K. Nair, S. Subba Rao

Research Reports from the Department of Operations

This paper examines a two-person zero-sum stochastic game with a finite number of states and non-terminating transitions. Unlike prior studies that focus on Markovian reward structures, this work explores semi-Markovian reward structures, deriving the equations that the game's value must satisfy. The study develops convergent algorithms for finite and infinite transitions, considering scenarios with and without discounting. Potential extensions include nonzero-sum games and time-horizon analyses. The model serves as a generalization of Jewell's semi-Markovian decision process in a game-theoretic context and extends the non-terminating stochastic game framework of Hoffman and Karp. This research broadens the scope of stochastic games by …

Go to article

Some Considerations Of A Queueing Model For Research And Development Project Flow, S. Subba Rao Oct 1970

Some Considerations Of A Queueing Model For Research And Development Project Flow, S. Subba Rao

Research Reports from the Department of Operations

The purpose of the present note is to consider the stochastic flow of projects in a Research and Development Organization. The flow of projects can be modeled as a stochastic network of queues. But the questions as to the details remain to be answered apart from the difficult and important question of how to analyze such systems. One has to concede that in the simplest case of time-homogeneous Poisson inputs exponential services and unlimited waiting space in between stations, the problem is solvable. But any relaxation of these conditions leads to new difficulties. Some of the problems raised in this …

Go to article

On The Evaluation Of Shortage Costs For Inventory Control, Muhittin Oral, Michael S. Salvador, Arnold Reisman, Burton V. Dean Oct 1970

On The Evaluation Of Shortage Costs For Inventory Control, Muhittin Oral, Michael S. Salvador, Arnold Reisman, Burton V. Dean

Research Reports from the Department of Operations

This paper summarizes work performed in evaluating shortage costs associated with stockouts for each of a manufacturer's seven thousand catalogued line items. A modified version of a decision tree model proposed by Yu Chang is employed in a determination of estimated unit shortage costs for a stratified random sample of items. The results are then extended to all items on the basis of an excellent correlation between the evaluated unit shortage costs and unit gross profits of the items in the sample.

Go to article

Optimal Location Of A Single Service Center Of Certain Types, K.P. K. Nair Oct 1970

Optimal Location Of A Single Service Center Of Certain Types, K.P. K. Nair

Research Reports from the Department of Operations

Considering communities to be interconnected by road network, Hakimi provided a graph theoretic method for finding the optimal location of a single service center, such as hospital or police station, minimizing largest distance from the service center. The same problem is considered in this paper when the region to be served is represented by a convex polygon with finite number of corner points and the distance between any pair of points in the polygon is taken to be the straight path between the two points. This problem is shown to be exact in certain cases though in some other cases …

Go to article

Some Considerations Of A Queueing Model For Research And Development Project Flow, S. Subba Rao Oct 1970

Some Considerations Of A Queueing Model For Research And Development Project Flow, S. Subba Rao

Research Reports from the Department of Operations

The purpose of the present note is to consider the stochastic flow of projects in a Research and Development Organization. The flow of projects can be modeled as a stochastic network of queues. But the questions as to the details remain to be answered apart from the difficult and important question of how to analyze such systems. One has to concede that in the simplest case of time-homogeneous Poisson inputs exponential services and unlimited waiting space in between stations, the problem is solvable. But any relaxation of these conditions leads to new difficulties. Some of the problems raised in this …

Go to article

Non Iterative Algorithm Form Solving Special Types Of Transportation Problems, Benjamin Lev Sep 1970

Non Iterative Algorithm Form Solving Special Types Of Transportation Problems, Benjamin Lev

Research Reports from the Department of Operations

Many transportation problems are such that, when origins and destinations are suitably indexed, the cost matrix contains elements along the main diagonal, a band above it, and a band below it, while the other elements of the cost matrix are infinite. A procedure has been developed which yields optimal solution to such tridiagonal problems in n steps for a n-origin, n-destination problem. A second model has been solved for a tridiagonal and a coupling column of the cost matrix. A third model, a four-diagonal one, has been partially solved. We suggested and showed a method to solve any other model …

Go to article

1970-08-26, Morehead State Board Of Regents Aug 1970

1970-08-26, Morehead State Board Of Regents

Morehead State Board of Regents Agenda Books and Meeting Minutes

No abstract provided.

Go to article

Investment Decisions Under Conditions Of Inflation: An Extension Of Theory, Arnold Reisman, Juri Pill Aug 1970

Investment Decisions Under Conditions Of Inflation: An Extension Of Theory, Arnold Reisman, Juri Pill

Research Reports from the Department of Operations

This paper extends existing quantitative methods for the economic evaluation of alternative investment proposals to the area of decision-making under conditions of non-negligible inflation. It includes a rigorous and consistent set of definitions and a generalized model which may be used in decisions involving several countries with different rates of inflation.

Go to article

On The Resource Allocation Problem With S-Shaped Utility Functions, Fabio M. Vicentini Aug 1970

On The Resource Allocation Problem With S-Shaped Utility Functions, Fabio M. Vicentini

Research Reports from the Department of Operations

A given amount "a" of a resource is allocated among n activities. A return Fi(xi) is obtained as a result of using xi units of the resource in activity "i". The problem is to find an allocation which maximizes the total return, that is, max Σ Fi(xi) s.t. Σ xi = a, xi ≥ 0 . In this paper we examine this well known problem under the assumption that the Fi's are "s-shaped" functions. In an economic context this assumption means that small allocations lead to essentially zero returns while large ones have a saturation effect, the "law of diminishing …

Go to article

Stochastic Variations Of Commonly Used Discounted Cash Flow Formulae, Arnold Reisman, Arza K. Rao Aug 1970

Stochastic Variations Of Commonly Used Discounted Cash Flow Formulae, Arnold Reisman, Arza K. Rao

Research Reports from the Department of Operations

This paper addresses challenges in applying discounted cash flow analysis as presented in standard texts on Engineering Economy, Capital Allocation Theory, Finance, Managerial Economics, and Economic Analysis. While traditional research texts assume deterministic values for independent variables and parameters, real-world applications often face uncertainty in determining these values. The paper proposes stochastic formulations to account for such uncertainty, detailing equations for various combinations and permutations of distributions. The findings aim to bridge the gap between theoretical models and the complexities of real-world financial decision-making.

Go to article

Some Efficient Dynamic Programming Algorithms For The Optimal Sequencing And Scheduling Of Water Supply Projects, Augustine O. Esogbue, Thomas L. Morin Jul 1970

Some Efficient Dynamic Programming Algorithms For The Optimal Sequencing And Scheduling Of Water Supply Projects, Augustine O. Esogbue, Thomas L. Morin

Research Reports from the Department of Operations

The sequencing and scheduling aspects of some important capacity expansion problems encountered in water resources development are studied. Dynamic programming algorithms are developed for both project timing problems and combined project selection and timing problems involving durable high cost water supply projects, which in the aggregate are subject to continuous-time demand requirements. The structure of the problems is successfully exploited in order to produce computationally efficient algorithms to solve problems of the dimension encountered in water resources systems. The computational superiority of these algorithms over conventional dynamic programming algorithms is discussed and illustrated via a numerical example.

Go to article

A Primal Method For Linear Programs With Coupling Rows And Columns, James K. Hartman Jul 1970

A Primal Method For Linear Programs With Coupling Rows And Columns, James K. Hartman

Research Reports from the Department of Operations

A considerable amount of work has been done in recent years on adapting the simplex method for linear programming to solving II large-scale specially structured linear programs. One class of methods which has proved to be quite useful in practice is the class of compact inverse methods ([16], Chapter 6). In these S methods, the special structure of the constraint matrix is 8 exploited to obtain a representation of the basis inverse matrix 1 which is more compact than the explicit inverse used in the revised simplex method. .Early proposals for this type of algorithm are found in [1] and …

Go to article

Motivating Employed Professionals, Kenneth M. Kamerman Jun 1970

Motivating Employed Professionals, Kenneth M. Kamerman

Anderson School of Management Theses & Dissertations

This study is directed to the problem of determining the properties of a task motivation method for employed professionals that will increase their productivity without creating employe-supervisor problems and without adding administrative burdens to the organization. The second problem is to identify a task motivation method which possesses the properties identified in the solution to the first problem. A descriptive-analytic approach to solve the first problem involves a review of human relations observations and conclusions bearing on motivation of employed professionals. The solution to the second problem identifies the contingency management motivation method, used in progressive education settings, as a …

Go to article

Parallel Operations Of Sequential Service Lines With Interline Transfer, Joseph A. Svestka, K.P. K. Nair Jun 1970

Parallel Operations Of Sequential Service Lines With Interline Transfer, Joseph A. Svestka, K.P. K. Nair

Research Reports from the Department of Operations

Scientific analysis of servicing processes has resulted in the development of sequential servicing where in a unit requiring service is processed through a fixed number of stages sequentially. A detailed study of such a system has been presented by Baling. In this paper a large servicing system consisting of a finite number of identical sequential service lines is considered. These lines are operated in parallel but interline transfers of units are made whenever advantageous. Using time homogeneous Markov Chain, a model is developed for analyzing the operation of such a system. It is shown that interline transfers of units result …

Go to article

A Generalized Upper Bounding Method For Doubly Coupled Linear Programs, James K. Hartman, Leon S. Lasdon Jun 1970

A Generalized Upper Bounding Method For Doubly Coupled Linear Programs, James K. Hartman, Leon S. Lasdon

Research Reports from the Department of Operations

The constraints of large linear programs can often be partitioned into independent subsets, except for relatively few coupling rows and coupling columns. The individual subsets may, for example, arise from constraints on the activity levels of subdivisions of a large corporation. Alternatively, such blocks may arise from activities in different time periods. The coupling rows may arise from limitations on shared resources or from combining the outputs of subdivisions to meet overall demands. The coupling columns arise from activities which involve different time periods (e.g storage), or which involve different subdivisions (e.g. transportation or assembly). The case with only coupling …

Go to article

A Taxonomic Analysis Of Financial Ratios, Denis Moffet Jun 1970

A Taxonomic Analysis Of Financial Ratios, Denis Moffet

Research Reports from the Department of Operations

Operations research techniques have been applied in fields like portfolio management, inventory control, and capital budgeting, but their use in accounting remains underdeveloped. This paper seeks to undertake a taxonomic analysis of financial ratios by developing a formal system for classifying the most commonly used financial ratios, identifying the most important dimensions measured within that set of ratios, and determining the relative importance of each ratio in measuring each dimension.

Go to article

Measurement Of Output In A System Of Social Agencies, Arnold Reisman, Samuel J. Mantel Jr., Burton V. Dean, Norman C. Eisenberg, Elliot Markus, Allan L. Service Jun 1970

Measurement Of Output In A System Of Social Agencies, Arnold Reisman, Samuel J. Mantel Jr., Burton V. Dean, Norman C. Eisenberg, Elliot Markus, Allan L. Service

Research Reports from the Department of Operations

An on-going research project being performed at the Jewish Community Federation of Cleveland is described. Background of the project is given. The basis and components of a proposed output measurement mechanism are discussed briefly so that the details of implementing that measurement model may be considered in perspective. Three aspects of the implementation process are examined: the generation of service-client package values, the development of quality criteria weights and utility curves, and the collection of the requisite objective data. In each case, an objective is defined, the conceptual and mechanical details of the implementation process are given, and the results …

Go to article

Some Manpower Planning Models Based On Educational Attainment, Warren L. Balinsky Jun 1970

Some Manpower Planning Models Based On Educational Attainment, Warren L. Balinsky

Research Reports from the Department of Operations

This paper is concerned with analytical solutions to manpower planning models. Dynamic feed-forward models are developed and analyzed. Optimal closed-form solutions minimizing given objective functions for the above models are developed. The models considered treat people as the only flow variable. The flow originates with some particular population of eligible persons and then traces them through the educational and economic sectors of the model. An objective function is developed, composed of educational costs and manpower "inventory" or penalty costs. The educational costs are for teacher and administrative salaries, investment in buildings and grounds, etc. The manpower penalty costs are for …

Go to article

A Generalized Upper Bounding Algorithm For Multicommodity Network Flow Problems, James K. Hartman, Leon S. Lasdon Jun 1970

A Generalized Upper Bounding Algorithm For Multicommodity Network Flow Problems, James K. Hartman, Leon S. Lasdon

Research Reports from the Department of Operations

An algorithm for solving min cost or max flow multicommodity flow problems is described. It is a specialization of the simplex method, which takes advantage of the special structure of the multicommodity problem. The only non-graph or non-additive operations in a cycle involve the inverse of a working basis, whose dimension is the number of currently saturated arcs. Efficient relations for updating this inverse are derived.

Go to article

Modeling And Simulation Of Urban Transportation Systems: A Survey, Juri Pill Jun 1970

Modeling And Simulation Of Urban Transportation Systems: A Survey, Juri Pill

Research Reports from the Department of Operations

This paper is essentially a survey of traffic network modeling techniques used in transportation studies and planning, a broad field with voluminous literature. It does not pretend to be exhaustive, but most of the relevant work is discussed, and an attempt is made to delineate an apparent trend in research approaches. Transportation research has grown in the past decade to the point where new journals have sprung up and funding is available; the problems of people movement are certainly not highest on the scale of current priorities, but improvements are in order. As with most other issues, transportation cannot be …

Go to article

Deterministic And Stochastic R & D Resource Allocation Models, Donald C. Friedel Jun 1970

Deterministic And Stochastic R & D Resource Allocation Models, Donald C. Friedel

Research Reports from the Department of Operations

The primary concern of this dissertation is R&D resource allocation. Although the discussions are directed toward allocating resources to R&D projects, the techniques developed may be applied to any type of project whose characteristics comply with the assumptions imposed upon the models. Since resource allocations to projects are obtained indirectly from the scheduling of the projects, project scheduling plays a significant role in this paper. Project selection, a third problem of concern to R&D management, is also considered, to a lesser extent, throughout the thesis. Projects are assumed to consist of phases that are arranged either in a network fashion …

Go to article

Analysis Of The Exploratory Development Project Evaluation Experiment, Burton V. Dean, Samuel Jackson Mathis, Benjamin Lev, Joseph A. Svestka, Mauricio Adler Jun 1970

Analysis Of The Exploratory Development Project Evaluation Experiment, Burton V. Dean, Samuel Jackson Mathis, Benjamin Lev, Joseph A. Svestka, Mauricio Adler

Research Reports from the Department of Operations

This paper details an exploratory development project evaluation (EDPE) experiment aimed at developing and testing a method to obtain quantitative data using subjective judgments for evaluating research and development (R&D) projects. The experiment, conducted at the U.S. Army Materiel Command, utilized a modified DELPHI Method involving a panel of twelve members. Key findings include the panelists’ ability to reach consensus in two rounds, the sufficiency of a small number of factors for linear model formulation, and the absence of significant bias. The results suggest potential for further experimentation to validate the EDPE method’s predictive capability.

Go to article

A Model For The Development Of Measures Of Effectiveness In Airlift Planning, Alexander Brandt Jun 1970

A Model For The Development Of Measures Of Effectiveness In Airlift Planning, Alexander Brandt

Research Reports from the Department of Operations

A mathematical model of a military airlift problem is formulated. The model includes an algorithm for the solution of the Traveling Salesman problem. The model's solution is utilized in the allocation of aircraft to routes so that the cost of an airlift operation is minimized. A procedure for finding the optimum solution to the Traveling Salesman problem is programmed for the UNIVAC - 1108 digital computer using the FORTRAN language. The computer program was given preliminary testing on 3 digit random number distance matrices and was shown to be operationally practical and economical. For illustrative purposes an example is presented …

Go to article

1970-05-30, Morehead State Board Of Regents May 1970

1970-05-30, Morehead State Board Of Regents

Morehead State Board of Regents Agenda Books and Meeting Minutes

No abstract provided.

Go to article

First Prev Next Last