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

Digital Commons Network™

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

Business

Institution
Keyword
Publication Year
Publication
Publication Type
File Type

Articles 15781 - 15810 of 18175

Full-Text Articles in Entire DC Network

Mcdonnell Douglas Spirit, Eastern Edition, September 1973, Mcdonnell Douglas Sep 1973

Mcdonnell Douglas Spirit, Eastern Edition, September 1973, Mcdonnell Douglas

McDonnell / McDonnell Douglas Corporate Newsletters

McDonnell Douglas Spirit, Eastern Edition, September 1973 corporate newsletter.


Some Results For A Special Non-Stationary Markov Chain, S. Subba Rao Sep 1973

Some Results For A Special Non-Stationary Markov Chain, S. Subba Rao

Research Reports from the Department of Operations

In this report we consider a nonstationary Markov chain whose transition probabilities vary periodically in time. Such a Markov chain is in between a stationary and completely nonstationary chains. Such chains can be used to model stochastic situations where seasonalities or other such periodic phenomena are present. The structure of the process is examined in terms of the transition probability matrices for each period.


1973-08-02, Morehead State Board Of Regents Aug 1973

1973-08-02, Morehead State Board Of Regents

Morehead State Board of Regents Agenda Books and Meeting Minutes

No abstract provided.


A Study Of The Utility And Validity Of Earnings Forecasts, Michael P. Howell Aug 1973

A Study Of The Utility And Validity Of Earnings Forecasts, Michael P. Howell

Honors Theses

According to William J. Casey, the past Chairman of the Securities and Exchange Commission, and recently appointed Under Secretary of State and Economic Affairs, forecasting should be the first and most important priority of all areas of management and public accounting. Only large institutional investment corporations have had access to such "useful" information when needed. Consequently, large investors are able to make more objective and intelligent investment decisions. A recent study determined that few investment corporations veritably have access to pertinent internal forecasting models. In fact, when interviewed, many executives claimed that even if they could procure such information, they …


A Method For Screening Student Applications For Award Of Financial Aid, S. Subba Rao, N. Mohan Aug 1973

A Method For Screening Student Applications For Award Of Financial Aid, S. Subba Rao, N. Mohan

Research Reports from the Department of Operations

The objectives of the present study are the following: 1) To study the profile of a student who declined the offer of admission (with or without financial aid). 2) To study the profile of a student who accepted the offer of admission (with or without aid) and joined the Department of Operations Research. 3) To discriminate between the above two types of students in (2) and (3). 4) To suggest how information in (3) can be used to make financial aid awards.


Bimatrix Markovian Decision Processes And Stochastic Ratio Games, Vijaykumar V. Aggarwal Aug 1973

Bimatrix Markovian Decision Processes And Stochastic Ratio Games, Vijaykumar V. Aggarwal

Research Reports from the Department of Operations

Markov decision processes and stochastic games have been considered in this dissertation. An infinite planning horizon is assumed. Both discounted and undiscounted cash flows have been treated. In Markov decision process, a two-dimensional reward structure is considered and the objective criterion is to maximize the rate of return. It has been shown that a pure stationary optimal policy exists, whenever the rewards are finite and, in particular, the investment part of cash flow is positive. In the case of discounted cash flows, the optimal policy depends on the initial state the process is in. Finite algorithms have been proposed to …


A Decision Model Of The Countdown Process, Burton V. Dean Aug 1973

A Decision Model Of The Countdown Process, Burton V. Dean

Research Reports from the Department of Operations

This paper examines two key decision problems in the countdown process: determining which tests and operations should be performed, and establishing their optimal sequence and duration. The authors posit that while potential actions can be enumerated at the start of the countdown, the actual sequence will depend on the system's state during the process. The paper aims to develop a methodology for solving these decision problems, viewing them as an adaptive process. Various modeling approaches are discussed, including game-theoretic models using "trees" to illustrate different countdown strategies, and search theory to find optimal action sequences. The authors also mention considering …


Two Viewpoints On Accounting For Catastrophe Losses, American Institute Of Certified Public Accountants. Committee On Insurance Accounting Jul 1973

Two Viewpoints On Accounting For Catastrophe Losses, American Institute Of Certified Public Accountants. Committee On Insurance Accounting

Guides, Handbooks and Manuals

No abstract provided.


Roles Of Systems Specialists, Harvey H. Shore Jul 1973

Roles Of Systems Specialists, Harvey H. Shore

Management Adviser

No abstract provided.


What People Are Writing About, G. Richard Chesley, Grover L. Porter Jul 1973

What People Are Writing About, G. Richard Chesley, Grover L. Porter

