US 6,625,577 B1Grant

Methods and apparatus for allocating resources in the presence of uncertainty

Issue Date:2003-09-23

•1 Claims

•7 Drawing Sheets

Abstract

A method of allocating resources in the presence of uncertainty is presented. The method builds upon deterministic methods and initially creates and optimizes scenarios. The invention employs clustering, line-searching, statistical sampling, and unbiased approximation for optimization. Clustering is used to divide the allocation problem into simpler sub-problems, for which determining optimal allocations is simpler and faster. Optimal allocations for sub-problems are used to define spaces for line-searches; line-searches are used for optimizing allocations over ever larger sub-problems. Sampling is used to develop Guiding Beacon Scenarios that are used for generating and evaluating allocations. Optimization is made considering both constraints, and positive and negative ramifications of constraint violations. Applications for capacity planning, organizational resource allocation, and financial optimization are presented.

Metadata

Inventor

Joel Jameson

Application Information

Application Number:US 09/777,336

Filing Date:2001-02-06

Priority Date:1999-01-21

Art Unit:7

Classifications

IPC:

G06F 1760

Field of Search:

705 7705 8705 1705400700 36700 95700 99

Patent Drawings (7 sheets)

Description

[0002] The present application is a continuation of non-provisional application Ser. No. 09/348,889 filed on Jul. 6, 1999, now U.S. Pat. No. 6,219,649.

[0003] By reference the following documents, submitted to the Sunnyvale Center for Innovation, Invention and Ideas (SCI³) under the US Patent and Trademark Office's Document Disclosure Program, are hereby included:

[0004] Copending Pat. Application Ser. No. 09/070,130, filed on Apr. 29, 1998 and issued on Feb. 29, 2000 as Pat. No. 6,032,123 is incorporated by reference herein and referred to as PRPA (Prior Relevant Patent). PRPA disclosed and discusses several methods for allocating resources.

BACKGROUND TECHNICAL FIELD

[0005] This invention relates to methods and systems for allocating resources in an uncertain environment.

[0006] By reference the following documents, submitted to the Sunnyvale Center for Innovation, Invention and Ideas (SCI³) under the US Patent and Trademark Office's Document Disclosure Program, are hereby included:


Title	Number	Date

Method of Allocating Resources	S00463	Jul. 9, 1997
in a Stochastic Environment
Method of Allocating Resources	S00730	Mar. 16, 1998
in a Stochastic Environment -
Further Considerations
Method of Allocating Resources	S00743	Apr. 10, 1998
in a Stochastic Environment -
Further Considerations II
Method of Allocating Resources	S00764	May 11, 1998
in a Stochastic Environment -
Further Considerations III
Method of Allocating Resources	S00814	Jul. 24, 1998
in a Stochastic Environment -
Further Considerations IV
Methods and Apparatus for	S00901	Dec. 14, 1998
Allocating Resources in an
Uncertain Environment -
PPA Draft I
Methods and Apparatus for	S00905	Dec. 18, 1998
Allocating Resources in an
Uncertain Environment -
PPA Draft II
Methods and Apparatus for	S00914	Jan. 6, 1999
Allocating Resources in an
Uncertain Environment -
PPA Draft III

BACKGROUND OF PRIOR ART

[0007] Almost all organizations and individuals are constantly allocating material, financial, and human resources. Clearly, how best to allocate such resources is of prime importance.

[0008] Innumerable methods have been developed to allocate resources, but they usually ignore uncertainty: uncertainty as to whether the resources will be available; uncertainty as to whether the resources will accomplish what is expected; uncertainty as to whether the intended ends prove worthwhile. Arguably, as the increasingly competitive world-market develops, as technological advancements continue, and as civilization becomes ever more complex, uncertainty becomes increasingly the most important consideration for all resource allocations.

[0009] Known objective methods for allocating resources in the face of uncertainty can be classified as Detailed-calculation, stochastic programming, scenario analysis, and Financial-calculus. (The terms “Detailed-calculation”, “Financial-calculus”, “Simple-scenario analysis”, and “Convergent-scenario analysis” are being coined here to help categorize prior-art.) (These known objective methods for allocating resources are almost always implemented with the assistance of a computer.)

[0010] In Detailed-calculation, probabilistic results of different resource allocations are determined, and then an overall best allocation is selected. The first historic instance of Detailed-calculation, which led to the development of probability theory, was the determination of gambling-bet payoffs to identify the best bets. A modern example of Detailed-calculation is U.S. Pat. No. 5,262,956, issued to DeLeeuw and assigned to Inovec, Inc., where yields for different timber cuts are probabilistically calculated, and the cut with the best probabilistic value is selected. The problem with DeLeeuw's method, and this is a frequent problem with all Detailed-calculation, is its requirement to enumerate and evaluate a list of possible resource allocations. Frequently, because of the enormous number of possibilities, such enumeration and valuation is practically impossible.

[0011] Sometimes to allocate resources using Detailed-calculation, a computer simulation is used to evaluate:

[0012] Z_dc=E(f_dc(x_dc)) (1.0)

[0013] where vector x_dcis a resource allocation plan, the function f_dcevaluates the allocation in the presence of random, probabilistic, and stochastic events or effects, and E is the mathematical expectation operator. With such simulation capabilities, alternative resource allocations can be evaluated and, of those evaluated, the best identified. Though there are methods to optimize the function, such methods often require significant amounts of computer time and hence are frequently impractical. (See Michael C. Fu's article “Optimization via Simulation: A Review,” Annals of Operations Research Vol. 53 (1994), p. 199-247 and Georg Ch. Pflug's book Optimization of Stochastic Models: The Interface between Simulation and Optimization, Kluwer Academic Publishers, Boston, 1996.) (Generally known approximation solution techniques for optimizing equation 1.0 include genetic algorithms and response surface methods.)

[0014] A further problem with Detailed-calculation is the difficulty of handling multiple-stage allocations. In such situations, allocations are made in stages and between stages, random variables are realized (become manifest or assume definitive values). A standard solution approach to such multiple-stage Detailed-calculation resource allocations is dynamic programming where, beginning with the last stage, Detailed-calculation is used to contingently optimize last-stage allocations; these contingent last-stage allocations are then used by Detailed-calculation to contingently optimize the next-to-the-last-stage allocations, and so forth. Because dynamic programming builds upon Detailed-calculation, the problems of Detailed-calculation are exacerbated. Further, dynamic programming is frequently difficult to apply.

[0015] Stochastic programming is the specialty in operations research/management science (OR/MS) that focuses on extending deterministic optimization techniques (e.g., linear programming, non-linear programming, etc.) to consider uncertainty. The general solution approach is to construct and solve an optimization model that incorporates all the possibilities of what could happen. Unless the resulting optimization model is a linear programming model, the usual problem with such an approach is that the resulting optimization problem is too big to be solved; and aside from size considerations, is frequently unsolvable by known solution means. Creating a linear programming model, on the other hand, frequently requires accepting serious distortions and simplifications. Usually, using more than two stages in a stochastic programming problem is impractical, because the above-mentioned computational problems are seriously aggravated. Assumptions, simplifications, and multi-processor-computer techniques used in special stochastic programming situations fail to serve as a general stochastic-programming solution method.

[0016] In Simple-scenario analysis, future possible scenarios are created. The allocations for each are optimized, and then, based upon scenario probabilities, a weighted-average allocation is determined. Sometimes the scenarios and allocations are analyzed and, as a consequence, the weights adjusted. The fundamental problem with this method is that it does not consider how the resulting allocation performs against the scenarios, nor does it make any genuine attempt to develop an allocation that, overall, performs best against all individual scenarios. Related to this fundamental problem is the assumption that optimality occurs at a point central to individual scenario optimizations; in other words, that it is necessarily desirable to hedge allocations. Such hedging could, for example, lead to sub-optimality when, and if, the PRPA uses Simple-scenario analysis for allocating resources: because of economies of scale, it could be preferable to allocate large resource quantities to only a few uses, rather than allocate small quantities to many uses. Another practical example concerns allocating military warheads, where hedging can be counter-productive.

[0017] Also related to the fundamental problem of scenario analysis is its inability to accommodate utility functions in general, and von Neumann-Morgenstern (VNM) utility functions in particular. Arguably, according to economic theory, utility functions should be used for all allocations when uncertainty is present. Loosely, a utility function maps outcomes to “happiness.” The VNM utility function, in particular, maps wealth (measured in monetary units) to utility, has a positive first derivative, and, usually, has a negative second derivative. By maximizing mathematically-expected VNM utility, rather than monetary units, preferences concerning risk are explicitly considered.

