The primary goal of this study was to propose an algorithm using mathematical programming to detect earnings management practices. In order to evaluate the ability of this proposed algorithm, the traditional statistic...
详细信息
The primary goal of this study was to propose an algorithm using mathematical programming to detect earnings management practices. In order to evaluate the ability of this proposed algorithm, the traditional statistical models are used as a benchmark vis-a-vis their time series counterparts. As emerging techniques in the area of mathematical programming yield better results, application of suitable models is expected to result in highly performed forecasts. The motivation behind this paper is to develop an algorithm which will succeed in detecting companies that appeal to financial manipulation. The methodology is based on cutting plane formulation using mathematical programming. A sample of 126 Turkish manufacturing firms described over 10 financial ratios and indexes are used for detecting factors associated with false financial statements. The results indicate that the proposed three-phase cutting plane algorithm outperforms the traditional statistical techniques which are widely used for false financial statement detections. Furthermore, the results indicate that the investigation of financial information can be helpful towards the identification of false financial statements and highlight the importance of financial ratios/indexes such as Days' Sales in Receivables Index (DSRI), Gross Margin Index (GMI), Working Capital Accruals to Total Assets (TATA) and Days to Inventory Index (DINV). Copyright (C) 2009 John Wiley & Sons, Ltd.
This study deals with the development of a programming procedure for the analysis and design of general problems of elastic bodies in contact. The procedure utilizes a simplex-type algorithm. The technique is applied ...
详细信息
This study deals with the development of a programming procedure for the analysis and design of general problems of elastic bodies in contact. The procedure utilizes a simplex-type algorithm. The technique is applied to Hertzian-type contacts, and contacts of beams on elastic foundations. The selection of initial separations in the latter case for the optimal load distribution is considered as an example for the design scheme. The technique gives an effective and relatively inexpensive means of treating this class of problems.
In this paper, a generalized ratio invexity concept has been applied for single objective fractional programming problems. ii concept which has been invoked seems to be more general than the one used earlier by Khan a...
详细信息
In this paper, a generalized ratio invexity concept has been applied for single objective fractional programming problems. ii concept which has been invoked seems to be more general than the one used earlier by Khan and Hanson in such contexts. Further, duality results for fractional programs have also been obtained. (C) 1999 Academic Press.
The classic diet model inspired the least cost meals model and software developed for mainframe computers in the early sixties. During the seventies, techniques were introduced for incorporating food preferences into ...
详细信息
The classic diet model inspired the least cost meals model and software developed for mainframe computers in the early sixties. During the seventies, techniques were introduced for incorporating food preferences into menu planning systems. Software for preference maximized menu planning emerged. Further research in the eighties produced a new approach to menu planning using mathematical programming and related microcomputer software.
Under F-convexity, F-concavity/F-pseudoconvexity, F-pseudoconcavity, appropriate duality results for a pair of Wolfe and Mond-Weir type symmetric dual nonlinear programming problems in complex spaces are established. ...
详细信息
Under F-convexity, F-concavity/F-pseudoconvexity, F-pseudoconcavity, appropriate duality results for a pair of Wolfe and Mond-Weir type symmetric dual nonlinear programming problems in complex spaces are established. These results are then used to develop second order F-convexity, F-concavity, second order F-pseudoconvexity, F-pseudoconcavity, and appropriate second order symmetric dual nonlinear programming problems in complex spaces. (C) 2003 Elsevier Inc. All rights reserved.
Modeling languages have become one of the most important tools in helping to make mathematical programming technology easier to use. Having proven its usefulness, more attention is now being given to the improvement o...
详细信息
Modeling languages have become one of the most important tools in helping to make mathematical programming technology easier to use. Having proven its usefulness, more attention is now being given to the improvement of the design and implementation of these languages. This paper reviews some of the main issues that arise in the design of modeling languages and which can be applied to any algebraic modeling language to help evaluate its strengths and weaknesses. Existing modeling languages are used to illustrate these issues.
New second order optimality conditions for mathematical programming problems and for the minimization of composite functions are presented. They are derived from a general second order Fermat's rule for the minimi...
详细信息
New second order optimality conditions for mathematical programming problems and for the minimization of composite functions are presented. They are derived from a general second order Fermat's rule for the minimization of a function over an arbitrary subset of a Banach space. The necessary conditions are more accurate than the recent results of Kawasaki (1988) and Cominetti (1989);but, more importantly, in the finite dimensional case they are twinned with sufficient conditions which differ by the replacement of an inequality by a strict inequality. We point out the equivalence of the mathematical programming problem with the problem of minimizing a composite function. Our conditions are especially important when one deals with functional constraints. When the cone defining the constraints is polyhedral we recover the classical conditions of Ben-Tal-Zowe (1982) and Cominetti (1990).
This study compares the predictive performance of several mathematical programming models. Using the cropping patterns, yields and crop gross margins of 18 farms over a period of 5 years we compare the models' opt...
详细信息
This study compares the predictive performance of several mathematical programming models. Using the cropping patterns, yields and crop gross margins of 18 farms over a period of 5 years we compare the models' optimum solutions with observed crop distributions after the Reform of the EU Common Agricultural Policy of 1992. The results show that the best prediction corresponds to a model that includes expected profit and a qualitative measure of crop riskiness. The results suggest that, in order to obtain reliable predictions, the modelling of farmers' responses to policy changes must consider the risk associated with any given cropping pattern. Finally, we test the ability of the proposed model to reproduce the farmers' observed behaviour with equally good performance under conditions of limited data availability. (C) 2003 Elsevier Science Ltd. All rights reserved.
We develop the concept of average shadow price in mathematical programming. This concept measures the value of resources along a direction in an average sense, in contrast to traditional marginal analysis;it serves as...
详细信息
We develop the concept of average shadow price in mathematical programming. This concept measures the value of resources along a direction in an average sense, in contrast to traditional marginal analysis;it serves as a useful standard price for management decisions about resources, particularly when there are nonconvexities. We give it an economic interpretation. We also develop simple computational schemes for obtaining and improving the bounds of the average shadow prices and illustrate them in two important classes of nonconvex programs: convex maximization problems and mixed integer programs.
A new approach to a solution of a nonlinear constrained mathematical programming problem involving r-invex functions with respect to the same function eta is introduced. An eta-approximated problem associated with an ...
详细信息
A new approach to a solution of a nonlinear constrained mathematical programming problem involving r-invex functions with respect to the same function eta is introduced. An eta-approximated problem associated with an original nonlinear mathematical programming problem is presented that involves eta-approximated functions constituting the original problem. The equivalence between optima points for the original mathematical programming problem and its eta-approximated optimization problem is established under r-invexity assumption. (c) 2005 Elsevier Inc. All rights reserved.
暂无评论