Abstract The article focuses on some designs of multidimensional accounting system. An accounting system is viewed as a structured database capable of supporting a class of queries or requests for data. These queries could be specific requests for data, such as the current balance of an account or the value of an inventory item, or more complicated requests, such as a profit and loss statement or a balance sheet. The traditional accounting system is oriented toward financial reports and therefore, only financial data are stored. Information on an hourly wage earner, such as number of parts produced on a given day, the average number of defects or the value added to the part, normally is not stored with the accounting data. By storing the value added information, an employee can be evaluated on terms of wage times hours versus the value added to the product. Authors' contention is that an accounting system can be viewed as an information system that supports a specific class of queries. The paper presents a process for designing a common data structure, which will support the given set of queries.

Abstract Recently in the accounting literature two different directions have been taken toward research into the theory of accounting and information systems. One approach seeks to modify conventional accounting to take advantage of increasing computer capabilities, while the second approach advocates including more diversified types of information in accounting reports. Although different, both attempts reflect the accountant's desire to serve users of accounting data better and in a more efficient manner. Toward this end the objective of this paper has been to develop a new approach to accounting and information systems which both generalizes and unifies these two directions of research. The approach presents a framework within which one can work on both the theoretical issues concerned with extending accounting to provide more types of information and the practical issues surrounding the efficient implementation of an accounting system on modern computer equipment. In order to accomplish our objective, a very general definition of accounting was assumed, one which concentrated on the concepts of "communication" and "economic event . The accounting system could then be constructed around a "data base" which consists of descriptions of economic events, ( K + 1)-tuples of the form (c, x 1 , x 2 , &haelip;x k ) where c denotes a binary event code and x 1 , x 2 , &haelip;x k are values of the characteristic used to describe the event. In this multidimensional system, we are not restricted to a single valuation scheme and efficiencies are gained in storage by using a description space of variable dimension. Also because the data base in any company is likely to become quite complex, a generalized concept of an account was introduced. The method described would permit economic events to be classified, sorted, and sequenced in a variety of ways to handle flexible needs of the users.

Abstract The article presents information on programming, profit rates and pricing decisions. Many, perhaps most, linear programming models whose objective is profit maximization assume a short run situation under conditions of perfect competition. The management techniques they develop serve as prescriptive guides to the solution of current operating problems and are devoid of any pricing considerations. It is true that fixed costs are usually lurking behind the set of constraints subject to which the 1.p. model is to be solved. The distinction between the 1.p. model under conditions of perfect competition or of monopoly has been pointed out. A full-cost pricing 1.p. model for price fixers has been explained. First, the 1.p. model for two activities and a constant markup was illustrated by Problem 1 and the implications for pricing considered. Next, the result of bid restrictions on activity levels was found to be that the full-cost model becomes an integer programming. Problem 2 was used to introduce the dual problem together with parametric analysis and to discuss planning and capital budgeting implications of the model. Finally, the difficulties arising where differential rates of return exist between activities were demonstrated by Problem 4.

Journal Article Welfare Economics and the Theory of Second Best Get access Otto A. Davis, Otto A. Davis Carnegie Institute of Technology Search for other works by this author on: Oxford Academic Google Scholar Andrew B. Whinston Andrew B. Whinston University of Virginia Search for other works by this author on: Oxford Academic Google Scholar The Review of Economic Studies, Volume 32, Issue 1, January 1965, Pages 1–14, https://doi.org/10.2307/2296327 Published: 01 January 1965

Abstract : For the solution of convex quadratic programming problem, a number of efficient methods have been developed. The most well-known methods are the Simplex method for quadratic programming, discovered by Dantzig and, together with the closely related dual method, further developed by van de Panne and Whinston, and methods developed by Beale, Houthakker and Wolfe. The authors have shown that the methods by Beale and Houthakker can be considered as variants of the Simplex method for quadratic programming or are closely related to it. Compared with the Simplex tableaux used in linear programming, quadratic programming tableaux have a larger size. A tableau for a linear programming problem with n variables and m constraints had (m + l) (n + l) nontrivial elements, while a Simplex tableau for a quadratic programming problem with the same number of variables and constraints has (m + n + l) elements. In the Simplex method for quadratic programming, a considerable number of tableaux will be in standard form, which means that the tableau can be divided in symmetric and skew-symmetric parts, so that the number of elements to be computed and stored is reduced by nearly one half. However, nonstandard tableaux do not have these symmetry properties, so that all elements of these tableaux must be computed. This paper gives a reformulation of the Simplex method in which all tableaux are in standard form, so that use can be made of the symmetry properties in every tableau. The actual number of nontrivial elements in a quadratic Simplex tableau is therefore decreased by a factor of 2. This symmetric formulation has other advantages as well. (Author)

Abstract : The paper reformulates Houthakker's capacity method for quadratic programming in the framework of the Simplex and dual methods for quadratic programming, thereby greatly reducing the conceptual and computational complexities of the method. It is shown that the method is applicable for all convex quadratic programming problems, including the case of a semi-definite matrix of the quadratic form and that of constraints in equality form. The method reduces in the linear programming case to a parametric version of the dual method. (Author)

The paper discusses the allocation of output among consumption and two types of capital with different gestation periods. Along an optimal path, we show that the imputed prices of capital goods, from the time they start production, do not exceed the prices of output, which are not less than the marginal instantaneous utility of consumption. A simple numerical example helps to illustrate some further implications of the model. RECENT PAPERS on optimal growth consider models of allocation of resources between consumption and investment. It is invariably assumed that investment results in an instantaneous increase in the stock of capital. Such assumptions obscure differences in the gestation periods among various capital goods. In [1] we discuss how a growth problem with time lags can be formulated and interpreted and explain the derivation of the necessary conditions for optimization. In this note we study the effects of differences in gestation periods on optimal investment plans for a growth problem including depreciation and population growth. Consider an economy where two capital goods and labor are used in the production of a single commodity. The per capita output at time t is given by the production function: f (kl, k2), where k, is the per capita stock of capital of type one, and k2 is the per capita stock of capital of type two. From now on, all variables will be per capita and we drop the designation. We assume the following:

Abstract ABSTRACT: The primary objective of this paper is to review the extant literature concerning auditing and EDP systems. We trace the flow of EDP-auditing development, note salient points of similarity and difference in techniques and relate these issues to the auditors' professional responsibilities. We hope that this will contribute to efficient consideration of the past literature by those developing an interest in auditing-EDP systems. We also hope that it will encourage efficient progress in the effort to develop new EDP-auditing research. With this in mind, we have included a short section on new approaches to EDP-auditing which presents information on systems design involvement, software standardization and formal system assertions.