[0018] (A classic example of Simple-scenario analysis theory is Roger J-B. Wets' thesis, “The Aggregation Principle in Scenario Analysis and Stochastic Optimization,” in: Algorithms and Model Formulations in Mathematical Programming, S. W. Wallace (ed.), Springer-Verlag, Berlin, 1989, p. 91-113.)

[0019] Simple-scenario analysis has been extended to what might be called Convergent-scenario analysis, which starts where Simple-scenario analysis ends. Using a weighted-average allocation, individual scenarios are re-optimized with their objective functions including penalties (or costs) for deviating from the average allocation. Afterwards, a new weighted-average allocation is determined, the penalties made more severe, and the process is repeated until the individual scenarios' optimizations converge to yield the same allocation. The deficiencies of Simple-scenario analysis as previously described remain, though they are somewhat mitigated by the mechanism that coordinates individual-scenario optimizations. The mechanism, however, is contingent upon arbitrary parameter values, and hence the mechanism itself arbitrarily forces convergence. Further, such forced convergence is done without regard to whether the current allocation actually improves. Further still, the convergent mechanism tends to overly weigh scenarios that are highly sensitive to small allocation changes, even though it could be desirable to ignore such scenarios. Incorporating penalties for deviating from the average allocation can be cumbersome, if not impossible, and can result in significantly complicating and protracting the solution procedure.

[0020] The Progressive Hedging Algorithm is the most famous of the Convergent-scenario analysis techniques and is described in R. T Rockafellar and Roger J.-B. Wets, “Scenarios and Policy Aggregation in Optimization Under Uncertainty” Mathematics of Operations Research Vol. 16 (1991), No. 1, p. 119-147. Other Convergent-scenario analysis techniques are described in John M. Mulvey and Andrzej Ruszczynski, “A New Scenario Decomposition Method for Large-Scale Stochastic Optimization,” Operations Research43 (1995), No. 3, p. 477-490, and some of the other prior-art references.

[0021] U.S. Pat. No. 5,148,365 issued to Dembo is another scenario-analysis method. Here, as with Simple-scenario analysis, future possible scenarios are created and the allocations for each are optimized. Afterwards, the scenario allocations and parameters, possibly together with other data and constraints, are combined into a single optimization problem, which is solved to obtain a final allocation. Though this method mitigates some of the problems with Simple-scenario analysis, the problems still remain. Most importantly, it does not fully consider how the resulting allocation performs against all individual scenarios. This, coupled with the disparity between objective functions used for optimization and actual objectives, results in allocations that are only fair, rather than nearly or truly optimal. Because this method sometimes uses a mechanism similar to the convergent mechanism of Convergent-scenario analysis, the previously discussed convergent mechanism problems can also occur here.

[0022] As a generalization, all types of stochastic programming (and scenario analysis is a form of stochastic programming) can have the following serious deficiencies when allocating resources. First, penalties can introduce distortions. Second, the process of forming tractable models can introduce other distortions. Third, existing techniques are frequently unable to handle discrete quantities. Fourth, constraints are not fully considered, with the result that constraints are violated with unknown ramifications, and, conversely, other constraints are overly respected. Fifth, existing techniques usually presume a single local optimum, though multiple local optimums can be particularly probable. Sixth, existing techniques can require significant computer time to compute gradients and derivatives. Seventh, and perhaps most important, practitioners frequently do not use stochastic programming techniques, because shifting from deterministic techniques is too complex.

[0023] Theoretical finance, theoretical economics, financial engineering, and related disciplines share several methods for allocating and pricing resources in the presence of uncertainty. (Methods for valuing or pricing resources also allocate resources, since once a value or price is determined, it can be used for resource allocation internally within an organization and used to decide whether to buy or sell the resource on the open market.) These methods tend to use mathematical equations and calculus for optimization. A frequent problem, however, is that once complicating factors are introduced, the solution techniques no longer work, and either computer-simulation Detailed-calculation or stochastic-programming methods, with their associated problems, are required. A further problem is that such methods, in order to be mathematically tractable, frequently ignore VNM utility functions and work with unrealistically, infinitesimally small quantities and values.

[0024] In conclusion, though innumerable methods have been developed to determine how to allocate resources, they frequently are unable to cope with uncertainty. Attempts to include uncertainty frequently result in models that are too big to be solved, unsolvable using known techniques, or inaccurate. As a consequence, resource allocations of both organizations and individuals are not as good as they could be. It is therefore a fundamental object of the present invention to obviate or mitigate the above-mentioned deficiencies.

SUMMARY OF THE INVENTION

[0025] Accordingly, besides the objects and advantages of the present invention described elsewhere herein, several objects and advantages of the invention are to optimally, or near optimally, allocate resources in the presence of uncertainty. Specifically, by appropriately:


1.	considering how the resulting allocation performs against
	possible scenarios
2.	utilizing von Neumann-Morgenstern or other utility functions
3.	hedging and not hedging
4.	handling uncertain constraints
5.	handling discrete-quantity requirements
6.	considering multiple local optimums
7.	using and capitalizing on known methods for allocating resources
	that ignore, or do not explicitly consider, uncertainty
8.	using multiple processors.

[0026] Additional objects and advantages will become apparent from a consideration of the ensuing description and drawings.

[0027] The basis for achieving these objects and advantages, which will be rigorously defined hereinafter, is accomplished by programming a computer as disclosed herein, inputting the required data, executing the computer program, and then implementing the resulting allocation. The programming steps are shown in the flowchart of FIG. 1.

[0028] Step 101 entails generating scenarios and optimizing scenario allocations. In Step 103, the optimized allocations are grouped into clusters. In Step 105, first-stage allocations are randomly assigned to scenario nodes and, by using an evaluation and exploration technique to be described, Guiding Beacon Scenarios (GBSs) are generated. Step 107 entails using the GBSs and identifying the allocations within each cluster that perform best against the scenarios within the cluster. In Step 109, allocations that perform better against the scenarios within each cluster are created, typically by considering two of the better allocations, and then using line-search techniques. If there is more than one cluster, then in Step 113 the clusters are merged into larger clusters and processing returns to Step 109. Once only a single cluster remains and Step 109 is complete, the best allocation thus far obtained is taken as the final optimal allocation and is implemented in Step 115.

[0029] Numerous other advantages and features of the invention will become readily apparent from the following detailed description of the invention and the embodiments thereof, from the claims, and from the accompanying drawings.

BRIEF DESCRIPTION OF THE DRAWINGS

[0030] The invention will be more readily understood with reference to the accompanying drawings, wherein:

[0031] FIG. 1 shows a high-level flowchart;

[0032] FIG. 2 demonstrates optimized-scenario-allocation and cluster usage;

[0033] FIGS. 3A, 3B, and 3C demonstrate the three line-search techniques;

[0034] FIG. 4A shows an elementary scenario-tree; FIGS. 4A and 4B combined show the scenario-tree used by the present invention;

[0035] FIG. 5 is a skeletal definition of the WNode class;

[0036] FIG. 6 is a skeletal definition of the WScenario class;

[0037] FIG. 7 is a skeletal definition of the XAlloc class;

[0038] FIGS. 8A and 8B are skeletal definitions of the WWMatrix and AAMatrix classes;

[0039] FIG. 9 is a skeletal definition of the EvaluateXAllocAgainstWScenario function;

[0040] FIG. 10 is a skeletal definition of the DeterministicOptimizer function;

[0041] FIG. 11 is a skeletal definition of the ValueAllocation function;

[0042] FIG. 12 is a skeletal definition of the ZCluster class; and

[0043] FIGS. 13A and 13B show special von Neumann-Morgenstern utility functions.

DETAILED DESCRIPTION OF THE INVENTION

Theory of the Invention—Philosophy

[0044] The following philosophical assumptions are made:


1.	All resource allocations should fundamentally attempt to directly
	or indirectly optimize one of three things: monetary gain,
	monetary loss, or what economists term “utility.”
2.	There is no such thing as a constraint violation; for fundamentally
	any constraint can be violated, though with consequences.
	These consequences can be quantified and expressed in the
	terms of the range of the objective function, provided that the
	objective function is cast as a fundamental type.
3.	The more a constraint is violated, the larger the adverse impact on
	the fundamental objective being optimized.
4.	The adverse effect of a constraint violation is always less
	than infinity.
5.	Both objective and subjective probabilities are useful as imperfect
	estimates of what could happen.
6.	Almost every decision is a resource allocation, because almost every
	decision directly or indirectly leads to a resource allocation.
7.	Every resource allocation (and decision) would be easier and simpler
	if there was no uncertainty.

[0045] As an example of the first four items, a business might have a resource allocation plan that optimizes profits (monetary gain), and among other things fulfills the requirement (constraint) that contractual obligations be met. However, it may happen that fulfilling the contractual obligations becomes impossible. At this point, though the constraint is violated, it is irrelevant. What is relevant is how best to handle the contractual obligations: re-negotiating, performing restitution, fulfilling some of the obligations, etc. Whatever course is chosen, there follows an adverse impact on the business' profits. The more numerous and onerous the contractual obligations, the larger the adverse impact. However, this adverse impact is always less than infinity. There are always degrees of catastrophe: it is better to be short 10M resource units, rather than 20M; it is better to be insolvent by $30M, rather than $50M; etc.

[0046] As an example of the fifth item, an objective probability measurement might be obtained by statistical analysis of responses to a large survey, while a subjective value by a guess. Lacking better bases, both are usable and valuable. (Given a choice between the two, however, the objective estimate is usually preferable.)

[0047] A consequence of the fifth item is a diminishment of the usual distinction between risk and uncertainty. In common-professional usage, risk suggests known probabilities, while uncertainty suggests unknown probabilities. Philosophically, however, one always can determine a subjective probability estimate. Hence, here no distinction is made between risk and uncertainty; the two words are used interchangeably.

[0048] This philosophical section is presented here to facilitate a deeper and broader understanding of how the present invention can be used. However, neither understanding this section nor agreeing with it are required for implementing or using this invention. Hence, this section should not be construed to bound or in any way limit the present invention.

Theory of the Invention—Mathematical Framework

[0049] As is standard in stochastic programming, resources in this invention are allocated in one or more stages, and, between stages, what were previously uncertain values either become known, or the uncertainty of their eventual values reduced. Allocations made in one stage affect what can be accomplished in subsequent stages. Mathematically, the general stochastic resource allocation model addressed here is:

\begin{matrix} maximize z = \sum_{i = each scenario} p_{i} \cdot f (a_{1}, {WS}_{i}) & (2.0) \end{matrix}

[0050] where,

[0051] WS_iis a matrix containing all the random-variable realizations for scenario i

[0052] a₁is a vector containing first-stage allocations

[0053] 𝑓 is a function that evaluates first-stage allocations a₁against scenario i

[0054] p_iis the probability of scenario i

[0055] Implicit within function 𝑓 is the generation of a₂, a₃, . . . allocations for the second, third, and so-forth stages. Also implicit is an evaluation of such allocations. (Obviously, the maximizing orientation used here could have just as easily have been reversed.)

[0056] The focus here is on determining the optimal vector a₁, since those allocations are most immediately relevant, are initially implemented, and are implemented prior to any additional information becoming available.

[0057] Several strategies are used in tandem to cope with the inherent NP-hardness of stochastic programming: clustering, line-searching, statistical sampling, and unbiased approximation. Clustering is used to divide the allocation problem into simpler sub-problems, for which determining optimal allocations is computationally simpler and faster. Optimal allocations for sub-problems are used to define spaces for line-searches; line-searches are used for optimizing allocations over ever larger sub-problems. Sampling is used to develop schemes used to generate and evaluate allocations, especially for generating, and in turn using, GBSs.

[0058] FIGS. 2, 3A, 3B, 3C and 4A demonstrate some basic concepts that were developed as part of this invention: FIG. 2 shows how individual-scenario optimizations can serve as good starting points for finding an overall optimal allocation and how clustering can facilitate optimization; FIGS. 3A, 3B and 3C show the operation of special line-searching techniques to find better allocations; and FIG. 4A shows how GBSs are generated and used to evaluate a₁allocations.

[0059] FIG. 2 depicts a hypothetical example with four scenarios. The a₁allocations are shown collapsed into a single dimension on the horizontal axis; the vertical axis shows function 𝑓 and z values. Curves 201, 202, 203, and 204 show 𝑓 values as a function of a₁for the first, second, third, and fourth scenarios respectively. The optimal a₁values for the four scenarios are points 211, 212, 213, and 214. Given the four optimal points, they are clustered: points 211 and 212 into a cluster 221; points 213 and 214 into a cluster 231. (The clusters include the scenarios themselves.) The value of z across both the first and second scenarios is shown by curve 230; stated differently, curve 230 shows the probabilistically-weighted average value of curves 201 and 202. The value of z across the third and fourth scenarios by is shown by curve 241. For both clusters, the optimal individual-scenario allocations are good starting points for finding the optimal cluster allocations. Line-search techniques, to be explained shortly, are used to locate a point 232 as the optimal allocation for cluster 221. For cluster 231, however, the third scenario's optimal allocation (point 213) is the best cluster allocation. Now, the iteration repeats: the two cluster allocations points 232 and 213 are clustered into a larger final cluster. The value of z across the four scenarios is shown by curve 251, and as analogous to using optimized-scenario allocations, the optimal allocations for the individual clusters serve as starting points for finding the overall optimal allocation, point 261.

[0060] FIGS. 3A, 3B, and 3C show the operation of the three line-search techniques, each of which approximates function z with parabolas. The three techniques build upon one another. As before, the a₁allocations are shown collapsed into a single dimension on the horizontal axis; the vertical axis shows function z values. Points 300 and 301 correspond to two allocations and define the line in the allocation space that is searched. (An allocation is a point in the allocation space, and for the moment the words “allocation” and “point” are used synonymously when they apply to the allocation space represented by the horizontal axis.) These two allocations have z values as indicated by points 310 and 311 respectively. A parameter h, which can range from negative to positive infinity, governs the linear blending of allocations 300 and 301. In the first technique, Simple Parabola Search (SPS), a point 302 is selected (See FIG. 3A); the associated value z, point 312, is determined; a parabola through points 310, 312, and 311 is determined (shown as parabola 391); and the optimum domain value of the parabola, point 303, is evaluated for possibly yielding a better z value.

[0061] FIG. 3B shows allocation 303 yielding a value indicated by a point 313, which is inferior to point 310. In such a case, the second technique, Inner Compression Search (ICS), builds upon the failed SPS attempt. ICS hypothesizes that the z function is roughly like curve 392 (shown passing through points 310, 314, 313, and 311), with a local optimum near point 310 and between points 310 and 313. Initially, ICS tests the hypothesis by determining whether an allocation 304, near allocation 300, yields a z value better than allocation 300. If so, the point 313 of the SPS and the points 310 and 314 are used to determine a parabola and the optimum domain value of the parabola, point 305, is evaluated for yielding a better z value. If a better z value is not obtained, then the process repeats: using points 310, 314, and the z-value point for allocation 305, another parabola is determined, and so forth.

[0062] If the hypothesis proves incorrect (i.e., allocation 304 yields an inferior z value indicated by a point 324 in FIG. 3C), then the third technique, Outer Compression Search (OCS), builds upon the failed ICS attempt. Because allocation 300 yields a higher z value than allocation 304, OCS presumes that the z function increases as h decreases from zero. Such is exemplified by curve 393, which passes through points 310, 324, and 311. Initially, OCS experiments with increasingly negative h values until an inferior allocation is obtained; afterwards, it applies ICS.

[0063] FIG. 4A shows an elementary scenario tree, and the generation and use of Guiding Beacon Scenarios (GBSs). GBSs are applicable when there are more than two stages. At node 411, the first-stage allocations a₁are made; at nodes 421 and 422, second-stage allocations a₂are made; at nodes 431, 432, 433, and 434, third-stage allocations a₃are made; and at nodes 441, 442, 443, 444, 445, 446. 447, and 448, fourth-stage allocations a₄are made. Here, end-node identifiers are also used to designate scenarios; it is uncertain whether scenarios 441, 442, 443, 444, 445, 446, 447, or 448, will occur. (Vectors w₁, w₂, w₃assume different realizations of random variables for the eight scenarios.) To evaluate a first stage a₁allocation against, for example scenario 441, the first step is to determine the second stage allocations a₂. This is done by assuming both that a₁is fixed, and that the GBS of node 421—either 441, 442, 443, or 444—will occur with certainty. Given those two assumptions, the allocations of a₂, a₃, and a₄are re-optimized. The second step follows the first: Assuming that a₁and a₂are fixed, and that the GBS of node 431—either 441 or 442—will occur with certainty, a₃and a₄are re-optimized. The final step is to re-optimize a₄, holding a₁, a₂, and a₃fixed, and assuming scenario 441 occurs with certainty. The value of this final re-optimization is the value of the a₁allocation against scenario 441.

[0064] To generate GBSs, initially optimized a₁allocations are randomly assigned to the second and third stage nodes. Then, starting with a third stage node, for example node 431, for each assigned a₁allocation, and for each subsequent node (441 and 442), what are here termed Span Optimizations are performed: a₂, a₃, and a₄are re-optimized, holding a₁fixed, and assuming the subsequent-node scenario occurs with certainty. Afterwards, for each Span Optimization, a₄is re-optimized holding a₁, a₂, and a₃fixed, and assuming the other subsequent node(s) occur with certainty. Finally, the Span Optimization that performs best overall is identified, and its scenario is selected as the GBS. (For example, to determine the GBS for node 431, a₂, a₃, and a₄are re-optimized holding a₁fixed, and assuming scenario 441 occurs with certainty (Span Optimization); afterwards, a₄is re-optimized holding a₁, a₂, and a₃fixed, and assuming scenario 442 occurs with certainty. If the Span Optimization using scenario 441 performs better against scenarios 441 and 442 than the Span Optimization using scenario 442, then the GBS for node 431 is scenario 441.) The same is subsequently applied to the other third stage nodes. The GBSs for the second stage nodes are generated similarly, though the third-stage GBSs are assumed to occur with certainty.

[0065] FIGS. 2, 3A, 3B, 3C, and 4A, and this mathematical approach section are here to facilitate understanding, and should not be construed to define or bound the present invention.

Embodiment

[0066] While the invention is susceptible to embodiments in many different forms, there are shown in the drawings and will be described herein, in detail, the preferred embodiments of the present invention. It should be understood, however, that the present disclosure is to be considered an exemplification of the principles of the invention and is not intended to limit the spirit or scope of the invention and/or claims of the embodiments illustrated.

[0067] The basic embodiment of the present invention will be discussed first. Afterwards, the preferred embodiment with its extensions of the basic embodiment, will be presented.

[0068] Here, an Object Oriented Programming (OOP) orientation is used. Pseudo-code syntax is loosely based on C++, includes expository text, and covers only the particulars of this invention. Well-known standard supporting functionality is not discussed or shown. Class names begin with a special capital letter that helps distinguish a class from the concept represented by the class. Variable names for class instances begin with a lower case letter and always include the class name. Data-types are usually implicit. Variables with suffix “Cntn” are instances of a general pointer-container class, whose elements can be fetched in a loop mechanism or referenced using an “[]” operator. The sequence in which objects are fetched from instances of the general pointer-container class is assumed to be constant; in order words, assuming the instance contains the same pointers, then every loop mechanism will always fetch the pointers in the same sequence, and similarly, the “[]” operator, with the same argument, will also fetch the same pointer. Variable voa (value of allocation), which is used in both classes and functions, contains the value of an optimized allocation or an aggregation of such values. Vectors and arrays start at element 0, which is frequently not used, so that element 1 corresponds to stage 1. Indentation is used to indicate a body of code or a line continuation. All variables (including matrixes and vectors) are passed to functions by reference. From now on, the term “optimize” (and cognates) may mean the application of formal mathematical techniques that yield global or local optimizations, but it also includes the application of any type of heuristic or rule-based decision-making procedure that would be expected to make or improve an allocation.

[0069] FIGS. 4A and 4B joined together show the general scenario tree used here. There are nStage allocations stages, a₁through a_nStage, and a_nStageis equal to, or greater than, two. Allocations may or may not be needed for the last stage; however, to facilitate exposition, last stage allocations are presumed required and are always addressed. Though the figure shows two nodes following most nodes, any number of nodes can follow all-but-the-last-stage nodes. Each last-stage node has a pointer to a wScenario object, which contains scenario particulars. The w vectors contain different realizations of the random variables.

[0070] FIG. 5 shows a skeletal definition of the WNode class. The first element, pGBS, is a pointer to a wScenario object that serves as the GBS. This element is applicable for the second through the last-stage nodes. For last-stage nodes, pWScenario is applicable, and points to a wScenario object, which defines a scenario. For the second through the next-to-the-last-stage nodes, xAllocRndCntn contains xAlloc objects, which in turn contain a₁vectors, used for generating GBSs. Data member nodeProbability is the probability of reaching the node, given that the immediately preceding node has been reached. This class has a voa member. For all but the last-stage nodes, nextWNodeCntn contains subsequent nodes.

[0071] The skeletal definition of the WScenario class is shown in FIG. 6. The first element, wwMatrix, is a WWMatrix object, which is defined below and contains w vectors. The second element, pWNode, is a vector of pointers pointing to the wNodes that the scenario passes through. The probability of the scenario's occurrence is stored in nativeProbability. The function NativeOptimizer optimizes a₁, a₂, . . . , a_nStageallocations, assuming the scenario defined in wwMatrix occurs with certainty. The resulting a₁vector is stored in nativeXAlloc.

[0072] Class XAlloc is a wrapper for a₁vectors and is shown in FIG. 7. Variable feasible is a Boolean indicating whether vector a₁is feasible; member variable h, which is not always used, is the value that was used to combine two a₁vectors to yield the instance's a₁vector. Member variable voa is the standard voa variable. This class also has an assignment operator to copy a₁vectors and h scalars between instances and a comparison operator to compare the a₁vectors of different instances. Comparisons between a₁elements are done with a tolerance.

[0073] FIGS. 8A and 8B show class definitions of WWMatrix and AAMatrix, which respectively hold, as column-matrixes, vectors w and a corresponding to a complete scenario. The 0th column of both matrixes is not used so that columns correspond to stages: e.g., vector w₃is stored in column ww[][3]; vector a₄is stored in column aa[][4]. All elements of vectors w and a, and in turn arrays ww and aa, hold any data or function type required to define scenarios and specify allocations. All vector and matrix elements are not necessarily used, and no relationship or commonality necessarily exists between the elements in the same row of ww (or aa). Both classes have h and voa members, as previously described.

[0074] FIG. 9 outlines the EvaluateXAllocAgainstWScenario function, which is the pseudo-code implementation of the previously mentioned function 𝑓 in equation 2.0. This function evaluates the a₁vector contained in the first argument against the scenario contained in the second argument. Initially, an aaMatrix object is created and column aaMatrix.aa[][1] is loaded with the first-stage allocation vector (xAlloc.a1). Afterwards, stages two to nStage are iteratively re-optimized. During each iteration, the DeterministicOptimizer function is called with three arguments: iFlexStage is the starting stage for which allocations can be re-optimized; aaMatrix contains fixed allocations made prior to stage iFlexStage; and wwMatrix is the GBS for the iFlexStage stage of wScenario. The function finishes by passing voa to the first argument.

[0075] FIG. 10 outlines the DeterministicOptimizer function, which takes the three arguments just described. Assuming that the scenario defined in wwMatrix occurs with certainty and holding the allocations in aaMatrix prior to stage iFlexStage fixed, this routine applies standard state-of-the-art techniques to optimize allocations for stages iFlexStage through nStage. The first step is to evaluate and respond to what transpired up until the start of the iFlexStage. This could entail allocating resources to handle already incurred obligations, and could entail determining resource quantities that are available as of the iFlexStage stage. The second step is to look forward and optimize allocations for stages iFlexStage through nStage. This distinction between a first and second step is really artificial, since what is sought is a re-optimization of resource allocations: Given the portrayed situation, determine the optimal resource allocations for stages iFlexStage through nStage. This optimization process might entail applications of “if . . . then . . . ” logic, “rules-of-thumb,” heuristics, expert-system-like computer code, OR/MS optimization techniques, or any other data-process or optimization technique that helps to optimize resource allocations. Further, the flow through the routine might be contingent upon fixed-earlier-stage allocation(s) (aaMatrix), stage (iFlexStage), and/or GBS (wwMatrix); for any given function execution, multiple and on-the-fly creations/customizations of optimization models might occur and, between uses of such models, data manipulated. Here the word “optimization” and conjugates are used loosely, since true global optimization is not necessary. What is necessary is to develop an allocation for stages iFlexStage and beyond. A simple reasonable allocation, assuming the same result for the same iFlexStage, aaMatrix, and wwMatrix combination, would suffice. Obviously, though, the better the optimization, the better the final allocation. This function finishes by setting columns iFlexStage, iFlexStage+1, . . . , nStage of aaMatrix.aa equal to the optimized allocations for stages iFlexStage, iFlexStage+1, . . . , nStage, respectively; and calling the ValueAllocation function to set the voa value.

[0076] A major advantage of the present invention is that stochastic resource-allocation optimization can be done using a deterministic perspective in the DeterministicOptimizer function. Deterministic resource-allocation optimization is better understood, more advanced, and simpler than prior-art stochastic optimization. (Though DeterministicOptimizer function allows a deterministic perspective, such a perspective is not required. Hence, when a human expert defines DeterministicOptimizer functionality, it is acceptable to implicitly consider uncertainty.)

[0077] The ValueAllocation function, shown in FIG. 11, jointly assesses a scenario and an allocation to determine a voa value. This value represents the desirability to have the scenario-allocation pair occur, as opposed to having any other scenario-allocation pair occur. This could entail, for example, setting voa equal to:

[0078] the objective function value realized by the DeterministicOptimizer or the NativeOptimizer functions

[0079] the cash balance at the end of the last stage

[0080] the present-value of the stages' cash-flow stream

[0081] a VNM utility value based upon the monetary value at the end of the last stage

[0082] an aggregation of VNM utility values based upon monetary values at different stages

[0083] a non-VNM utility functional value

[0084] Philosophically, the ValueAllocation function interprets and converts the results of an optimization into units of one of the three fundamental objectives: monetary gain, monetary loss, or utility.

[0085] An advantage of the present invention is to permit the NativeOptimizer and the DeterministicOptimizer functions to use undefined or expedient-optimization objectives and have the ValueAllocation function interpret and value the results, so that optimal allocations can be made in the presence of uncertainty.

[0086] FIG. 12 shows the skeletal definition of the ZCluster class. The wScenarioCntn member contains wScenario objects belonging to the cluster. The first-stage allocations that perform best for the cluster are stored as xAlloc objects in xAllocBestCntn; the optimal first-stage allocation is also stored in xAllocOpt. The function XAllocEvaluator evaluates first-stage allocation xAlloc across all scenarios within the cluster; the ConsiderAppendBestXAlloc function manages xAllocBestCntn. The Improver function finds better first-stage allocations by using the SimpleParabolaSearch, InnerCompressSearch, and OuterCompressSearch functions. These functions in turn use several XAlloc instances: xAlloc0 and xAlloc1 are two good allocations used to find better allocations (and correspond to points 300 and 301 of FIG. 3A.); xAlloch is the result of merging allocations xAlloc0 and xAlloc1; xAlloc0off is an offset from xAlloc0 (and corresponds to point 304 of FIG. 3B); xAllocBnd is used by InnerCompressSearch to close-in on a better allocation (and corresponds to point 303 of FIG. 3B). Function GenxAlloch generates and evaluates xAlloch; variable wasImproved is a Boolean indicating whether GenxAlloch yielded an overall better first-stage allocation. Variable xAllocHurdle is an allocation to be surpassed in an iteration of Improver.

[0087] In Step 101, prior-art techniques are used to create scenarios and build a scenario tree, like that shown in combined FIGS. 4A and 4B, with wNode and wScenario objects. Scenario creation could be done by a human expert and/or by computer generation. Each scenario consists of a realization of exogenously-determined random variables. Scenarios may include exogenous changes to resource levels that occur during one or more of the stages. So, for example, a particular stage of each scenario may have a variable representing the realization of a contingent financial liability; such a realization changes available cash, and the optimizations/allocations are done assuming that available cash is appropriately reduced at the particular stage. (This does not rule out allowing insurance to be purchased in an earlier stage in order to offset the contingent-liability realization.)

[0088] If it is possible to obtain or calculate estimates of scenario probabilities, then such estimated values should be indicated in nativeProbability; if such estimates are not available, then all wScenario.nativeProbability values should be set to the inverse of the number of generated scenarios. After scenario creation, for each wScenario object, the NativeOptimizer function is called to optimize allocations for all stages within the scenario, assuming the scenario occurs with certainty. NativeOptimizer in turn calls ValueAllocation to properly determine voa. The resulting first-stage allocation is stored in nativeXAlloc, along with voa. If, in a given wScenario instance, there are multiple-globally-optimal first-stage allocations and they can easily be identified, then one should be randomly selected for storage in nativeXAlloc. (Programmatically, NativeOptimizer might call the DeterministicOptimizer function with a 1 value for iFlexStage, an empty aaMatrix, and the wScenario's wwMatrix.)

[0089] In Step 103, using the first-stage allocations contained in nativeXAlloc.a1 as coordinates, the wScenario objects are clustered (many prior-art clustering techniques are available). Clustering does not need to be academically pure: for instance, ordinal numeric values could be treated as if they were interval numeric values, some “difficult” fields ignored, etc. The value of nativeXAlloc.voa could also be used, though it is not necessary. A cluster may have one or more wScenario objects. Prior to clustering, vectors nativeXAlloc.a1 should temporally be normalized, so that some dimensions do not dominate the clustering process. For each identified cluster, instances of the ZCluster class are created and wScenarioCntn member is loaded with the wScenario objects belonging to the identified cluster.

[0090] In Step 105, where Guiding Beacon Scenarios are generated, the first operation is to set the pGBS member of each the last-stage wNode equal to the instance's member pWScenario. Next, all xAllocRndCntn containers in all wNode objects are emptied. Afterwards, the nativeXAlloc objects of all wScenario objects are weighted by nativeProbability, are randomly selected, and are loaded into the xAllocRndCntn containers of the second through nStage−1 nodes. (When there are only two stages, this Step 105 should be skipped.) Each such xAllocRndCntn container needs to be loaded with at least one nativeXAlloc; the same nativeXAlloc may be loaded into multiple xAllocRndCntn containers. The GBSs for stages two through nStage−1 are generated by:

[0091] AAMatrix aaMatrix;

[0092] for(iStage=nStage−1; 2 <= iStage; iStage--)

[0093] for(iNode=each iStage stage node)

[0094] {

[0095] for(jNode=each iStage+1 stage node that follows iNode)

[0096] {

[0097] jNode.voa=0;

[0098] for(kxAlloc=each xAlloc contained in xAllocRndCntn of iNode)

[0099] {

[0100] copy vector a1 of kxAlloc to column-vector aaMatrix.aa[][1];

[0101] DeterministicOptimizer(2, aaMatrix, jNode.pGBS→wwMatrix);

[0102] jNode.voa=jNode.voa+aaMatrix.voa*jNode.nodeProbability;

[0103] for(lNode=each iStage+1 stage node that follows iNode and is not equal jNode)

[0104] {

[0105] DeterministicOptimizer(iStage+1, aaMatrix,

[0106] lNode.pGBS→wwMatrix);

[0107] jNode.voa=jNode.voa+aaMatrix.voa*

[0108] lNode.nodeProbability;

[0109] }

[0110] }

[0111] Set jNode=the iStage+1 node that follows iNode and has the highest voa;

[0112] iNode.pGBS=jNode.pGBS;

[0113] }

[0114] In Step 107, identifying the best allocations within the clusters entails:

[0115] for each cluster

[0116] {

[0117] clear xAllocBestCntn;

[0118] xAllocOpt.voa=negative infinity;

[0119] for(iwScenario=each wScenario contained in wScenarioCntn)

[0120] XAllocEvaluator(iwScenario.nativeXAlloc, TRUE);

[0121] }

[0122] The called XAllocEvaluator function member of the ZCluster class is:

[0123] ZCluster::XAllocEvaluator(xAlloc, OKadd)

[0124] {

[0125] VOA voa;

[0126] voa=0;

[0127] for(iwScenario=each wScenario in wScenarioCntn)

[0128] {

[0129] EvaluateXAllocAgainstWScenario(xAlloc, iwScenario);

[0130] voa=voa+xAlloc.voa*iwScenario.nativeProbability;

[0131] }

[0132] xAlloc.voa=voa;

[0133] //after the above first loop, the following is performed:

[0134] if(xAllocOpt.voa<xAlloc.voa)

[0135] {

[0136] xAllocOpt=xAlloc;

[0137] }

[0138] if(xAllocHurdle.voa<xAlloc.voa)

[0139] {

[0140] xAllocHurdle=xAlloc;

[0141] wasImproved=TRUE;

[0142] }

[0143] if(OKadd)

[0144] {

[0145] XAlloc xAllocDel;

[0146] xAllocDel=xAlloc in xAllocBestCntn with lowest voa;

[0147] ConsiderAppendBestXAlloc(xAlloc, xAllocDel);

[0148] }

[0149] }

[0150] ZCluster::ConsiderAppendBestXAlloc(xAllocAdd, xAllocDel)

[0151] {

[0152] if(xAllocAdd not in xAllocBestCntn)^#

[0153] # Using the comparison operator of the XAlloc class. The purpose here is to prevent xAllocBestCntn from being flooded with roughly equivalent allocations.

[0154] {

[0155] if(xAllocBestCntn.IsFull())

[0156] {

[0157] if(xAllocDel.voa<xAllocAdd.voa)

[0158] {

[0159] remove xAllocDel from xAllocBestCntn;

[0160] add xAllocAdd to xAllocBestCntn;

[0161] }

[0162] }

[0163] else

[0164] add xAllocAdd to xAllocBestCntn;

[0165] }

[0166] else

[0167] {

[0168] find i such that xAllocBestCntn[i] equals xAllocAdd and xAllocBestCntn[i].voa is minimized;

[0169] if(xAllocBestCntn[i].voa<xAllocAdd.voa)

[0170] xAllocBestCntn[i]=xAllocAdd;

[0171] }

[0172] }

[0173] Step 109 entails:

[0174] for each cluster

[0175] Improver();

[0176] Cluster member function Improver entails:

[0177] Improver()

[0178] {

[0179] Perform the following, one or more times:

[0180] xAllocOpt.h=0;

[0181] xAlloc0=xAllocOpt;

[0182] Randomly select an xAlloc object from xAllocBestCntn that has not previously been paired with (within current zCluster instance), and is different from, the current xAllocOpt.

[0183] xAlloc1=randomly selected xAlloc;

[0184] xAlloc1.h=1;

[0185] xAllocHurdle=xAlloc1;

[0186] xAllocBnd=xAlloc1;

[0187] wasImproved=false;

[0188] SimpleParabolaSearch();

[0189] if(!wasImproved)

[0190] InnerCompressSearch();

[0191] if(!wasImproved)

[0192] OuterCompressSearch();

[0193] if(wasImproved)

[0194] ConsiderAppendBestXAlloc(xAllocHurdle, xAlloc1);

[0195] }

[0196] The SimpleParabolaSearch function uses the parameter h, which can range from negative to positive infinity. The preferred values are between 0 and 1, with a slight extra preference for the value to be less than 0.5, presuming xAlloc0.voa is better than xAlloc1.voa. Pseudo-code follows:

[0197] ZCluster::SimpleParabolaSearch()

[0198] {

[0199] Do the following, one or more times, each time with a different h value:

[0200] {

[0201] GenxAlloch(h);

[0202] if(0<xAlloch.h<xAllocBnd.h)

[0203] xAllocBnd=xAlloch;

[0204] if(wasImproved)

[0205] {

[0206] Determine the parabola passing through the following three points(where the first coordinate is the domain and the second coordinate the range):

[0207] (0, xAlloc0.voa),

[0208] (h, xAlloch.voa),

[0209] (1, xAlloc1.voa);

[0210] if(such a parabola exists and has a maximal value)

[0211] {

[0212] Set h2 equal to the domain value that yields the maximal value;

[0213] GenxAlloch(h2);

[0214] }

[0215] if(0<xAlloch.h<xAllocBnd.h)

[0216] xAllocBnd=xAlloch;

[0217] exit function;

[0218] }

[0219] }

[0220] }

[0221] The GenxAlloch function, with its h argument, follows:

[0222] ZCluster::GenxAlloch(h)

[0223] {

[0224] for(i=0;i<number of elements in vector a1; i++)

[0225] if(a1[i] is interval or ratio numeric)

[0226] {

[0227] xAlloch.a1[i]=(1−h)*xAlloc0.a1[i]+(h)*xAlloc1.a1[i];

[0228] if(xAlloch.a1[i] should be discrete)

[0229] round xAlloch.a1[i] to be discrete;

[0230] if(xAlloch.a1[i] is necessarily out of bounds)

[0231] bring xAlloch.a1[i] within bounds;

[0232] }

[0233] else if(a1[i] is an ordinal numeric)

[0234] {

[0235] set xAlloch.a1[i] equal the ordinal value that is closest to/most associated with:

[0236] (1−h)*xAlloc0.a1[i]+(h)*xAlloc1.a1[i];

[0237] }

[0238] else

[0239] {

[0240] if(h<=0.5)

[0241] xAlloch.a1[i]=xAlloc0.a1[i];

[0242] else

[0243] xAlloch.a1[i]=xAlloc1.a1[i];

[0244] }

[0245] //after the above first loop, the following is performed:

[0246] xAlloch.h=h;

[0247] if(xAlloch.a1 is feasible)

[0248] {

[0249] XAllocEvaluator(xAlloch, FALSE);

[0250] xAlloch.feasible=TRUE;

[0251] }

[0252] else

[0253] {

[0254] dis=minimum(abs(h), abs(h−1));

[0255] xAlloch.voa=(lowest voa contained in xAllocBestCntn's xAlloc objects)−(positive constant)*dis*dis;

[0256] xAlloch.feasible=FALSE;

[0257] }

[0258] }

[0259] Two approaches to “infeasible” first-stage allocations can be used. The first is simply to work with it; namely, have DeterministicOptimizer determine the result of attempting to implement such first-stage allocations. The second approach, which is shown above and is preferable, is to generate a penalty for non-feasibility. The penalty mechanism results in the allocation never being accepted, but is in keeping with the search techniques and allows processing to continue smoothly. (Note that infeasibility discussed in this paragraph is for first-stage allocations. Such allocations might result in “infeasibility” in subsequent stages, but as discussed previously, constraints can always be violated, though with consequences. Part of the purpose of the DeterministicOptimizer function is to evaluate, and work with, such consequences.)

[0260] The InnerCompressSearch function uses a parameter h3. This parameter needs to be between zero and xAllocBnd.h, such that the GenxAlloch function generates an xAlloch that is near, but not equal to, xAlloc0.

[0261] ZCluster::InnerCompressSearch()

[0262] {

[0263] GenxAlloch(h3);

[0264] xAlloc0off=xAlloch;

[0265] if(xAlloc0.voa<xAlloc0off.voa)

[0266] {

[0267] do one or more times:

[0268] {

[0269] Determine the parabola passing through the following three points:

[0270] (0, xAlloc0.voa),

[0271] (xAlloc0off.h, xAlloc0off.voa),

[0272] (xAllocBnd.h, xAllocBnd.voa);

[0273] if(such a parabola exists and has a maximal value)

[0274] {

[0275] Set h4 equal to the domain value of the parabola that yields the maximal range value;

[0276] if(h4 between 0 and xAllocBnd.h)

[0277] {

[0278] GenxAlloch(h4);

[0279] xAllocBnd=xAlloch;

[0280] }

[0281] else

[0282] exit function;

[0283] }

[0284] else

[0285] {

[0286] exit function;

[0287] }

[0288] }

[0289] }

[0290] }

[0291] The OuterCompressSearch function uses a parameter hDec that can be any positive value.

[0292] ZCluster::OuterCompressSearch()

[0293] {

[0294] XAlloc trailxAlloc1, trailxAllocm, trailxAllocr;

[0295] XAlloc org0, org1;

[0296] trailxAllocm=xAlloc0;

[0297] trailxAllocr=xAlloc1;

[0298] org0=xAlloc0;

[0299] org1=xAlloc1;

[0300] h5=0;

[0301] do one or more times:

[0302] {

[0303] h5=h5−hDec;

[0304] GenxAlloch(h5);

[0305] if(trailxAllocm.voa<xAlloch.voa)

[0306] {

[0307] trailxAllocr=trailxAllocm;

[0308] trailxAllocm=xAlloch;

[0309] }

[0310] else

[0311] {

[0312] trailxAlloc1=xAlloch;

[0313] if(trailxAlloc1.feasible)

[0314] {

[0315] Determine the parabola passing through the following three points:

[0316] (trailxAlloc1.h, trailxAlloc1.voa),

[0317] (trailxAllocm.h, trailxAllocm.voa),

[0318] (trailxAllocr.h, trailxAllocr.voa);

[0319] if(such a parabola exists and has a maximal value)

[0320] {

[0321] Set h5 equal to the domain value of the parabola that yields the maximal range value;

[0322] GenxAlloch(h5);

[0323] if(trailxAllocm.h<xAllocOpt.h)

[0324] trailxAlloc1=trailxAllocm;

[0325] }

[0326] }

[0327] xAlloc0=xAllocOpt;

[0328] xAlloc1=trailxAlloc1;

[0329] xAllocBnd=xAlloc1;

[0330] xAllocBnd.h=1;

[0331] InnerCompressSearch();

[0332] if(InnerCompressSearch improved xAllocHurdle)

[0333] {

[0334] xAllocHurdle.h=xAlloc0.h−(xAlloc0.h−xAlloc1.h)*xAllocHurdle.h;

[0335] }

[0336] xAlloc0=org0;

[0337] xAlloc1=org1;

[0338] exit function;

[0339] }

[0340] }

[0341] }

[0342] If there is more than one cluster remaining, Step 113 is performed after Step 109. Similar to Step 103, using the zCluster's vector xAllocOpt.a1 as coordinates, the clusters are clustered into new larger clusters. For each identified new larger cluster:

[0343] create zCluster instance newZCluster;

[0344] for(each old cluster being merged into newZCluster)

[0345] add each wScenario in oldZCluster.wScenarioCntn to newZCluster.wScenarioCntn;

[0346] for(each old cluster being merged into newZCluster)

[0347] {

[0348] for(xAllocPrev=each xAlloc in oldZCluster.xAllocBestCntn)

[0349] newZCluster.XAllocEvaluator(xAllocPrev, TRUE);

[0350] destroy oldZCluster;

[0351] }

[0352] After the clusters have been merged, processing resumes at Step 109.

[0353] If there is only one cluster remaining, Step 115 is performed after Step 109. It entails implementing the first-stage resource allocations indicated in vector xAllocOpt.a1 of the last remaining zCluster. This vector, xAllocOpt.al, of the last remaining zCluster contains what is termed the Optimal Final Allocation. (After implementation and the subsequent actual realization of w₁, the complete process described here is repeated, with the second stage having become the first stage, the third stage having become the second, and so forth.)

Miscellaneous Considerations

[0354] Functions ZCluster::XAllocEvaluator (of each ZCluster instance), EvaluateXAllocAgainstWScenario, and DeterministicOptimizer should avoid repeating lengthy calculations when given the same arguments. This can be accomplished by the following: at the end of each function call, the arguments and results are stored; at the start of each function call, if the same arguments are being used again, then the associated previous results are retrieved.

[0355] Further along these lines, if the NativeOptimizer and/or DeterministicOptimizer functions generate difficult-to-reproduce intermediate results that could be used for re-optimization, then such results should be saved for reuse.

Example Resource Allocations

[0356] The following examples are presented here to demonstrate some of the uses, usefulness, and scope of the present invention. These examples are meant to be illustrative, and should not be construed to define or bound the present invention.

EXAMPLE 1

Designing a New Manufacturing Facility with Uncertain Future Demand

[0357] Capacity requirements for a new manufacturing facility are needed, but it is uncertain what they should be, because future product demand is uncertain and seasonal.

[0358] A five-stage resource-allocation optimization is appropriate here. The first stage concerns determining capacity levels or investments, and the second through the fifth stages concern allocating that capacity to meet seasonal demand. Scenarios are generated and a scenario-tree is constructed. The NativeOptimizer function member of each wScenario object determines optimal capacity, assuming the scenario's product-demand level (specified in wwMatrix) occurs with certainty. NativeOptimizer may entail use of expert-knowledge, may entail use of OR/MS optimization techniques, or may determine capacity in a crude and lax manner. NativeOptimizer calls ValueAllocation to compute ROI (return on investment) based upon first-stage capacity investments and the return during the four seasons.

[0359] Based upon first-stage capacity levels, the wScenarios are clustered into zCluster objects. WNode.xAllocRndCntn objects are loaded with wScenario.nativeXAlloc objects, and the GBSs are generated. Best first-stage capacity levels are identified and improved upon.

[0360] The DeterministicOptimizer function optimizes allocations for meeting seasonal demand, which correspond to stages two through five. The capacity allocations for stages iFlexStage through stage 5 are re-optimized, holding both first-stage capacity levels and allocations for stages two through iFlexStage−1 fixed. The function concludes by calling ValueAllocation to determine the ROI based upon first-stage capacity levels and the return during the four seasons. (In this case, the DeterministicOptimizer function is very different from the NativeOptimizer function, because the latter addresses optimizing capacity levels, given fixed demand—while the former addresses optimizing fixed-capacity allocations to best meet demand.)

[0361] Afterwards, the ZCluster::Improver function is executed for each instance and the zClusters are merged. The process repeats until only a single zCluster remains. This zCluster's xAllocOpt contains the optimal capacity levels for the new manufacturing facility.

EXAMPLE 2

Cash Management with Uncertain Receipts and Uncertain Payouts

[0362] Corporate treasurers typically manage cash in order to meet cash requirements and to maximize return. Both future requirements and future returns are frequently uncertain, and this invention can help optimize in the presence of such uncertainty.

[0363] The first step is to generate scenarios. Each stage of each scenario (i.e., each w vector) has the following:

[0364] A) for each existing and possible-future investment:

[0365] cash requirements

[0366] cash receipts

[0367] acquisition price

[0368] divestiture price

[0369] B) contingent realizations of:

[0370] extra cash requirements

[0371] extra cash receipts

[0372] C) status data concerning:

[0373] interest rates

[0374] stock market conditions.

[0375] After the scenarios are generated, they are loaded into the scenario-tree and wScenario objects and, for each wScenario, the NativeOptimizer function is executed. In this case, the NativeOptimizer function can call DeterministicOptimizer, with iFlexStage equal to one.

[0376] The DeterministicOptimizer optimizes cash management, given a deterministic situation. It may initially determine available cash for each stage and, as is possible, allocate such cash to the individual stages' cash requirements. If extra cash is available in various stages, such cash is optimally invested with consideration of definitely-known (i.e., certain) subsequent-stage requirements, rates of return, and transaction costs. If cash is short, then investments are optimally liquidated in various stages with consideration of definitely-known subsequent-stage requirements, rates of return, and transaction costs. And finally, the investments themselves are juggled with consideration of definitely-known subsequent-stage rates of return and transaction costs. Corporate policy may dictate certain constraints and, if possible, such constraints should be respected. (The variety of approaches here is innumerable, and this is but one approach.)

[0377] The DeterministicOptimizer function in this case could, and possibly should, entertain that which is usually considered unthinkable: defaulting on bonds, missing payroll, etc. In a given execution of this function, the allocations for stages iFlexStage and beyond could initially result in certain catastrophes, for example: defaulting on bond obligations and missing payroll starting in stage iFlexStage+3. The optimization process might improve the matter by changing the allocations of stage iFlexStage and beyond. This might result, for example, in meeting payroll in stage iFlexStage+3, and suffering a more-serious default in stage iFlexStage+4. (Clearly, making the best of the situation, i.e., optimization, entails ethical judgments, survival considerations, and trade-offs.)

[0378] The ValueAllocation function might return the present-value of the gains and losses occurring in each stage. Alternatively, it might return the sum of VNM utilities resulting from the gains and losses occurring in each stage.

[0379] Processing proceeds as previously described until there is one remaining zCluster, with its xAllocOpt.a1 allocation (Optimal Final Allocation) that indicates the cash allocations that should be made in the first stage.

EXAMPLE 3

Optimizing a Financial Portfolio with Uncertain Future Returns

[0380] An investor owns various financial instruments (FIs), cash, stocks, bonds, derivatives (options), commercial paper, etc. The investor wants to maximize the VNM-utility portfolio-value as of a year from now.

[0381] Scenarios are generated using state-of-the-art techniques. For each FI that is or may be owned, twelve monthly prices and returns are included in each scenario.

[0382] After the scenarios are generated, they are loaded into the scenario-tree and wScenario objects, and the NativeOptimizer function is executed. In this case, the NativeOptimizer function can call DeterministicOptimizer, with iFlexStage set equal to one.

[0383] The DeterministicOptimizer optimizes the purchases and sales of FIs, assuming the scenario occurs with certainty. This optimization may consider tax effects, transaction costs, discrete-block-size transacting requirements, etc. When first-stage allocations are optimized (i.e., iFlexStage=1) and if multiple first-stage allocations yield the same returns, then a random process is used to select a first-stage allocation from among the optimal first-stage allocations.

[0384] The ValueAllocation function notes the value of the portfolio at the end of the year, and converts the portfolio's monetary value into a VNM utility value. The VNM function can be specified by the investor using a series of connected points that map portfolio-monetary value to utility.

[0385] Processing proceeds as previously described until there is one remaining zCluster, with its xAllocOpt.al allocation (Optimal Final Allocation) that indicates which FIs the investor should presently own. Differences with actual present ownership are resolved by buying and selling FIs.

EXAMPLE 4

Portfolio Replication with Uncertain Coupling

[0386] Some investment institutions need to replicate a portfolio, but cannot obtain the portfolio's individual financial instruments (FIs). Instead, other FIs are purchased to compose an imitation portfolio (IP) that is expected to perform like the genuine portfolio (GP).

[0387] Such mimicry can be optimized with the present invention in an manner analogous to the portfolio example immediately above. Here, only first-stage allocations (a₁) that are expected to optimally endure a single realization of random events (w₁) are required. Scenarios are generated using state-of-the-art techniques. Each scenario comprises single-period performance samples for each of the GP's FIs, and for each of the FIs that can be used in the IP.

[0388] After the scenarios are created and loaded into the scenario-tree and wScenario objects, the NativeOptimizer function allocates cash to the FIs that can be used in the IP, such that the return of the IP equals the return of the GP contained in the wScenario object. It is likely that multiple allocations can yield the same return, and so a random process selects one such allocation.

[0389] In this example, the DeterministicOptimizer does nothing other than call the ValueAllocation function. ValueAllocation initially determines the difference between the performance of the GP and the IP. A special VNM utility function, like those shown in FIGS. 13A and 13B, is used to convert the performance difference into a utility or a voa value. In other words, the domain of these special VNM utilities functions is the difference (positive or negative) between the return of the IP and the return of the GP. (The utility function in 13A dictates seeking a strict parallel performance between the GP and the IP; while the function in 13B suggests wanting a performance roughly equivalent to the GP, though with a willingness to seek superior returns with the concomitant risk that inferior returns will result.)

[0390] Processing proceeds as previously described until there is one remaining zCluster, with its xAllocOpt.al allocation (Optimal Final Allocation) that specifies the FIs' quantities that should be owned to mimic the GP.

EXAMPLE 5

Allocating Organizational Resources in an Uncertain Environment

[0391] One of the more advanced methods for allocating resources is presented in the PRPA. Because that method sometimes uses Simple-scenario analysis (as described earlier herein) for allocating and pricing resources in an uncertain environment, those allocations might be sub-optimal. The present invention, however, can be coupled with the PRPA to make superior allocations.

[0392] In this example, uncertainty is presumed present in resource prices, product prices, potential demands, production coefficients, allocation-to-effectiveness-function specifications, and resource quantities. This example has three stages or time periods. At least some of the groups/Apertures cross stages; hence their allocations affect multiple periods.

[0393] The first step is to generate scenarios by randomly sampling for uncertain values. The generated scenarios are loaded into the scenario-tree and wScenario objects. NativeOptimizer function optimizes allocations, as described in the PRPA.

[0394] The ValueAllocation function determines the present-value of the changes in WI_Cash (or Internal Producer's Surplus) during each time period (stage).

[0395] The DeterministicOptimizer function performs optimizations holding first-stage, or first-and second-stage allocations fixed. Each execution entails (given the previous allocations and the fixed scenarios) determining available WI_Cash, subtracting out earlier-stage consumed resources, holding prior-stage group and non-group allocations fixed, and then re-optimizing.

[0396] Processing proceeds as previously described until only one zCluster remains. Its xAllocOpt.a1 allocations are the a₁allocations to be initially implemented.

Conclusion

[0397] As the reader who is familiar with the domain of the present invention can see, this invention thus leads to optimized, or near-optimized, resource allocations when uncertainty is present. With such optimizations, both organizations and individuals can therefore better reach their goals.

[0398] While the above description contains many particulars, these should not be construed as limitations on the scope of the present invention; but rather, as an exemplification of one preferred embodiment thereof. As the reader who is skilled in the invention's domain will appreciate, the invention's description here is oriented towards facilitating ease of comprehension. Such a reader will also appreciate that the invention's computational performance can easily be improved by applying both prior-art techniques and readily apparent improvements.

[0399] Many variations and many add-ons to the preferred embodiment are possible. Their use frequently entails a trade-off between required-computer time and final-allocation quality, and their effectiveness can be situationally contingent. Examples of variations and add-ons include, without limitation:

[0400] 1. The Improver function does not necessarily need to use xAllocOpt for xAlloc0. Instead, two different xAllocs from xAllocBestCntn could be randomly selected and copied to xAlloc0 and xAlloc1, preferably with xAlloc0.voa being superior to xAlloc1.voa. The random selection process should avoid repeated selection of the same pair in the same zCluster instance. Once clusters are merged, continuing to avoid repeating a pair might be desirable, since this would tend to focus searching in the space between the previous-smaller-merged clusters.

[0401] 2. The Improver function can skip any or all of the three search functions (SPS, ICS, OCS). Omission results in obtaining a final allocation faster, though it is likely be inferior to what could have otherwise been obtained. (OCS is likely the least computationally efficient of the three functions.)

[0402] 3. A further variation on variation #2 is to selectively use the Improver function. If, a priori, a single local optimum can be assumed for the z function, then performance could be improved as follows. After Step 105 clusters, here termed Modal-clusters, that may contain the optimal allocations are identified: clusters that have many scenarios and/or clusters that have scenarios with particularly high voa values are good Modal-clusters choices; clusters that would contain first-stage allocations as determined by Simple-scenario analysis and/or Convergent-scenario analysis are also good choices. After one or more Modal-clusters are identified, processing proceeds as previously described, except that 1) in Step 109, the Improver function is applied only to the Modal-clusters, and 2) in Step 113, when clusters are merged, if an old non-Modal zCluster object yields a superior xAlloc for the new zCluster object, then the old zCluster object's Improver function is immediately called, and the merging postponed until after the function is complete. (The result of merging a Modal with non-Modal-cluster(s) is a Modal-cluster.)

[0403] An extreme use of Modal-clusters entails, in Step 103, using an allocation resulting from Simple-scenario analysis as a seed to build a Modal-cluster having more than one wScenario objects. Afterwards, each wScenario object not included in the Modal-cluster is loaded into its own zCluster object (singleton). Then in each iteration of Step 113, only the singleton clusters relatively near the Modal-cluster are merged into the Modal-cluster, while the singletons relatively far from the Modal-cluster are not merged until a subsequent iteration of Step 113.

[0404] 4. Standard line-search, non-derivative, and/or derivative based techniques could be incorporated in ZCluster::Improver for improving first-stage allocations (stored as xAlloc objects in xAllocBestCntn). Such techniques might require some adaptation, including, for instance, incorporation of response surface methods (RSM techniques). (See A. R. Conn, K. Scheinberg, and Ph. L. Toint “Recent Progress in Unconstrained Nonlinear Optimization Without Derivatives” Mathematical Programming79 (1997), p. 397-414; and M. S. Bazaraa, H. D. Sherali, C. M. Shetty, Nonlinear Programming Theory and Algorithms2nd ed., John Wiley & Sons. Inc., New York, 1993, [See particularly Chapter 8: “Unconstrained Optimization” p. 265-355]. Both references also cite relevant previous publications.) Incorporation of such standard line-search, non-derivative, and/or derivative based techniques in ZCluster::Improver will be termed here as StandardSearch.

[0405] An example of StandardSearch is the use of the sequential simplex search technique developed by Nelder and Mead: some or all of the xAlloc objects stored in xAllocBestCntn could be used to define the simplex, which is in turn used to generate additional xAlloc objects (in a manner analogous with the GenxAlloch function), which in turn are evaluated using XAllocEvaluator, which in turn redefine the simplex, etc.—all potentially leading to a superior xAlloc.

[0406] 5. Well known genetic algorithms could be incorporated into the ZCluster::Improver function to combine existing xAlloc objects in xAllocBestCntn to form additional xAlloc objects, which are evaluated using XAllocEvaluator. Naturally, the better resulting xAlloc objects are added to xAllocBestCntn. Incorporation of genetic algorithms in ZCluster::Improver will be termed here as GeneticSearch.

[0407] A simple means to implement GeneticSearch is to include in the Improver function calls to a special version of GenxAlloch. This special version would be identical to the regular version, except that a different value for h would be randomly generated for each iteration of the first loop.

[0408] 6. The equality-comparison operator of the XAlloc class could initially start with a loose tolerance, and as processing proceeds, become tighter. This might reduce potentially wasteful considerations of roughly-equal allocations, when there are numerous xAllocs in numerous zClusters.

[0409] 7. If there are many scenarios in a cluster, the ZCluster::XAllocEvaluator function could use statistical inference to consider early termination. If statistical inference suggests that the resulting voa would not be very good, then xAlloc.voa should be set to the estimated not-very-good value, the function exited, and processing otherwise continued. (The drawn-sample-scenario sequence should be consistent.)

[0410] 8. If there are many wScenario objects, then initial clustering could be nested: clusters are initially formed based upon a₁allocations, then within each such cluster, another secondary clustering is done based upon a₂allocations, and so forth. The final (smallest) clusters would then be loaded into the zCluster objects.

[0411] 9. The maximum number of xAlloc objects held in ZCluster::xAllocBestCntn could be variable, and thus the thoroughness of the optimization adjusted. The Improver function, and the functions it calls, are continuously generating reasonable xAllocs that could be saved in xAllocBestCntn. Alternatively, after each iteration of the Improver function, xAlloc0 and/or xAlloc1 could be removed from xAllocBestCntn if they do not equal is xAllocOpt. Further, periodically the xAlloc objects in ZCluster::xAllocBestCntn could be evaluated for equivalence, and rough duplicates discarded.

[0412] 10. Scenario specifications, i.e., wScenario.wwMatrix, could be used as proxies for clustering based upon first-stage allocations. When scenario generation is performed by using formal sampling techniques, i.e., area sampling, cluster sampling, stratified sampling, systematic sampling, etc., clusters frequently automatically suggest themselves. Such naturally occurring clusters can be used as bases for initially loading the zCluster objects.

[0413] 11. Within each zCluster instance, any means can be used to create first-stage allocations (xAlloc objects), which then could be evaluated by the XAllocEvaluator function. Techniques for creating first-stage allocations include: generating a weighted average of the native XAllocs contained in wScenarioCntn, and generating a weighted average of the xAllocs contained in xAllocBestCntn. Any xAlloc created outside of a zCluster instance could also be used. Incorporation of such methods will be termed here as MiscSearch.

[0414] 12. When multiple processors are available, they might desirably be used for parallel execution of multiple instances of the ZCluster::NativeOptimizer and the ZCluster::Improver functions and for parallel generation of GBSs. The generation of GBSs could be done by having each processor handle a branch of the scenario tree.

[0415] 13. The GBSs can be regenerated at any time, which beneficially calibrates the GBSs to the current-optimization state. This requires: 1) weighting each cluster by the cumulative probability that the scenarios within the cluster will occur, 2) randomly assigning, based upon cluster probability, the clusters' xAllocOpt (or the xAllocs stored in the clusters' xAllocBestCntn) to the wNodes' xAllocRndCntn objects, and 3) proceeding with GBS generation as previously described.

