Search

This paper presents an approach, similar to penalty functions, for solving arbitrary mathematical programs. The surrogate mathematical program is a lesser constrained problem that, in some cases, may be solved with dynamic programming. The paper deals with the theoretical development of this surrogate approach. [ABSTRACT FROM AUTHOR]

Copyright of INFOR is the property of Taylor & Francis Ltd and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

This paper describes an algorithm, based on a recently proposed method due to D.D. Morrison, for solving constrained optimization problems, and shows that it compares favorably with existing methods in several examples. [ABSTRACT FROM AUTHOR]

This paper is an extension of previously published work by Bernard O. Koopman to the general case of any number of tasks and any effect function. A systematic method for the numerical calculation of the maximum effect and its corresponding optimum distribution is presented in a form which is also suitable for solution on an automatic digital computer. For the special case of additive returns which saturate, a special graphical or numerical method for any number of tasks is presented with an example worked out in detail A similar method for multiplicative effects is sketched. [ABSTRACT FROM AUTHOR]

The article considers the use of sub-optimization to solve operations research problems. The reason why operations researchers have to sub-optimize is because it is so frequently impossible, either in principle or more frequently in practice, to calculate the consequences of any given action in terms of the appropriate high level criteria. The three classes of sub-optimizations are: those in which there is a one-dimensional objectives function; those in which the objectives function is multi-dimensional; and those which are partial in that objectives which are known to be important are left out because they are not subject to quantitative analysis. The article also provides examples of criterion problem which is simplest in industrial operations research.