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 15631 - 15660 of 18191

Full-Text Articles in Entire DC Network

1976 Faculty Meeting Minutes, Morehead State University Jan 1976

1976 Faculty Meeting Minutes, Morehead State University

Faculty Senate Records

Faculty meeting minutes of Morehead State University for 1976.


Elimination Of The Double Tax On Dividends; Statement Of Tax Policy 3, American Institute Of Certified Public Accountants Jan 1976

Elimination Of The Double Tax On Dividends; Statement Of Tax Policy 3, American Institute Of Certified Public Accountants

AICPA Professional Standards

No abstract provided.


Booking Policies For Outpatient Clinics, Joao Mello Da Silva Jan 1976

Booking Policies For Outpatient Clinics, Joao Mello Da Silva

Research Reports from the Department of Operations

This dissertation is concerned with models for booking patient-visits to physicians in the various departments of an outpatient clinic. A major outpatient clinic is used as the institutional basis for this study. A general description of the operations of the particular clinic is presented. A review of the literature is made. It is noted that most of the research for medical clinics is oriented towards minimizing both the physicians' idle time and the patients' waiting time. Similarities between the booking of passengers to airplane seats and patients to doctors are presented. Certain appointment types may generate appointment requests for the …


Integer Programming By Group Theory, Susumu Morito Jan 1976

Integer Programming By Group Theory, Susumu Morito

Research Reports from the Department of Operations

This report discusses various aspects of group theoretic algorithms in integer programming. A group theoretic algorithm transforms the original integer program to an optimization problem over an abelian group by relaxing nonnegativity, but not integrality, constraints on the variables corresponding to a linear programming basis. More specifically, columns of constraint coefficients, and the right hand sides in the group problem are elements of an abelian group with D elements, where D is the absolute value of the determinant of the linear programming basis. Several groups may be used to derive the optimization problem and the particular group selected indicates the …


Texas Eastern University Catalog, 1976-1977, University Of Texas At Tyler Jan 1976

Texas Eastern University Catalog, 1976-1977, University Of Texas At Tyler

Catalogs

No abstract provided.


Sample Engagement Letters For An Accounting Practice, American Institute Of Certified Public Accountants. Continuing Professional Education Division Jan 1976

Sample Engagement Letters For An Accounting Practice, American Institute Of Certified Public Accountants. Continuing Professional Education Division

Guides, Handbooks and Manuals

No abstract provided.


Management Advisory Services By Cpas : A Study Of Required Knowledge, Edward L. Summers, Kenneth E. Knight Jan 1976

Management Advisory Services By Cpas : A Study Of Required Knowledge, Edward L. Summers, Kenneth E. Knight

Guides, Handbooks and Manuals

No abstract provided.


Accounting For Your Future : A Challenging And Rewarding Professional Career, American Institute Of Certified Public Accountants (Aicpa) Jan 1976

Accounting For Your Future : A Challenging And Rewarding Professional Career, American Institute Of Certified Public Accountants (Aicpa)

Guides, Handbooks and Manuals

No abstract provided.


Accounting Hall Of Fame: Profiles Of Thirty-Six Members, Thomas J. Burns, Edward N. Coffman Jan 1976

Accounting Hall Of Fame: Profiles Of Thirty-Six Members, Thomas J. Burns, Edward N. Coffman

Accounting Hall of Fame Brochures

No abstract provided.


Working With The Revenue Code - 1976, Dominic A. Tarantino Jan 1976

Working With The Revenue Code - 1976, Dominic A. Tarantino

Guides, Handbooks and Manuals

No abstract provided.


The Impact Of Computer Generated Information On The Choice Activity Of Decision-Makers, Fred Luthans, Robert Koester Jan 1976

The Impact Of Computer Generated Information On The Choice Activity Of Decision-Makers, Fred Luthans, Robert Koester

Department of Management: Faculty Publications

Computerized information systems have a tremendous impact on management decision-making in all modern organizations. Electronic data processing (EDP) departments generate, coordinate, and disseminate much of the information that is used in modern management decision-making. How much influence is this computer generated information per se having on the choice activity of the human decision-maker? To date, very little is known about the answer to this question. Yet, if management is to improve the effectiveness of the decision-making process, the implications of computer generated information must be better understood. Organizationally, there is evidence that the computer has changed traditionalline- staff relationships. In …