[0416] 14. Contingent-GBSs could result in better allocations, but require more effort to generate. Contingent-GBSs are particularly appropriate when earlier stage allocations make a significant difference for the later stages. For example, a household's resource allocation is being optimized; a decision to buy or not buy a first home significantly affects what can be done in subsequent stages. To generate Contingent-GBSs, processing proceeds as previously described for each contingent possibility: those xAllocs in wNode.xAllocRndCntn that result in the first variation are used to generate the first variation GBS; those that result in the second variation are used to generate the second variation GBS, and so forth. Returning to the example, suppose Contingent-GBSs are being developed for a fifth stage node; those xAllocs that result in purchasing-a-house in stages 1, 2, 3, or 4 are used to generate the “house bought” GBS; while those that result in not-purchasing-a-house are used to generate the “no house bought” GBS. (When optimizing stage 5 allocations, the “house bought” GBS is used if a house is bought during stages 1, 2, 3, or 4; otherwise, the “no house bought” GBS is used.)

[0417] The difficulty with this approach is that the xAllocs in xAllocRndCntn might not lead to every contingent variation. The simplest way around this is to suspend generating the Contingent-GBS until an xAlloc that results in the variation appears, and then using it to generate the GBS. (Such xAllocs could be accumulated, and each time one appears, the most recently accumulated xAllocs used to generate new GBSs.)

