Methods and apparatus for efficient resource allocation

Details Methods and apparatus for efficient resource allocation Methods and apparatus for efficient resource allocation

1987-01-12

1989-12-05

MacDonald, Allen

Boots, shoes, and leggings

379113, 379221, 34082528, G06F 1520, H04Q 366, H04M 700

Patent

active

048856860

ABSTRACT:
A method and apparatus for optimizing resource allocations is disclosed which utilizes the Karmarkar algorithm to proceed in the interior of the solution space polytope. The constraints on the allocation variables (the surfaces of the polytope) are partitioned into sparse and non-sparse partitions to permit applying a perturbation formula permitting rapid inversion of the resulting perturbed matrix products. Each successive approximation of the solution point, and the polytope, are normalized such that the solution point is at the center of the normalized polytope using a diagonal matrix of the current solution point, also partitioned into sparse and non-sparse portions. The objective function is then projected into the normalized space and the next step is taken in the interior of the polytope, in the direction of steepest-descent of the objective function gradient and of such a magnitude as to remain within the interior of the polytope. The process is repeated until the optimum solution is closely approximated.
The resulting algorithm steps are advantageously applied to linear programming problems which involve allocations which are simultaneously dependent on a large number of constraints, problems which might other wise involve excessive amounts of computation time.

REFERENCES:
patent: 4345116 (1982-08-01), Ash et al.
patent: 4669113 (1987-05-01), Ash et al.
patent: 4704724 (1987-11-01), Kirshnan et al.
patent: 4744026 (1988-05-01), Vanderbei
patent: 4744027 (1988-05-01), Bayer et al.
patent: 4744028 (1988-05-01), Karmarkar
"A New Polynomial-Time Algorithm for Linear Programming", Combinatorica, vol. 4, N. Karmarkar, 1984, pp. 373-395.
"An Extension of Karmarkar's Algorithm for Linear Programming Using Dual Variables", Technical Report No. 648, Cornell University College of Engineering, Todd et al., Jan. 1985.
"Efficient Implementation of a Class of Preconditioned Conjugate Gradient Methods", SIAM J. Sci. Stat. Comput., vol. 2, No. 1, S. C. Eisenstat, Mar. 1981.
"Some Computational Experience and a Modification of the Karmarkar Algorithm", ISME Working Paper 85-105, Pennsylvania State University, Cavalier et al., Feb. 1985.
"A Variation on Karmarkar's Algorithm for Solving Linear Programming Problems", IBM T. J. Watson Research Center, Earl R. Barnes.
"On Projected Newton Barrier Methods for Linear Programming and an Equivalence to Karmarkar's Projective Method", Technical Report SOL 85-11, Systems Optimization Laboratory, Stanford University, Gill et al., Jul. 1985.

Affiliated with

Also associated with

Rating

Methods and apparatus for efficient resource allocation does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Methods and apparatus for efficient resource allocation, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Methods and apparatus for efficient resource allocation will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-2038345