Simple Ranking Methods for Allocation of One Resource
暂无分享,去创建一个
[1] B. O. Koopman. The Theory of Search , 1957 .
[2] A. Charnes,et al. The Theory of Search: Optimum Distribution of Search Effort , 1958 .
[3] J. Tobin. Liquidity Preference as Behavior towards Risk , 1958 .
[4] Jacques de Guenin. Optimum Distribution of Effort: An Extension of the Koopman Basic Theory , 1961 .
[5] W. Karush. A General Algorithm for the Optimal Distribution of Effort , 1962 .
[6] Harvey J. Everett. Generalized Lagrange Multiplier Method for Solving Problems of Optimum Allocation of Resources , 1963 .
[7] W. Sharpe. A Simplified Model for Portfolio Analysis , 1963 .
[8] Fred Hanssmann. Operations research techniques for capital investment , 1968 .
[9] Arthur M. Geoffrion,et al. Elements of large-scale mathematical programming , 1969 .
[10] Olvi L. Mangasarian,et al. Nonlinear Programming , 1969 .
[11] L. Bodin,et al. Optimization Procedure for the Analysis of Coherent Structures , 1969 .
[12] Harvey J. Greenberg,et al. Surrogate Mathematical Programming , 1970, Oper. Res..
[13] Donald W. Katzner. Static Demand Theory , 1970 .
[14] G. Nemhauser,et al. Integer Programming , 2020 .
[15] Philip Wolfe,et al. Validation of subgradient optimization , 1974, Math. Program..
[16] Meir G. Kohn,et al. The theory of search , 1974 .
[17] Hanan Luss,et al. Technical Note - Allocation of Effort Resources among Competing Activities , 1975, Oper. Res..
[18] Clovis de Faro,et al. A Simple Algorithm for Stone's Version of the Portfolio Selection Problem , 1975, Journal of Financial and Quantitative Analysis.
[19] M. Padberg,et al. Simple Criteria for Optimal Portfolio Selection , 1976 .
[20] Arnoldo C. Hax,et al. On the Solution of Convex Knapsack Problems with Bounded Variables. , 1977 .