[0418] 15. Better GBSs can be generated by merging several scenarios to create an optimal GBS. Merged-GBSs are particularly appropriate when a branch of the scenario-tree lacks a central scenario that can serve as a good GBS. Merged-GBSs, however, require more effort to generate.

[0419] Generating Merged-GBSs is analogous to finding optimal cluster allocations: rather than finding optimal allocations for a set of scenarios, optimal scenarios are found for a set of allocations. The following pseudo-code shows the GenMergedGBS class, which is conceptually based upon the ZCluster class, with WWMatrix replacing XAlloc. This pseudo-code generates a Merged-GBS for an iStage-stage node named iNode; execution begins at the MainBody function.

[0420] class GenMergedGBS()

[0421] {

[0422] wwMatrixBestCntn;

[0423] wwMatrixOpt;

[0424] WWMatrixEvaluator(wwMatrix, OKadd)

[0425] {

[0426] AAMatrix aaMatrix;

[0427] WWMatrix wwMatrixTemp;

[0428] wwMatrixTemp=wwMatrix;

[0429] wwMatrix.voa=0;

[0430] for(each xAlloc in iNode.xAllocRndCntn)

[0431] {

[0432] copy xAlloc.a1 to aaMatrix.aa[][1];

[0433] DeterministicOptimizer(2, aaMatrix, wwMatrixTemp);

[0434] for(jNode=each iStage+1 node following iNode)

[0435] {

[0436] DeterministicOptimizer(iStage+1, aaMatrix,

[0437] jNode.pGBS→wwMatrix);

[0438] wwMatrix.voa=wwMatrix.voa+aaMatrix.voa*jNode.nodeProbability;

[0439] }

[0440] }

[0441] // . . . Analogously follows code after first loop in ZCluster::XAllocEvaluator. . .

[0442] }

[0443] ConsiderAppendBestWWMatrix(wwMatrixAdd, wwMatrixDel);

[0444] MainBody()

[0445] {

[0446] for(jNode=each iStage+1 node following iNode)

[0447] WWMatrixEvaluator(jNode.pGBS→wwMatrix, TRUE);

[0448] Improver();

[0449] iNode.pGBS=(pointer to, copy of) wwMatrixOpt;

[0450] }

[0451] Improver();

[0452] SimpleParabolaSearch();

[0453] InnerCompressSearch();

[0454] OuterCompressSearch();

[0455] GenwwMatrixh(h)

[0456] {

[0457] Analogously follows ZCluster::GenxAlloch, except first loop is applied to all columns of wwMatrix.

[0458] }

[0459] wwMatrixHurdle;

[0460] wasImproved;

[0461] wwMatrix0;

[0462] wwMatrix0off,

[0463] wwMatrix1;

[0464] wwMatrixh;

[0465] wwMatrixBnd;

[0466] }