Management Adviser

No abstract provided.


Cash Management: Forecasting For Profit, Paul J. Beehler Jul 1973

Cash Management: Forecasting For Profit, Paul J. Beehler

Management Adviser

No abstract provided.


Applying Statistical Sampling Methods To Auditing, Glenda A. Ried Jul 1973

Applying Statistical Sampling Methods To Auditing, Glenda A. Ried

Woman C.P.A.

No abstract provided.


Woman Cpa Volume 35, Number 3, July, 1973, American Woman's Society Of Certified Public Accountants, American Society Of Women Accountants Jul 1973

Woman Cpa Volume 35, Number 3, July, 1973, American Woman's Society Of Certified Public Accountants, American Society Of Women Accountants

Woman C.P.A.

No abstract provided.


Are The Needs Of Industry For Data Processing Programmers Being Adequately Supported By Technical Training Programs In Oklahoma, Dale I. Sare Jul 1973

Are The Needs Of Industry For Data Processing Programmers Being Adequately Supported By Technical Training Programs In Oklahoma, Dale I. Sare

Electronic Theses & Dissertations

In 1970 over 40,000 computers were in use in the United States and 1,000 more on order from manufacturers. Every major newspaper had published at least one news article or editorial about computers during 1970. These articles reported how computers function, the speed at which they function, their limitations and how they have, and are continuing to become, a complex part of the business world and social affairs of man.


Computational Experience With An Enumerative Algorithm For The Set Covering Problem With Base Constraints, Harvey M. Salkin, Chien-Hua Lin Jul 1973

Computational Experience With An Enumerative Algorithm For The Set Covering Problem With Base Constraints, Harvey M. Salkin, Chien-Hua Lin

Research Reports from the Department of Operations

An algorithm for the classical set-covering problem with additional "base" constraints is presented. The "base" constrained set covering problem is: Minimize cx, subject to Ex ≥ e, xj = 0 or 1 (j = 1,...,n), and Bx ≤ d. Here E is an m by n matrix of zeros and ones, e is an m column of ones, c and d are nonnegative vectors, and B is a nonnegative array having row diagonal structure. The algorithm is basically a zero-one single branch enumeration with linear programming and other feasibility criteria. A "heuristic" is used which sometimes finds an initial solution …


Row Generalized Linear Programs, R. Chandrasekaran Jul 1973

Row Generalized Linear Programs, R. Chandrasekaran

Research Reports from the Department of Operations

A concept of row generalized linear programs is introduced. Illustrations of potential application for this concept are provided, along with methods for solving the row generalized linear program. The duality between row and column generalized linear programs is discussed.


Mcdonnell Douglas Spirit, Eastern Edition, July 1973, Mcdonnell Douglas Jul 1973

Mcdonnell Douglas Spirit, Eastern Edition, July 1973, Mcdonnell Douglas

McDonnell / McDonnell Douglas Corporate Newsletters

McDonnell Douglas Spirit, Eastern Edition, July 1973 corporate newsletter.


The Complementarity Problem Of Mathematical Programming, Arie Tamir Jun 1973

The Complementarity Problem Of Mathematical Programming, Arie Tamir

Research Reports from the Department of Operations

We consider the nonlinear complementarity problem: Find x in R^n such that: x ≥ 0 , f(x) ≥ 0 (1) x^T(f(x))=0 (2) where f is a given mapping satisfying f(0) = 0 and q is a vector in R^n. We say that the problem is feasible if (1) has a solution. f is said to be a Q-function if (1)-(2) has a solution for each q in R^n, and it is a P-function if the solution is unique for each q. Classes of functions are defined using properties of the complementarity problem (1)-(2), and sufficient conditions which guarantee that a …


Reviews - Writings In Accounting, Marie E. Dubke Jun 1973

Reviews - Writings In Accounting, Marie E. Dubke

Woman C.P.A.

No abstract provided.


Gochurch : A Simulation Model For Forecasting Church Growth, John J. Rasmussen Jun 1973

Gochurch : A Simulation Model For Forecasting Church Growth, John J. Rasmussen

Research Reports from the Department of Operations

This paper examines the rapid growth of evangelical churches in America and introduces a simulation-based forecasting model, GOCHURCH, to aid in planning for future attendance. The model addresses the challenges faced by churches striving to meet aggressive growth targets while managing facility and program capacity. GOCHURCH predicts attendance numbers and provides structured descriptions of individuals influencing the growth process, using a Markovian framework to categorize the population into five states. A supporting questionnaire gathers data relevant to forecasting, and an initial simulation output demonstrates the model’s applicability to capacity planning. By analyzing membership trends and offering predictive insights, GOCHURCH helps …