Education For Expanding Computer Curriculums : A Symposium, Daniel L. Sweeney, American Institute Of Certified Public Accountants (Aicpa), American Accounting Association Jan 1976

Education For Expanding Computer Curriculums : A Symposium, Daniel L. Sweeney, American Institute Of Certified Public Accountants (Aicpa), American Accounting Association

Association Sections, Divisions, Boards, Teams

No abstract provided.


Discussion Draft: Board On Standards For Programs And Schools Of Professional Accounting, American Institute Of Certified Public Accountant. Board On Standards For Programs And Schools Of Professional Accounting Jan 1976

Discussion Draft: Board On Standards For Programs And Schools Of Professional Accounting, American Institute Of Certified Public Accountant. Board On Standards For Programs And Schools Of Professional Accounting

Association Sections, Divisions, Boards, Teams

No abstract provided.


A Difficult Small Integer Program, Harvey M. Salkin, Susumu Morito Dec 1975

A Difficult Small Integer Program, Harvey M. Salkin, Susumu Morito

Research Reports from the Department of Operations

An apparently difficult, yet small, integer program has been tested on what we believe to be is a most efficient computer system containing a group theoretic algorithm. Although a good solution was produced, the code did not converge in at most thirty seconds of UNIVAC 1108 time, and thus the integer program can serve as a principal test problem. The model represents a real world chemical blending situation and was received from E. I. DuPont DeNemours & Co., Inc.


Infinitely Divisible Non-Negative Matrices, Teunis J. Ott Dec 1975

Infinitely Divisible Non-Negative Matrices, Teunis J. Ott

Research Reports from the Department of Operations

It is proven that a finite non-negative matrix is infinitely divisible if and only if it can be imbedded in a continuous semigroup of non-negative matrices. A result by Doeblin and Doob, that every halfgroup of finite Markov matrices is continuous, is extended to finite non-negative matrices. Canonical forms are given for halfgroups of finite (possibly complex-valued) matrices and for commutating systems of finite non-negative matrices.


Economic Feasibility Of Early Retirement And Disinvestment In Farming, Charles Kraenzle, Marvin Kottke Nov 1975

Economic Feasibility Of Early Retirement And Disinvestment In Farming, Charles Kraenzle, Marvin Kottke

Storrs Agricultural Experiment Station

No abstract provided.


Grg System Documentation, Leon S. Lasdon, Allan D. Waren, Margery W. Ratner, Arvind Jain Nov 1975

Grg System Documentation, 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.


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

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.


Small Business: The Small Business — How Marketable Is It?, Barbara I. Rausch Oct 1975

Small Business: The Small Business — How Marketable Is It?, Barbara I. Rausch

Woman C.P.A.

No abstract provided.


1975 July - December, Office Of Communications & Marketing, Morehead State University. Oct 1975

1975 July - December, Office Of Communications & Marketing, Morehead State University.

Morehead State Press Release Archive, 1961 to the Present

Morehead State University press releases from July to December of 1975.


Profile: September, 1975. Vol: 8 No: 3, Blue Cross Of Florida, Inc., Blue Shield Of Florida, Inc. Sep 1975

Profile: September, 1975. Vol: 8 No: 3, Blue Cross Of Florida, Inc., Blue Shield Of Florida, Inc.

Florida Blue Archives Printed Materials

September 1975 employee monthly newsletter printed for employees, their families and friends.


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

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 Sep 1975

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 Sep 1975

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 Sep 1975

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 …


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

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 Aug 1975

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 Aug 1975

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 …


Mcdonnell Douglas Spirit, Eastern Edition, August 1975, Mcdonnell Dougla Aug 1975

Mcdonnell Douglas Spirit, Eastern Edition, August 1975, Mcdonnell Dougla

McDonnell / McDonnell Douglas Corporate Newsletters

McDonnell Douglas Spirit, Eastern Edition, August 1975 corporate newsletter.


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

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,∞).