[0467] 16. When scenarios cannot legitimately be merged, as is required for Merged-GBSs, Multiple-GBSs can be used. The central idea of Multiple-GBSs is to use several GBSs to generate multiple allocations, which in turn are merged.

[0468] Generating Multiple-GBSs is analogous to finding optimal cluster allocations: rather than finding an optimal allocation for a set of scenarios, an optimal blending of multiple allocations is determined and the blending steps are noted/recorded. Later, the blending steps are repeated for blending other allocations.

[0469] Two additional classes are required. The MAAMatrix class (meta AAMatrix) is the same as the AAMatrix class, except that it contains multiple aa arrays that are always accessed in the same order. The GenMultipleGBS class is analogous to the ZCluster class, with MAAMatrix replacing XAlloc, and is included in each wNode object having Multiple-GBSs.

[0470] The following pseudo-code shows the process of generating Multiple-GBSs for an iStage-stage node iNode. (For ease of comprehension, each node immediately following iNode is assumed to have a single GBS, as opposed to multiple GBSs.):

[0471] MAAMatrix mAAMatrix;

[0472] AAMatrix aaMatrix;

[0473] GenMultipleGBS gmGBS;

[0474] gmGBS.nElemAAMatrixBestArray=0;

[0475] gmGBS.iStage=iStage;

[0476] gmGBS.iNode=iNode;

[0477] gmGBS.nRecorder=0;

[0478] for(jNode=each iStage+1 node following iNode)

[0479] {

[0480] empty mAAMatrix of aa arrays;

[0481] for(each xAlloc in iNode.xAllocRndCntn)

[0482] {

[0483] copy xAlloc.a1 to aaMatrix.aa[][1];

[0484] DeterministicOptimizer(2, aaMatrix, jNode.pGBS→wwMatrix);

[0485] Add aaMatrix.aa to mAAMatrix;

[0486] }

[0487] gmGBS.MAAMatrixEvaluator(mAAMatrix, TRUE);

[0488] }

[0489] gmGBS.Improver();

[0490] The GenMultipleGBS class is conceptually based upon the ZCluster class, with MAAMatrix replacing XAlloc.

[0491] class GenMultipleGBS: public . . .

[0492] {

[0493] iStage;

[0494] iNode;

[0495] struct

[0496] {

[0497] index_h0;

[0498] index_h1;

[0499] h;

[0500] index_hResult;

[0501] }recorder[];

[0502] nRecorder;

[0503] mAAMatrixBestArray[]; //analogous with xAllocBestCntn.

[0504] nElemAAMatrixBestArray;

[0505] mAAMatrixOpt;

[0506] iMax;

[0507] MAAMatrixEvaluator(mAAMatrix, OKadd)

[0508] {

[0509] mAAMatrix.voa=0;

[0510] for(jNode=each iStage+1 node following iNode)

[0511] {

[0512] for(aaMatrix=each aa array contained in mAAMatrix)

[0513] DeterministicOptimizer(iStage+1, aaMatrix,

[0514] jNode.pGBS→wwMatrix);

[0515] mAAMatrix.voa=mAAMatrix.voa+aaMatrix.voa*jNode.nodeProbability;

[0516] }

[0517] }

[0518] // . . . Analogously follows code after first loop in ZCluster::XAllocEvaluator . . .

[0519] }

[0520] ConsiderAppendBestMAAMatrix(mAAMatrixAdd, mAAMatrixDel)

[0521] {

[0522] if(nElemAAMatrixBestArray==0∥

[0523] mAAMatrixBestArray[iMax].voa<mAAMatrixAdd.voa)

[0524] imax=nElemAAMatrixBestArray;

[0525] mAAMatrixBestArray[nElemAAMatrixBestArray++]=mAAMatrixAdd;

[0526] //positions need to be kept constant and elements not

[0527] //removed, so that re-play works correctly.

[0528] }

[0529] Improver()

[0530] {

[0531] Follows ZCluster::Improver, except that when and if

[0532] ConsiderAppendBestMAAMatrix is called because an iteration yields an improvement over the beginning mAAMatrixHurdle, the following is also done after the call to ConsiderAppendBestMAAMatrix:

[0533] {

[0534] recorder[nRecorder].index_h0=i, such that mAAMatrixBestArray[i]=mAAMatrix0;

[0535] recorder[nRecorder].index_h1=i, such that mAAMatrixBestArray[i]=mAAMatrix1;

[0536] recorder[nRecorder].h=mAAMatrixHurdle.h;

[0537] recorder[nRecorder].index_hResult=i, such that mAAMatrixBestArray[i]=mAAMatrixHurdle;

[0538] nRecorder++;

[0539] }

[0540] }

[0541] SimpleParabolaSearch();

[0542] InnerCompressSearch();

[0543] OuterCompressSearch();

[0544] GenMAAMatrixh(h)

[0545] {

[0546] for(k=each aa matrix in mAAMatrix)

[0547] {

[0548] Analogously apply first loop of ZCluster::GenxAlloch to merge columns 1 through iStage of kth aa array of mAAMatrix0 and mAAMatrix1 into columns 1 through iStage of kth aa array of mAAMatrixh.

[0549] }

[0550] // . . . Analogously follows code after first loop in ZCluster::GenxAlloch . . .

[0551] }

[0552] mAAMatrixHurdle;

[0553] wasImproved;

[0554] mAAMatrix0;

[0555] mAAMatrix0off;

[0556] mAAMatrix1;

[0557] mAAMatrixh;

[0558] mAAMatrixBnd;

[0559] }

[0560] Using Multiple-GBSs for generating the iStage-stage allocations for iNode entails not directly calling the DeterministicOptimizer function in EvaluateXAllocAgainstWScenario, but doing the following instead:

