Methods and apparatus for efficient resource allocation

作者: Robert Joseph Vanderbei

DOI:

关键词: Mathematical optimizationLinear systemSystem of linear equationsFunction (mathematics)Convex polytopeMathematicsDescent directionVertex enumeration problemLinear programmingGradient descent

摘要: A method for optimizing resource allocations in commercial enterprises that are characterized by a linear set of constraint relationships the controllable parameters. The is particularly useful where cost function to be minimized piece-wise and convex, or such enterprise can conveniently decomposed into plurality relatively independent subentities correlating portion expresses interrelationships among subentities. More specifically, accordance with disclosed method, an system equations master problem subproblems leads need solve (corresponding problem) convex. solved modification algorithm invented Karmarkar. moves iteratively within polytope feasible solutions (as Karmarkar's invention) move direction improves value function. ascertained scaling determining descent through sensitivity vector evaluation, step size determined line search along chosen best allocation values direction. Whenever possible, corresponds steepest iterations repeated until optimal solution found, whereupon last evaluated (controllable parameters system) communicated system.

参考文章(16)
Edmund Szybicki, Maurice E. Lavigne, Alternate routing for a telephone system ,(1979)
Narendra Krishna Karmarkar, Jeffrey Clark Lagarias, Method and apparatus for optimizing system operational parameters through affine scaling ,(1987)
Jeffrey Clark Lagarias, Narendra Krishna Karmarkar, David Allen Bayer, Method and apparatus for optimizing system operational parameters ,(1987)
Komandur Ramu Krishnan, Teunis Jan Ott, Routing of network traffic ,(1986)
Stanley C. Eisenstat, Efficient Implementation of a Class of Preconditioned Conjugate Gradient Methods SIAM Journal on Scientific and Statistical Computing. ,vol. 2, pp. 1- 4 ,(1981) , 10.1137/0902001
Michael J. Todd, Bruce P. Burrell, An extension of Karmarkar's algorithm for linear programming using dual variables Algorithmica. ,vol. 1, pp. 409- 424 ,(1986) , 10.1007/BF01840455
Philip E. Gill, Walter Murray, Michael A. Saunders, J. A. Tomlin, Margaret H. Wright, On projected Newton barrier methods for linear programming and an equivalence to Karmarkar's projective method Mathematical Programming. ,vol. 36, pp. 183- 209 ,(1986) , 10.1007/BF02592025
Earl R. Barnes, A variation on Karmarkar's algorithm for solving linear programming problems Mathematical Programming. ,vol. 36, pp. 174- 182 ,(1986) , 10.1007/BF02592024