Patent
Method and apparatus for efficient resource allocation.
Karmarkar Narendra Krishna
- 28 Mar 1986
127
TL;DR: In this paper, a method and apparatus for optimizing resource allocations is disclosed which proceeds in the interior of the solution space polytope instead of on the surface (as does the simplex method), and instead of exterior to the polyto-polytope (as do the ellipsoid method).
read more
Abstract: A method and apparatus for optimizing resource allocations is disclosed which proceeds in the interior of the solution space polytope instead of on the surface (as does the simplex method), and instead of exterior to the polytope (as does the ellipsoid method). 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. 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 optimization method is sufficiently fast to be useful in real time control systems requiring more or less continual allocation optimization in a changing environment, and in allocation systems heretofore too large for practical implementation by linear programming methods.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Patent
Method and system for continuous integrated resource management
Harvey A. Parad
- 14 Nov 1991
TL;DR: In this paper, a method for continuous real-time management of heterogeneous interdependent resources is described, which comprises using multiple distributed resource engines to maintain timely and precise schedules, and action controls, and identifying and responding to rapidly changing conditions in accord with predetermined requirements, relationships, and constraints.
420
Patent
Method and system for scheduling, monitoring and dynamically managing resources
William R. Rassman,Bradley M. Berman,Scott Blau,Andrew Chiang +3 more
- 08 Sep 1988
TL;DR: Indicia as mentioned in this paper is a method for the prospective scheduling, periodic monitoring and dynamic management of a plurality of interrelated and interdependent resources using a computer system, which includes providing a data base containing information about the resources and graphically displaying utilization and availability of the resources as a function of time.
360
Patent
System and method for allocating resources of a retailer among multiple wholesalers
Steven P. Spiegelhoff,Joseph Kraetz +1 more
- 15 Jan 1993
TL;DR: In this paper, a computerized system is proposed to search the warehouse of a primary wholesaler and the warehouses of a number of secondary wholesalers and allocating resources so as to meet designated ordering criteria or constraints for the primary warehouse of the retailer.
277
Patent
System and method for ensuring order fulfillment
Joseph A. Jenkins,Phoebe Hsiang,Rosalie Seaman,Boina Kanth,Grace Bestland +4 more
- 29 Oct 2001
TL;DR: In this paper, the authors present a system and method whereby companies can optimally resolve the conflicts with respect to product availability by creating time-phased inventory plans that meet customer requirements while minimizing inventory and maximizing profit.
275
Patent
Optimal portfolio replication
Ron S. Dembo
- 25 Aug 1998
TL;DR: In this paper, the authors propose a method and apparatus for determining an optimal replicating portfolio for a given target portfolio, which involves an initial step wherein a user defines a target portfolio to be replicated, a set of available market instruments from which the replicated portfolio may be created, a predefined set of future scenarios, a horizon date, and a minimum profit to be attained.
248
References
The ellipsoid method and its consequences in combinatorial optimization
TL;DR: The method yields polynomial algorithms for vertex packing in perfect graphs, for the matching and matroid intersection problems, for optimum covering of directed cuts of a digraph, and for the minimum value of a submodular set function.
Design and optimization of networks with dynamic routing
TL;DR: An efficient heuristic optimization method is introduced for solution of the LP routing problems, which greatly improves computational speed with minimal loss of accuracy and project computational requirements for a 200-node design problem, which is the estimated size of the intercity Bell System dynamic routing network in the 1990s.
270
Servicing and real-time control of networks with dynamic routing
TL;DR: In this paper, the authors illustrate techniques for changing network routing patterns in planned and demand servicing to counteract the effects of forecast errors, and present call-by-call simulation results for real-time routing enhancements to the basic routing algorithms.
70
Patent
Adaptive control of a dynamic system or process
Grimshaw Kenneth Percy
- 08 Feb 1982
TL;DR: An adaptive control for a dynamic system or process which can be described mathematically as having dominant eigen values and which utilizes the phase response variation with frequency and more precisely uses the rate of change of phase with frequency to measure dynamic characteristics of the system or processes and by comparison with known optimum values of rates of change in phase based on a criterion as herein defined determines the changes required to controlled parameters or to a controlling computer in order to achieve and maintain optimum or near optimum performance of the dynamic systems or process.
26
Patent
Apparatus for speeding up digital division in radix-2n machine
Hitohisa Asai
- 26 Mar 1982
TL;DR: In this article, the acceleration method that guarantees to give a small convergence rate, 1/(2D-3 ), of the power series, was proposed with at most three successive applications of acceleration constants.
11