[0561] {

[0562] aaMatrixArray[]; //i.e., array of AAMatrix objects.

[0563] i=0;

[0564] for(jNode=each iStage+1 node following iNode)

[0565] {

[0566] DeterministicOptimizer(iFlexStage, aaMatrix,

[0567] jNode.pGBS→wwMatrix);

[0568] aaMatrixArray[i++]=aaMatrix;

[0569] }

[0570] for(i=0; i<gmGBS.nRecorder; i++)

[0571] {

[0572] using:

[0573] aaMatrixArray[gmGBS.recorder[i].index_h0].aa[][iStage],

[0574] aaMatrixArray[gmGBS.recorder[i].index_h1].aa[ ][iStage],

[0575] gmGBS.recorder[i].h;

[0576] apply processing analogous to first loop of ZCluster::GenxAlloch to create merged values for column:

[0577] aaMatrixArray[gmGBS.recorder[i].index_hResult].aa[][iStage].

[0578] }

[0579] Copy column aaMatrixArray[gmGBS.recorder[iMax].index_hResult].aa[][iStage] to column aaMatrix.aa[][iStage].

[0580] }

[0581] (Note: When looping through the jNode objects, the sequence of fetching jNode objects needs to be consistent.)

[0582] 17. Besides allocating resources, this invention can also value resources, which as previously described, can be used to allocate resources.

[0583] Define a function zz(q,c) that both uses this invention (with an unchanging scenario-tree and associated scenarios; [the GBSs, however, may change]) to determinate an optimal allocation and that returns a computed z value for equation 2.0, given that the available on-hand quantity of a particular resource changes by q, and given that available on-hand cash changes by c. (Both q and c can apply to different stages.) Given a particular q, well known numerical techniques can be used to find c such that:

[0584] zz(0,0)=zz(q,c)

[0585] By economic theory, the value of the |q| units of the particular resource is |c|: if q is negative, then c is the minimal value that should be received for selling −q resource units; if q is positive, then −c is the maximal value that should be paid for buying q resource units. For small q, |c/q| equals unit price for the particular resource and such a price can be used for pricing.

[0586] Another means to generate similar data is to generate supply and demand curves. If, within the scenarios, a resource can be sold and/or purchased, then resource supply and demand curves can be generated by varying resource price, performing Steps 101 through 113 with the same wScenario objects, and noting the resulting resource quantity changes. (Conceptually, produced products and services can be handled as a bundle of resources. Depending on the DeterministicOptimizer and NativeOptimizer functions, the q discussed here could instead reference produced product and service quantities.)

[0587] Given a resource optimization method, how to value and price resources and how to beneficially use such values and prices is well known by economists. The point of this variation is that this invention can be used, as a resource optimization method, in conjunction with prior-art techniques to determine and use resource prices and values. And once such prices and values are determined, they can be used for internal pricing and for deciding whether to buy or sell on the open market.

[0588] 18. Step 103 is not necessarily required, and it is acceptable, instead, to place all scenarios created in Step 101 into a single ZCluster. This could be desirable when there are only a few scenarios (and hence clustering is not worth the effort) or when the clusters are highly disparate.

[0589] From the foregoing and as mentioned above, it will be observed that numerous variations and modifications may be effected without departing from the spirit and scope of the novel concept of the invention. It is to be understood that no limitation with respect to the specific methods and apparatus illustrated herein is intended or should be inferred. It is, of course, intended to cover by the appended claims all such modifications as fall within the scope of the claims.

Claims

What I claim is:

1. A computer system for optimally allocating organizational resources comprising:

means for obtaining at least two scenarios;

means for obtaining at least a first-stage allocation for at least two of said scenarios; and

means for determining an Optimal Final Allocation including:

means for separately optimizing said first-stage allocations against each scenario such that said optimizing means generates additional stage allocations,

means for re-optimizing the additional stage allocations against each scenario, and

means for resolving infeasibilities that may occur during said means for optimizing and said means for re-optimizing.

Patent Citations (26)

Patent	Date	Inventor	Cited By
US4885686(A)	1989-12-01	Vanderbei	Examiner
US4914563(A)	1990-04-01	Karmarkar et al.	Examiner
US4924386(A)	1990-05-01	Freedman et al.	Examiner
US5148365(A)	1992-09-01	Dembo	Applicant
US5216593(A)	1993-06-01	Dietrich et al.	Examiner
US5255345(A)	1993-10-01	Shaefer	Applicant
US5262956(A)	1993-11-01	DeLeeuw	Applicant
US5289370(A)	1994-02-01	Lirov	Examiner
US5291397(A)	1994-03-01	Powell	Examiner
US5343388(A)	1994-08-01	Wedelin	Examiner
US5404516(A)	1995-04-01	Geordiades et al.	Examiner
US5630070(A)	1997-05-01	Dietrich et al.	Examiner
US5649113(A)	1997-07-01	Zhu et al.	Examiner
US5799287(A)	1998-08-01	Dembo	Examiner
US5890133(A)	1999-03-01	Ernst	Examiner
US5913199(A)	1999-06-01	Dueck et al.	Examiner
US5963910(A)	1999-10-01	Ulwick	Examiner
US6006192(A)	1999-12-01	Cheng et al.	Examiner
US6032123(A)	2000-02-01	Jameson	Examiner
US6035277(A)	2000-03-01	Anbil et al.	Examiner
US6219649(B1)	2001-04-01	Jameson	Examiner
US6263253(B1)	2001-07-01	Yang et al.	Examiner
US6374227(B1)	2002-04-01	Ye	Examiner
EP639815	1995-02-01		Examiner
EP818747	1998-01-01		Examiner
WO92/03905	1992-03-01		Examiner

Non-Patent Literature (30)

Conatser, Kelly, Take It To The Limit: 1-2-3/G's Solver Combines Powerful Optimization Techniques With an Intuitive Graphical Interface, Lotus, vol. 6, No. 11, p. 45, Nov. 1990.Applicant
Balachandran et al, “Capacity Planning with Demand Uncertainty”, The Engineering Economist, vol. 43, No. 1, pp. 49-2, Fall 1997.Applicant
Heiring, M.J., “Combinatorial Optimization Maximizes Profit”, Hydrocarbon Processing, vol. 76, No. 11, p. 103, Nov. 1997.Applicant
Anupindi et al, “Approximations for Multiproduct Contracts With Stochastic Demands and Business Volumn Discounts: Single Supplier Case”, IIE Transactions, vol. 30, No. 8, pp. 723-734, Aug. 1998.Applicant
Bai, D., Carpenter, T. & Mulvey, J., “Making a Case for Robust Optimization Models,” Management Science, V43N7, pp. 895-907, 1997.Applicant
Bazaraa, Mokhtar S., Hanif D. Sherali, C.M. Shetty, Nonlinear Programming: Theory and Algorithms, 2nd ed., John Wiley & Sons Inc., New York, 1993.Applicant
Brauers, Jutta and Martin Weber, “A New Method of Scenario Analysis for Strategic Planning,” Journal of Forecasting, vol. 7 No. 1, pp. 31-47, 1988.Applicant
Conn, A. R., K. Scheinberg, and Ph.L. Toint, “Recent Progress in Unconstrained Nonlinear Optimization Without Derivatives,” Mathematical Programming, vol. 79, No. 1-3, Ser. B., pp. 397-414, 1997.Applicant
Dupacova, Jitka, “Multistage Stochastic Programs: The State-of-the-Art and Selected Bibliography,” Kybernetika, vol. 31, No. 2, pp. 151-174, 1995.Applicant
Fu, Michael C., “Optimization Via Simulation: A Review,” Annals of Operations Research, vol. 53 , pp. 199-247, 1994.Applicant
Grauer, Robert R., “Returns on Levered, Actively Managed Long-run portfolios of Stocks, bonds, and bills 1934-1983,” Financial Analysts Journal, Sep.-Oct, pp. 24-43, 1985.Applicant
Kan, A. H. G. Rinnooy and G. T. Timmer, “Stochastic Global Optimization Methods Part I: Clustering Methods,” Mathematical Programming, vol. 39, No. 1, pp. 27-56, 1987.Applicant
Kan, A. H. G. Rinnooy and G. T. Timmer, “Stochastic Global Optimization Methods Part II: Multi Level Methods,” Mathematical Programming, vol. 39, No. 1, pp. 57-78, 1987.Applicant
Michaud, Richard O., Efficient Asset Management, Harvard Business School Press, Boston Massachusetts, 1998.Applicant
Mulvey, John M. and Andrzej Ruszczynski, “A New Scenario Decomposition Method for Large-Scale Stochastic Optimization,” Operations Research, vol. 43, No. 3, pp. 477-490, 1995.Applicant
Nollau, V. and A. Hahnewald-Busch, “An Approximation Procedure for Stochastic Dynamic Programming Based on Clustering of State and Action spaces,” Math. Operationsforsch. Statist., Ser. Optimization, vol. 10, No. 1, pp. 121-130, 1979.Applicant
Pflug, Georg Ch., Optimization of Stochastic Models: The Interface Between Simulation and Optimization, Kluwer Academic Publishers, Boston, 1996.Applicant
Rockafellar, R.T. and Wets, R. J.-B., “Scenarios and Policy Aggregation in Optimization Under Uncertainty,” Mathematics of Operations Research, vol. 16, No. 1, pp. 119-147, 1991.Applicant
Ruszczynski, Andrzej, “Decomposition Methods in Stochastic Programming,” Mathematical Programming, vol. 79, No. 1-3, Ser. B., pp. 333-353, 1997.Applicant
Schoen, F., “Stochastic Techniques for Global Optimization: A Survey of Recent Advances”, Journal of Global Optimization, vol. 1, No. 3, pp. 207-228, 1991.Applicant
Wets, R.J.-B., “Stochastic Programming”, In Handbooks In: Operations Research and Management Science vol. 1: Optimization; Nemhauser, G. L. , A. H. G. Rinnooy Kan, and M. J. Todd (ed),, North-Holland Publishing Co., Amsterdam, pp. 573-629, 1989.Applicant
Wets, Roger J-B., “The Aggregation Principle in Scenario Analysis and Stochastic Optimization”. In: Algorithms and Model Formulations in Mathematical Programming, (S.W. Wallace Ed.), Springer-Verlag, Berlin, pp. 91-113, 1989.Applicant
Jameson, Joel; Method of Allocating Resources in a Stochastic Environment; Nonpublished; submitted as a Disclosure Document Number S00463, Jul. 9, 1997.Applicant
Jameson, Joel; Method of Allocating Resources in a Stochastic Environment -Further Considerations; Nonpublished; submitted as a Disclosure Document Number S00730, Mar. 16, 1998.Applicant
Jameson, Joel; Method of Allocating Resources in a Stochastic Environment -Further Considerations II; Nonpublished; submitted as a Disclosure Document Number S00743, Apr. 10, 1998.Applicant
Jameson, Joel; Method of Allocating Resources in a Stochastic Environment -Further Considerations III; Nonpublished; submitted as a Disclosure Document Number S00764, May 11, 1998.Applicant
Jameson, Joel; Method of Allocating Resources in a Stochastic Environment -Further Considerations IV; Nonpublished; submitted as a Disclosure Document Number S00814, Jul. 24, 1998.Applicant
Jameson, Joel; Methods and Apparatus for Allocating Resources in an Uncertain Environment-PPA Draft I; Nonpublished; submitted as a Disclosure Document Number S00901, Dec. 14, 1998.Applicant
Jameson, Joel; Methods and Apparatus for Allocating Resources in an Uncertain Environment-PPA Draft II; Nonpublished; submitted as a Disclosure Document Number S00905, Dec. 18, 1998.Applicant
Jameson, Joel; Methods and Apparatus for Allocating Resources in an Uncertain Environment-PPA Draft III; Nonpublished; submitted as a Disclosure Document Number S00914, Jan. 6, 1999.Applicant

Abstract

Description

[0002] The present application is a continuation of non-provisional application Ser. No. 09/348,889 filed on Jul. 6, 1999, now U.S. Pat. No. 6,219,649.

BACKGROUND TECHNICAL FIELD

[0005] This invention relates to methods and systems for allocating resources in an uncertain environment.


Title	Number	Date

Method of Allocating Resources	S00463	Jul. 9, 1997
in a Stochastic Environment
Method of Allocating Resources	S00730	Mar. 16, 1998
in a Stochastic Environment -
Further Considerations
Method of Allocating Resources	S00743	Apr. 10, 1998
in a Stochastic Environment -
Further Considerations II
Method of Allocating Resources	S00764	May 11, 1998
in a Stochastic Environment -
Further Considerations III
Method of Allocating Resources	S00814	Jul. 24, 1998
in a Stochastic Environment -
Further Considerations IV
Methods and Apparatus for	S00901	Dec. 14, 1998
Allocating Resources in an
Uncertain Environment -
PPA Draft I
Methods and Apparatus for	S00905	Dec. 18, 1998
Allocating Resources in an
Uncertain Environment -
PPA Draft II
Methods and Apparatus for	S00914	Jan. 6, 1999
Allocating Resources in an
Uncertain Environment -
PPA Draft III

BACKGROUND OF PRIOR ART

[0007] Almost all organizations and individuals are constantly allocating material, financial, and human resources. Clearly, how best to allocate such resources is of prime importance.

[0011] Sometimes to allocate resources using Detailed-calculation, a computer simulation is used to evaluate:

[0012] Z_dc=E(f_dc(x_dc)) (1.0)

SUMMARY OF THE INVENTION


1.	considering how the resulting allocation performs against
	possible scenarios
2.	utilizing von Neumann-Morgenstern or other utility functions
3.	hedging and not hedging
4.	handling uncertain constraints
5.	handling discrete-quantity requirements
6.	considering multiple local optimums
7.	using and capitalizing on known methods for allocating resources
	that ignore, or do not explicitly consider, uncertainty
8.	using multiple processors.

[0026] Additional objects and advantages will become apparent from a consideration of the ensuing description and drawings.

BRIEF DESCRIPTION OF THE DRAWINGS

[0030] The invention will be more readily understood with reference to the accompanying drawings, wherein:

[0031] FIG. 1 shows a high-level flowchart;

[0032] FIG. 2 demonstrates optimized-scenario-allocation and cluster usage;

[0033] FIGS. 3A, 3B, and 3C demonstrate the three line-search techniques;

[0034] FIG. 4A shows an elementary scenario-tree; FIGS. 4A and 4B combined show the scenario-tree used by the present invention;

[0035] FIG. 5 is a skeletal definition of the WNode class;

[0036] FIG. 6 is a skeletal definition of the WScenario class;

[0037] FIG. 7 is a skeletal definition of the XAlloc class;

[0038] FIGS. 8A and 8B are skeletal definitions of the WWMatrix and AAMatrix classes;

[0039] FIG. 9 is a skeletal definition of the EvaluateXAllocAgainstWScenario function;

[0040] FIG. 10 is a skeletal definition of the DeterministicOptimizer function;

[0041] FIG. 11 is a skeletal definition of the ValueAllocation function;

[0042] FIG. 12 is a skeletal definition of the ZCluster class; and

[0043] FIGS. 13A and 13B show special von Neumann-Morgenstern utility functions.

DETAILED DESCRIPTION OF THE INVENTION

Theory of the Invention—Philosophy

[0044] The following philosophical assumptions are made:


1.	All resource allocations should fundamentally attempt to directly
	or indirectly optimize one of three things: monetary gain,
	monetary loss, or what economists term “utility.”
2.	There is no such thing as a constraint violation; for fundamentally
	any constraint can be violated, though with consequences.
	These consequences can be quantified and expressed in the
	terms of the range of the objective function, provided that the
	objective function is cast as a fundamental type.
3.	The more a constraint is violated, the larger the adverse impact on
	the fundamental objective being optimized.
4.	The adverse effect of a constraint violation is always less
	than infinity.
5.	Both objective and subjective probabilities are useful as imperfect
	estimates of what could happen.
6.	Almost every decision is a resource allocation, because almost every
	decision directly or indirectly leads to a resource allocation.
7.	Every resource allocation (and decision) would be easier and simpler
	if there was no uncertainty.

Theory of the Invention—Mathematical Framework

\begin{matrix} maximize z = \sum_{i = each scenario} p_{i} \cdot f (a_{1}, {WS}_{i}) & (2.0) \end{matrix}

[0050] where,

[0051] WS_iis a matrix containing all the random-variable realizations for scenario i

