Differential methods applied to the solution of two-sided allocation problems
Bartley, Robert H.
MetadataShow full item record
A procedure is developed which can be used to obtain the solution of a two-sided allocation problem with payoff of the form I = 5 Q K(x,y«t)dt if K is concave in x(t), i.e. K < a xx 0, and convex in y(t) for all t in the interval [a,b]„ A second degree polynomial example is explained in detail to illustrate the procedure. The computer program and a sample output for this example constitute the Appendix. Next an exponential search problem is discussed. Then in conclusion a general application of the method is outlined.
Showing items related by title, author, creator and subject.
Gilchrist, Richard B. (Cambridge, Massachusetts: Massachusetts Institute of Technology, 1964);Dynamic programming is employed to obtain a solution to the problem of controlling a nonlinear system in an optimal fashion, subject to a quadratic performance index. The technique sued is similar to that given by Merriam ...
Yost, Kirk A. (Monterey, California. Naval Postgraduate School, 1998);We develop methods for optimally solving problems that require allocating scarce resources among activities that either gather information on a set of objects or take actions to change their status. Also, the information ...
Unsal, Omur (Monterey, California. Naval Postgraduate School, 2010-06);Wood (1995) to handle multiple types of interdiction assets (e.g., aircraft, ground-based inspection teams), referred to here as "inspectors." A single evader attempts to traverse a path between two vertices in a directed ...