Optimal Flows In Networks With Positive Gains, Klaus Truemper May 1973

Optimal Flows In Networks With Positive Gains, Klaus Truemper

Research Reports from the Department of Operations

Simple, yet powerful non-simplex algorithms are developed for max flow and min-cost flow problems in networks with positive gains. It is shown that these algorithms are computationally better than existing non-simplex algorithms. A strong relationship between the min-cost flow problem in pure networks and the max flow problem in networks with positive gains is used to demonstrate how algorithms for one problem can be transformed into ones for the other problem.


1973-05-12, Morehead State Board Of Regents May 1973

1973-05-12, Morehead State Board Of Regents

Morehead State Board of Regents Agenda Books and Meeting Minutes

No abstract provided.


Computer-Assisted Planning In The Public Sector, Robert A. Nielsen, Vincent R. Locascio May 1973

Computer-Assisted Planning In The Public Sector, Robert A. Nielsen, Vincent R. Locascio

Management Adviser

No abstract provided.


What People Are Writing About, James M. Krueger, Kenneth Rosenzweig, William S. Hawthorne May 1973

What People Are Writing About, James M. Krueger, Kenneth Rosenzweig, William S. Hawthorne

Management Adviser

No abstract provided.


Sample Of Statistics, Brian P. Boas May 1973

Sample Of Statistics, Brian P. Boas

Management Adviser

No abstract provided.


An Investigation To Identify Management Topics To Be Included In The Business Administration Program At Utah State University, Richard E. Zackrison May 1973

An Investigation To Identify Management Topics To Be Included In The Business Administration Program At Utah State University, Richard E. Zackrison

All Graduate Plan B and other Reports, Spring 1920 to Spring 2023

The development of management techniques which are in keeping with the changing environment has been termed "management science." Thrall points out that "management science has not yet reached a stage in which standardization or freezing of educational programs is desirable. " Further, he states that "we should explore new educational ideas, keeping in mind that many management scientists will become managers."

Management science may be in the rut described by Gordon and Howell. They assert that those businessmen and educators who fail to keep pace with change are forced to "plod in a rut they dug long ago. For them …


Operations Research Model For Competitive Bidding, Harold Kerzner May 1973

Operations Research Model For Competitive Bidding, Harold Kerzner

All Graduate Theses and Dissertations, Spring 1920 to Summer 2023

The purpose of this paper is to demonstrate a model for competitive bidding. The model is based upon a thorough knowledge of the competitors. The model is designed to optimize a solution, given the desired profit and the minimum probability of success. Various cases are considered showing how the quantitative and qualitative nature of the competitors' bidding history may influence the final optimized solution.

In order to optimize a solution, a reduction in total manhours is usually needed. The reduction in manhours increases the risk of a cost overrun upon job completion. The magnitude of the risk, as well as …


The Nursing Process And Its Relationship To The Quality Of Nursing Care, Arlene H. Johnson May 1973

The Nursing Process And Its Relationship To The Quality Of Nursing Care, Arlene H. Johnson

Loma Linda University Electronic Theses, Dissertations & Projects

The purpose of this study was to determine the effect of the systematic use of the nursing process on the quality of nursing care. Quality nursing care was defined as being achieved when the patient's nursing care needs are identified and plans made to assist the patient with these needs.

It was hypothesized that the quality of nursing care would be improved by the participation of the team leaders in a series of classes on the nursing process. This improvement in quality nursing care would be evidenced by a higher correlation between the patient's needs perceived by the nurse and …


One Machine Sequencing To Minimize Mean Flow Time With Minimum Number Tardy, Hamilton Emmons May 1973

One Machine Sequencing To Minimize Mean Flow Time With Minimum Number Tardy, Hamilton Emmons

Research Reports from the Department of Operations

The problem of sequencing n jobs on one machine is considered, under the multiple objective of minimizing mean flow time with the minimum number of tardy jobs. A simple procedure is first proposed to schedule for minimum flow time with a specified subset of jobs on time. This is used in conjunction with Moore's Algorithm in a simple heuristic producing good and often optimal schedules. A branch-bound algorithm is presented to produce the optimal schedule efficiently with the help of several theorems which eliminate much branching.


Mcdonnell Douglas Spirit, Eastern Edition, May 1973, Mcdonnell Douglas May 1973

Mcdonnell Douglas Spirit, Eastern Edition, May 1973, Mcdonnell Douglas

McDonnell / McDonnell Douglas Corporate Newsletters

McDonnell Douglas Spirit, Eastern Edition, May 1973 corporate newsletter.