[0052] a₁is a vector containing first-stage allocations

[0053] 𝑓 is a function that evaluates first-stage allocations a₁against scenario i

[0054] p_iis the probability of scenario i

[0065] FIGS. 2, 3A, 3B, 3C, and 4A, and this mathematical approach section are here to facilitate understanding, and should not be construed to define or bound the present invention.

Embodiment

[0067] The basic embodiment of the present invention will be discussed first. Afterwards, the preferred embodiment with its extensions of the basic embodiment, will be presented.

[0078] the objective function value realized by the DeterministicOptimizer or the NativeOptimizer functions

[0079] the cash balance at the end of the last stage

[0080] the present-value of the stages' cash-flow stream

[0081] a VNM utility value based upon the monetary value at the end of the last stage

[0082] an aggregation of VNM utility values based upon monetary values at different stages

[0083] a non-VNM utility functional value

[0091] AAMatrix aaMatrix;

[0092] for(iStage=nStage−1; 2 <= iStage; iStage--)

[0093] for(iNode=each iStage stage node)

[0094] {

[0095] for(jNode=each iStage+1 stage node that follows iNode)

[0096] {

[0097] jNode.voa=0;

[0098] for(kxAlloc=each xAlloc contained in xAllocRndCntn of iNode)

[0099] {

[0100] copy vector a1 of kxAlloc to column-vector aaMatrix.aa[][1];

[0101] DeterministicOptimizer(2, aaMatrix, jNode.pGBS→wwMatrix);

[0102] jNode.voa=jNode.voa+aaMatrix.voa*jNode.nodeProbability;

[0103] for(lNode=each iStage+1 stage node that follows iNode and is not equal jNode)

[0104] {

[0105] DeterministicOptimizer(iStage+1, aaMatrix,

[0106] lNode.pGBS→wwMatrix);

[0107] jNode.voa=jNode.voa+aaMatrix.voa*

[0108] lNode.nodeProbability;

[0109] }

[0110] }

[0111] Set jNode=the iStage+1 node that follows iNode and has the highest voa;

[0112] iNode.pGBS=jNode.pGBS;

[0113] }

[0114] In Step 107, identifying the best allocations within the clusters entails:

[0115] for each cluster

[0116] {

[0117] clear xAllocBestCntn;

[0118] xAllocOpt.voa=negative infinity;

[0119] for(iwScenario=each wScenario contained in wScenarioCntn)

[0120] XAllocEvaluator(iwScenario.nativeXAlloc, TRUE);

[0121] }

[0122] The called XAllocEvaluator function member of the ZCluster class is:

[0123] ZCluster::XAllocEvaluator(xAlloc, OKadd)

[0124] {

[0125] VOA voa;

[0126] voa=0;

[0127] for(iwScenario=each wScenario in wScenarioCntn)

[0128] {

[0129] EvaluateXAllocAgainstWScenario(xAlloc, iwScenario);

[0130] voa=voa+xAlloc.voa*iwScenario.nativeProbability;

[0131] }

[0132] xAlloc.voa=voa;

[0133] //after the above first loop, the following is performed:

[0134] if(xAllocOpt.voa<xAlloc.voa)

[0135] {

[0136] xAllocOpt=xAlloc;

[0137] }

[0138] if(xAllocHurdle.voa<xAlloc.voa)

[0139] {

[0140] xAllocHurdle=xAlloc;

[0141] wasImproved=TRUE;

[0142] }

[0143] if(OKadd)

[0144] {

[0145] XAlloc xAllocDel;

[0146] xAllocDel=xAlloc in xAllocBestCntn with lowest voa;

[0147] ConsiderAppendBestXAlloc(xAlloc, xAllocDel);

[0148] }

[0149] }

[0150] ZCluster::ConsiderAppendBestXAlloc(xAllocAdd, xAllocDel)

[0151] {

[0152] if(xAllocAdd not in xAllocBestCntn)^#

[0153] # Using the comparison operator of the XAlloc class. The purpose here is to prevent xAllocBestCntn from being flooded with roughly equivalent allocations.

[0154] {

[0155] if(xAllocBestCntn.IsFull())

[0156] {

[0157] if(xAllocDel.voa<xAllocAdd.voa)

[0158] {

[0159] remove xAllocDel from xAllocBestCntn;

[0160] add xAllocAdd to xAllocBestCntn;

[0161] }

[0162] }

[0163] else

[0164] add xAllocAdd to xAllocBestCntn;

[0165] }

[0166] else

[0167] {

[0168] find i such that xAllocBestCntn[i] equals xAllocAdd and xAllocBestCntn[i].voa is minimized;

[0169] if(xAllocBestCntn[i].voa<xAllocAdd.voa)

[0170] xAllocBestCntn[i]=xAllocAdd;

[0171] }

[0172] }

[0173] Step 109 entails:

[0174] for each cluster

[0175] Improver();

[0176] Cluster member function Improver entails:

[0177] Improver()

[0178] {

[0179] Perform the following, one or more times:

[0180] xAllocOpt.h=0;

[0181] xAlloc0=xAllocOpt;

[0182] Randomly select an xAlloc object from xAllocBestCntn that has not previously been paired with (within current zCluster instance), and is different from, the current xAllocOpt.

[0183] xAlloc1=randomly selected xAlloc;

[0184] xAlloc1.h=1;

[0185] xAllocHurdle=xAlloc1;

[0186] xAllocBnd=xAlloc1;

[0187] wasImproved=false;

[0188] SimpleParabolaSearch();

[0189] if(!wasImproved)

[0190] InnerCompressSearch();

[0191] if(!wasImproved)

[0192] OuterCompressSearch();

[0193] if(wasImproved)

[0194] ConsiderAppendBestXAlloc(xAllocHurdle, xAlloc1);

[0195] }

[0197] ZCluster::SimpleParabolaSearch()

[0198] {

[0199] Do the following, one or more times, each time with a different h value:

[0200] {

[0201] GenxAlloch(h);

[0202] if(0<xAlloch.h<xAllocBnd.h)

[0203] xAllocBnd=xAlloch;

[0204] if(wasImproved)

[0205] {

[0206] Determine the parabola passing through the following three points(where the first coordinate is the domain and the second coordinate the range):

[0207] (0, xAlloc0.voa),

[0208] (h, xAlloch.voa),

[0209] (1, xAlloc1.voa);

[0210] if(such a parabola exists and has a maximal value)

[0211] {

[0212] Set h2 equal to the domain value that yields the maximal value;

[0213] GenxAlloch(h2);

[0214] }

[0215] if(0<xAlloch.h<xAllocBnd.h)

[0216] xAllocBnd=xAlloch;

[0217] exit function;

[0218] }

[0219] }

[0220] }

[0221] The GenxAlloch function, with its h argument, follows:

[0222] ZCluster::GenxAlloch(h)

[0223] {

[0224] for(i=0;i<number of elements in vector a1; i++)

[0225] if(a1[i] is interval or ratio numeric)

[0226] {

[0227] xAlloch.a1[i]=(1−h)*xAlloc0.a1[i]+(h)*xAlloc1.a1[i];

[0228] if(xAlloch.a1[i] should be discrete)

[0229] round xAlloch.a1[i] to be discrete;

[0230] if(xAlloch.a1[i] is necessarily out of bounds)

[0231] bring xAlloch.a1[i] within bounds;

[0232] }

[0233] else if(a1[i] is an ordinal numeric)

[0234] {

[0235] set xAlloch.a1[i] equal the ordinal value that is closest to/most associated with:

[0236] (1−h)*xAlloc0.a1[i]+(h)*xAlloc1.a1[i];

[0237] }

[0238] else

[0239] {

[0240] if(h<=0.5)

[0241] xAlloch.a1[i]=xAlloc0.a1[i];

[0242] else

[0243] xAlloch.a1[i]=xAlloc1.a1[i];

[0244] }

[0245] //after the above first loop, the following is performed:

[0246] xAlloch.h=h;

[0247] if(xAlloch.a1 is feasible)

[0248] {

[0249] XAllocEvaluator(xAlloch, FALSE);

[0250] xAlloch.feasible=TRUE;

[0251] }

[0252] else

[0253] {

[0254] dis=minimum(abs(h), abs(h−1));

[0255] xAlloch.voa=(lowest voa contained in xAllocBestCntn's xAlloc objects)−(positive constant)*dis*dis;

[0256] xAlloch.feasible=FALSE;

[0257] }

[0258] }

[0261] ZCluster::InnerCompressSearch()

[0262] {

[0263] GenxAlloch(h3);

[0264] xAlloc0off=xAlloch;

[0265] if(xAlloc0.voa<xAlloc0off.voa)

[0266] {

[0267] do one or more times:

[0268] {

[0269] Determine the parabola passing through the following three points:

[0270] (0, xAlloc0.voa),

[0271] (xAlloc0off.h, xAlloc0off.voa),

[0272] (xAllocBnd.h, xAllocBnd.voa);

[0273] if(such a parabola exists and has a maximal value)

[0274] {

[0275] Set h4 equal to the domain value of the parabola that yields the maximal range value;

[0276] if(h4 between 0 and xAllocBnd.h)

[0277] {

[0278] GenxAlloch(h4);

[0279] xAllocBnd=xAlloch;

[0280] }

[0281] else

[0282] exit function;

[0283] }

[0284] else

[0285] {

[0286] exit function;

[0287] }

[0288] }

[0289] }

[0290] }

[0291] The OuterCompressSearch function uses a parameter hDec that can be any positive value.

[0292] ZCluster::OuterCompressSearch()

[0293] {

[0294] XAlloc trailxAlloc1, trailxAllocm, trailxAllocr;

[0295] XAlloc org0, org1;

[0296] trailxAllocm=xAlloc0;

[0297] trailxAllocr=xAlloc1;

[0298] org0=xAlloc0;

[0299] org1=xAlloc1;

[0300] h5=0;

[0301] do one or more times:

[0302] {

[0303] h5=h5−hDec;

[0304] GenxAlloch(h5);

[0305] if(trailxAllocm.voa<xAlloch.voa)

[0306] {

[0307] trailxAllocr=trailxAllocm;

[0308] trailxAllocm=xAlloch;

[0309] }

[0310] else

[0311] {

[0312] trailxAlloc1=xAlloch;

[0313] if(trailxAlloc1.feasible)

[0314] {

[0315] Determine the parabola passing through the following three points:

[0316] (trailxAlloc1.h, trailxAlloc1.voa),

[0317] (trailxAllocm.h, trailxAllocm.voa),

[0318] (trailxAllocr.h, trailxAllocr.voa);

[0319] if(such a parabola exists and has a maximal value)

[0320] {

[0321] Set h5 equal to the domain value of the parabola that yields the maximal range value;

[0322] GenxAlloch(h5);

[0323] if(trailxAllocm.h<xAllocOpt.h)

[0324] trailxAlloc1=trailxAllocm;

[0325] }

[0326] }

[0327] xAlloc0=xAllocOpt;

[0328] xAlloc1=trailxAlloc1;

[0329] xAllocBnd=xAlloc1;

[0330] xAllocBnd.h=1;

[0331] InnerCompressSearch();

[0332] if(InnerCompressSearch improved xAllocHurdle)

[0333] {

[0334] xAllocHurdle.h=xAlloc0.h−(xAlloc0.h−xAlloc1.h)*xAllocHurdle.h;

[0335] }

[0336] xAlloc0=org0;

[0337] xAlloc1=org1;

[0338] exit function;

[0339] }

[0340] }

[0341] }

[0343] create zCluster instance newZCluster;

[0344] for(each old cluster being merged into newZCluster)

[0345] add each wScenario in oldZCluster.wScenarioCntn to newZCluster.wScenarioCntn;

[0346] for(each old cluster being merged into newZCluster)

[0347] {

[0348] for(xAllocPrev=each xAlloc in oldZCluster.xAllocBestCntn)

[0349] newZCluster.XAllocEvaluator(xAllocPrev, TRUE);

[0350] destroy oldZCluster;

[0351] }

[0352] After the clusters have been merged, processing resumes at Step 109.

Miscellaneous Considerations

Example Resource Allocations

EXAMPLE 1

Designing a New Manufacturing Facility with Uncertain Future Demand

[0357] Capacity requirements for a new manufacturing facility are needed, but it is uncertain what they should be, because future product demand is uncertain and seasonal.

EXAMPLE 2

Cash Management with Uncertain Receipts and Uncertain Payouts

[0363] The first step is to generate scenarios. Each stage of each scenario (i.e., each w vector) has the following:

[0364] A) for each existing and possible-future investment:

[0365] cash requirements

[0366] cash receipts

[0367] acquisition price

[0368] divestiture price

[0369] B) contingent realizations of:

[0370] extra cash requirements

[0371] extra cash receipts

[0372] C) status data concerning:

[0373] interest rates

[0374] stock market conditions.

EXAMPLE 3

Optimizing a Financial Portfolio with Uncertain Future Returns

[0381] Scenarios are generated using state-of-the-art techniques. For each FI that is or may be owned, twelve monthly prices and returns are included in each scenario.

EXAMPLE 4

Portfolio Replication with Uncertain Coupling

EXAMPLE 5

Allocating Organizational Resources in an Uncertain Environment

[0394] The ValueAllocation function determines the present-value of the changes in WI_Cash (or Internal Producer's Surplus) during each time period (stage).

[0396] Processing proceeds as previously described until only one zCluster remains. Its xAllocOpt.a1 allocations are the a₁allocations to be initially implemented.

Conclusion

[0420] class GenMergedGBS()

[0421] {

[0422] wwMatrixBestCntn;

[0423] wwMatrixOpt;

[0424] WWMatrixEvaluator(wwMatrix, OKadd)

[0425] {

[0426] AAMatrix aaMatrix;

[0427] WWMatrix wwMatrixTemp;

[0428] wwMatrixTemp=wwMatrix;

[0429] wwMatrix.voa=0;

[0430] for(each xAlloc in iNode.xAllocRndCntn)

[0431] {

[0432] copy xAlloc.a1 to aaMatrix.aa[][1];

[0433] DeterministicOptimizer(2, aaMatrix, wwMatrixTemp);

[0434] for(jNode=each iStage+1 node following iNode)

[0435] {

[0436] DeterministicOptimizer(iStage+1, aaMatrix,

[0437] jNode.pGBS→wwMatrix);

[0438] wwMatrix.voa=wwMatrix.voa+aaMatrix.voa*jNode.nodeProbability;

[0439] }

[0440] }

[0441] // . . . Analogously follows code after first loop in ZCluster::XAllocEvaluator. . .

[0442] }

[0443] ConsiderAppendBestWWMatrix(wwMatrixAdd, wwMatrixDel);

[0444] MainBody()

[0445] {

[0446] for(jNode=each iStage+1 node following iNode)

[0447] WWMatrixEvaluator(jNode.pGBS→wwMatrix, TRUE);

[0448] Improver();

[0449] iNode.pGBS=(pointer to, copy of) wwMatrixOpt;

[0450] }

[0451] Improver();

[0452] SimpleParabolaSearch();

[0453] InnerCompressSearch();

[0454] OuterCompressSearch();

[0455] GenwwMatrixh(h)

[0456] {

[0457] Analogously follows ZCluster::GenxAlloch, except first loop is applied to all columns of wwMatrix.

[0458] }

[0459] wwMatrixHurdle;

[0460] wasImproved;

[0461] wwMatrix0;

[0462] wwMatrix0off,

[0463] wwMatrix1;

[0464] wwMatrixh;

[0465] wwMatrixBnd;

[0466] }

[0471] MAAMatrix mAAMatrix;

[0472] AAMatrix aaMatrix;

[0473] GenMultipleGBS gmGBS;

[0474] gmGBS.nElemAAMatrixBestArray=0;

[0475] gmGBS.iStage=iStage;

[0476] gmGBS.iNode=iNode;

[0477] gmGBS.nRecorder=0;

[0478] for(jNode=each iStage+1 node following iNode)

[0479] {

[0480] empty mAAMatrix of aa arrays;

[0481] for(each xAlloc in iNode.xAllocRndCntn)

[0482] {

[0483] copy xAlloc.a1 to aaMatrix.aa[][1];

[0484] DeterministicOptimizer(2, aaMatrix, jNode.pGBS→wwMatrix);

[0485] Add aaMatrix.aa to mAAMatrix;

[0486] }

[0487] gmGBS.MAAMatrixEvaluator(mAAMatrix, TRUE);

[0488] }

[0489] gmGBS.Improver();

[0490] The GenMultipleGBS class is conceptually based upon the ZCluster class, with MAAMatrix replacing XAlloc.

[0491] class GenMultipleGBS: public . . .

[0492] {

[0493] iStage;

[0494] iNode;

[0495] struct

[0496] {

[0497] index_h0;

[0498] index_h1;

[0499] h;

[0500] index_hResult;

[0501] }recorder[];

[0502] nRecorder;

[0503] mAAMatrixBestArray[]; //analogous with xAllocBestCntn.

[0504] nElemAAMatrixBestArray;

[0505] mAAMatrixOpt;

[0506] iMax;

[0507] MAAMatrixEvaluator(mAAMatrix, OKadd)

[0508] {

[0509] mAAMatrix.voa=0;

[0510] for(jNode=each iStage+1 node following iNode)

[0511] {

[0512] for(aaMatrix=each aa array contained in mAAMatrix)

[0513] DeterministicOptimizer(iStage+1, aaMatrix,

[0514] jNode.pGBS→wwMatrix);

[0515] mAAMatrix.voa=mAAMatrix.voa+aaMatrix.voa*jNode.nodeProbability;

[0516] }

[0517] }

[0518] // . . . Analogously follows code after first loop in ZCluster::XAllocEvaluator . . .

[0519] }

[0520] ConsiderAppendBestMAAMatrix(mAAMatrixAdd, mAAMatrixDel)

[0521] {

[0522] if(nElemAAMatrixBestArray==0∥

[0523] mAAMatrixBestArray[iMax].voa<mAAMatrixAdd.voa)

[0524] imax=nElemAAMatrixBestArray;

[0525] mAAMatrixBestArray[nElemAAMatrixBestArray++]=mAAMatrixAdd;

[0526] //positions need to be kept constant and elements not

[0527] //removed, so that re-play works correctly.

[0528] }

[0529] Improver()

[0530] {

[0531] Follows ZCluster::Improver, except that when and if

[0532] ConsiderAppendBestMAAMatrix is called because an iteration yields an improvement over the beginning mAAMatrixHurdle, the following is also done after the call to ConsiderAppendBestMAAMatrix:

[0533] {

[0534] recorder[nRecorder].index_h0=i, such that mAAMatrixBestArray[i]=mAAMatrix0;

[0535] recorder[nRecorder].index_h1=i, such that mAAMatrixBestArray[i]=mAAMatrix1;

[0536] recorder[nRecorder].h=mAAMatrixHurdle.h;

[0537] recorder[nRecorder].index_hResult=i, such that mAAMatrixBestArray[i]=mAAMatrixHurdle;

[0538] nRecorder++;

[0539] }

[0540] }

[0541] SimpleParabolaSearch();

[0542] InnerCompressSearch();

[0543] OuterCompressSearch();

[0544] GenMAAMatrixh(h)

[0545] {

[0546] for(k=each aa matrix in mAAMatrix)

[0547] {

[0548] Analogously apply first loop of ZCluster::GenxAlloch to merge columns 1 through iStage of kth aa array of mAAMatrix0 and mAAMatrix1 into columns 1 through iStage of kth aa array of mAAMatrixh.

[0549] }

[0550] // . . . Analogously follows code after first loop in ZCluster::GenxAlloch . . .

[0551] }

[0552] mAAMatrixHurdle;

[0553] wasImproved;

[0554] mAAMatrix0;

[0555] mAAMatrix0off;

[0556] mAAMatrix1;

[0557] mAAMatrixh;

[0558] mAAMatrixBnd;

[0559] }

[0561] {

[0562] aaMatrixArray[]; //i.e., array of AAMatrix objects.

[0563] i=0;

[0564] for(jNode=each iStage+1 node following iNode)

[0565] {

[0566] DeterministicOptimizer(iFlexStage, aaMatrix,

[0567] jNode.pGBS→wwMatrix);

[0568] aaMatrixArray[i++]=aaMatrix;

[0569] }

[0570] for(i=0; i<gmGBS.nRecorder; i++)

[0571] {

[0572] using:

[0573] aaMatrixArray[gmGBS.recorder[i].index_h0].aa[][iStage],

[0574] aaMatrixArray[gmGBS.recorder[i].index_h1].aa[ ][iStage],

[0575] gmGBS.recorder[i].h;

[0576] apply processing analogous to first loop of ZCluster::GenxAlloch to create merged values for column:

[0577] aaMatrixArray[gmGBS.recorder[i].index_hResult].aa[][iStage].

[0578] }

[0579] Copy column aaMatrixArray[gmGBS.recorder[iMax].index_hResult].aa[][iStage] to column aaMatrix.aa[][iStage].

[0580] }

[0581] (Note: When looping through the jNode objects, the sequence of fetching jNode objects needs to be consistent.)

[0582] 17. Besides allocating resources, this invention can also value resources, which as previously described, can be used to allocate resources.

[0584] zz(0,0)=zz(q,c)

Claims

What I claim is:

1. A computer system for optimally allocating organizational resources comprising:

means for obtaining at least two scenarios;

means for obtaining at least a first-stage allocation for at least two of said scenarios; and

means for determining an Optimal Final Allocation including:

means for separately optimizing said first-stage allocations against each scenario such that said optimizing means generates additional stage allocations,

means for re-optimizing the additional stage allocations against each scenario, and

means for resolving infeasibilities that may occur during said means for optimizing and said means for re-optimizing.

Patent Citations (26)

Patent	Date	Inventor	Cited By
US4885686(A)	1989-12-01	Vanderbei	Examiner
US4914563(A)	1990-04-01	Karmarkar et al.	Examiner
US4924386(A)	1990-05-01	Freedman et al.	Examiner
US5148365(A)	1992-09-01	Dembo	Applicant
US5216593(A)	1993-06-01	Dietrich et al.	Examiner
US5255345(A)	1993-10-01	Shaefer	Applicant
US5262956(A)	1993-11-01	DeLeeuw	Applicant
US5289370(A)	1994-02-01	Lirov	Examiner
US5291397(A)	1994-03-01	Powell	Examiner
US5343388(A)	1994-08-01	Wedelin	Examiner
US5404516(A)	1995-04-01	Geordiades et al.	Examiner
US5630070(A)	1997-05-01	Dietrich et al.	Examiner
US5649113(A)	1997-07-01	Zhu et al.	Examiner
US5799287(A)	1998-08-01	Dembo	Examiner
US5890133(A)	1999-03-01	Ernst	Examiner
US5913199(A)	1999-06-01	Dueck et al.	Examiner
US5963910(A)	1999-10-01	Ulwick	Examiner
US6006192(A)	1999-12-01	Cheng et al.	Examiner
US6032123(A)	2000-02-01	Jameson	Examiner
US6035277(A)	2000-03-01	Anbil et al.	Examiner
US6219649(B1)	2001-04-01	Jameson	Examiner
US6263253(B1)	2001-07-01	Yang et al.	Examiner
US6374227(B1)	2002-04-01	Ye	Examiner
EP639815	1995-02-01		Examiner
EP818747	1998-01-01		Examiner
WO92/03905	1992-03-01		Examiner

Non-Patent Literature (30)

Conatser, Kelly, Take It To The Limit: 1-2-3/G's Solver Combines Powerful Optimization Techniques With an Intuitive Graphical Interface, Lotus, vol. 6, No. 11, p. 45, Nov. 1990.Applicant

Balachandran et al, “Capacity Planning with Demand Uncertainty”, The Engineering Economist, vol. 43, No. 1, pp. 49-2, Fall 1997.Applicant

Heiring, M.J., “Combinatorial Optimization Maximizes Profit”, Hydrocarbon Processing, vol. 76, No. 11, p. 103, Nov. 1997.Applicant

Anupindi et al, “Approximations for Multiproduct Contracts With Stochastic Demands and Business Volumn Discounts: Single Supplier Case”, IIE Transactions, vol. 30, No. 8, pp. 723-734, Aug. 1998.Applicant

Bai, D., Carpenter, T. & Mulvey, J., “Making a Case for Robust Optimization Models,” Management Science, V43N7, pp. 895-907, 1997.Applicant

Bazaraa, Mokhtar S., Hanif D. Sherali, C.M. Shetty, Nonlinear Programming: Theory and Algorithms, 2nd ed., John Wiley & Sons Inc., New York, 1993.Applicant

Brauers, Jutta and Martin Weber, “A New Method of Scenario Analysis for Strategic Planning,” Journal of Forecasting, vol. 7 No. 1, pp. 31-47, 1988.Applicant

Conn, A. R., K. Scheinberg, and Ph.L. Toint, “Recent Progress in Unconstrained Nonlinear Optimization Without Derivatives,” Mathematical Programming, vol. 79, No. 1-3, Ser. B., pp. 397-414, 1997.Applicant

Dupacova, Jitka, “Multistage Stochastic Programs: The State-of-the-Art and Selected Bibliography,” Kybernetika, vol. 31, No. 2, pp. 151-174, 1995.Applicant

Fu, Michael C., “Optimization Via Simulation: A Review,” Annals of Operations Research, vol. 53 , pp. 199-247, 1994.Applicant

Grauer, Robert R., “Returns on Levered, Actively Managed Long-run portfolios of Stocks, bonds, and bills 1934-1983,” Financial Analysts Journal, Sep.-Oct, pp. 24-43, 1985.Applicant

Kan, A. H. G. Rinnooy and G. T. Timmer, “Stochastic Global Optimization Methods Part I: Clustering Methods,” Mathematical Programming, vol. 39, No. 1, pp. 27-56, 1987.Applicant

Kan, A. H. G. Rinnooy and G. T. Timmer, “Stochastic Global Optimization Methods Part II: Multi Level Methods,” Mathematical Programming, vol. 39, No. 1, pp. 57-78, 1987.Applicant

Michaud, Richard O., Efficient Asset Management, Harvard Business School Press, Boston Massachusetts, 1998.Applicant

Mulvey, John M. and Andrzej Ruszczynski, “A New Scenario Decomposition Method for Large-Scale Stochastic Optimization,” Operations Research, vol. 43, No. 3, pp. 477-490, 1995.Applicant

Nollau, V. and A. Hahnewald-Busch, “An Approximation Procedure for Stochastic Dynamic Programming Based on Clustering of State and Action spaces,” Math. Operationsforsch. Statist., Ser. Optimization, vol. 10, No. 1, pp. 121-130, 1979.Applicant

Pflug, Georg Ch., Optimization of Stochastic Models: The Interface Between Simulation and Optimization, Kluwer Academic Publishers, Boston, 1996.Applicant

Rockafellar, R.T. and Wets, R. J.-B., “Scenarios and Policy Aggregation in Optimization Under Uncertainty,” Mathematics of Operations Research, vol. 16, No. 1, pp. 119-147, 1991.Applicant

Ruszczynski, Andrzej, “Decomposition Methods in Stochastic Programming,” Mathematical Programming, vol. 79, No. 1-3, Ser. B., pp. 333-353, 1997.Applicant

Schoen, F., “Stochastic Techniques for Global Optimization: A Survey of Recent Advances”, Journal of Global Optimization, vol. 1, No. 3, pp. 207-228, 1991.Applicant

Wets, R.J.-B., “Stochastic Programming”, In Handbooks In: Operations Research and Management Science vol. 1: Optimization; Nemhauser, G. L. , A. H. G. Rinnooy Kan, and M. J. Todd (ed),, North-Holland Publishing Co., Amsterdam, pp. 573-629, 1989.Applicant

Wets, Roger J-B., “The Aggregation Principle in Scenario Analysis and Stochastic Optimization”. In: Algorithms and Model Formulations in Mathematical Programming, (S.W. Wallace Ed.), Springer-Verlag, Berlin, pp. 91-113, 1989.Applicant

Jameson, Joel; Method of Allocating Resources in a Stochastic Environment; Nonpublished; submitted as a Disclosure Document Number S00463, Jul. 9, 1997.Applicant

Jameson, Joel; Method of Allocating Resources in a Stochastic Environment -Further Considerations; Nonpublished; submitted as a Disclosure Document Number S00730, Mar. 16, 1998.Applicant

Jameson, Joel; Method of Allocating Resources in a Stochastic Environment -Further Considerations II; Nonpublished; submitted as a Disclosure Document Number S00743, Apr. 10, 1998.Applicant

Jameson, Joel; Method of Allocating Resources in a Stochastic Environment -Further Considerations III; Nonpublished; submitted as a Disclosure Document Number S00764, May 11, 1998.Applicant

Jameson, Joel; Method of Allocating Resources in a Stochastic Environment -Further Considerations IV; Nonpublished; submitted as a Disclosure Document Number S00814, Jul. 24, 1998.Applicant

Jameson, Joel; Methods and Apparatus for Allocating Resources in an Uncertain Environment-PPA Draft I; Nonpublished; submitted as a Disclosure Document Number S00901, Dec. 14, 1998.Applicant

Jameson, Joel; Methods and Apparatus for Allocating Resources in an Uncertain Environment-PPA Draft II; Nonpublished; submitted as a Disclosure Document Number S00905, Dec. 18, 1998.Applicant

Jameson, Joel; Methods and Apparatus for Allocating Resources in an Uncertain Environment-PPA Draft III; Nonpublished; submitted as a Disclosure Document Number S00914, Jan. 6, 1999.Applicant

Methods and apparatus for allocating resources in the presence of uncertainty

Abstract

Metadata

Inventor

Application Information

Classifications

Patent Drawings (7 sheets)

Description

CROSS REFERENCE TO RELATED APPLICATIONS

BACKGROUND TECHNICAL FIELD

BACKGROUND OF PRIOR ART

SUMMARY OF THE INVENTION

BRIEF DESCRIPTION OF THE DRAWINGS

DETAILED DESCRIPTION OF THE INVENTION

Theory of the Invention—Philosophy

Theory of the Invention—Mathematical Framework

Embodiment

Miscellaneous Considerations

Example Resource Allocations

EXAMPLE 1

Designing a New Manufacturing Facility with Uncertain Future Demand

EXAMPLE 2

Cash Management with Uncertain Receipts and Uncertain Payouts

EXAMPLE 3

Optimizing a Financial Portfolio with Uncertain Future Returns

EXAMPLE 4

Portfolio Replication with Uncertain Coupling

EXAMPLE 5

Allocating Organizational Resources in an Uncertain Environment

Conclusion

Claims

Patent Citations (26)

Non-Patent Literature (30)

Methods and apparatus for allocating resources in the presence of uncertainty

Abstract

Metadata

Inventor

Application Information

Classifications

Patent Drawings (7 sheets)

Description

CROSS REFERENCE TO RELATED APPLICATIONS

BACKGROUND TECHNICAL FIELD

BACKGROUND OF PRIOR ART

SUMMARY OF THE INVENTION

BRIEF DESCRIPTION OF THE DRAWINGS

DETAILED DESCRIPTION OF THE INVENTION

Theory of the Invention—Philosophy

Theory of the Invention—Mathematical Framework

Embodiment

Miscellaneous Considerations

Example Resource Allocations

EXAMPLE 1

Designing a New Manufacturing Facility with Uncertain Future Demand

EXAMPLE 2

Cash Management with Uncertain Receipts and Uncertain Payouts

EXAMPLE 3

Optimizing a Financial Portfolio with Uncertain Future Returns

EXAMPLE 4

Portfolio Replication with Uncertain Coupling

EXAMPLE 5

Allocating Organizational Resources in an Uncertain Environment

Conclusion

Claims

Patent Citations (26)

Non-Patent Literature (30)