TITLE

A Multiplier Adjustment Method for Dynamic Resource Allocation Problems

AUTHOR(S)
Carvalho, Tassio A.; Powell, Warren B.
PUB. DATE
May 2000
SOURCE
Transportation Science;May2000, Vol. 34 Issue 2, p150
SOURCE TYPE
Academic Journal
DOC. TYPE
Article
ABSTRACT
Dynamic fleet management problems (with a homogeneous fleet) are classically formulated as dynamic networks, or linear programs with side constraints. Recently, a new dynamic control approach was introduced, called a logistics queueing network. Instead of a large linear program, the problem is decomposed into small subproblems that are guided by two control variables that push these local problems to produce a solution that is close to a global optimum. In prior work, these control variables were updated using a subgradient approximation. In this paper, we propose a multiplier adjustment method for solving the same problem. Numerical experiments show that this method produces better solutions with greater stability. The new method is somewhat slower, and is more difficult to implement. We believe that both methods will represent reasonable choices for solving the problem.
ACCESSION #
4292846

 

Related Articles

  • ASSIGNMENT PROBLEM BASED ON ORDINAL PREFERENCES. Gäauml;rdenfors, Peter // Management Science;Nov73, Vol. 20 Issue 3, p331 

    The assignment problem, a well-known variant of which is the problem of optimal staff distribution, has formerly been treated as a problem of linear optimization starting with numerical evaluations of the assignments. In this paper the assignment problem is regarded as a problem of social...

  • THE GREEDY PROCEDURE FOR RESOURCE ALLOCATION PROBLEMS: NECESSARY AND SUFFICIENT CONDITIONS FOR OPTIMALITY. Federgruen, Awl; Groenevelt, Henri // Operations Research;Nov/Dec86, Vol. 34 Issue 6, p909 

    In many resource allocation problems, the objective is to allocate discrete resource units to a set of activities so as to maximize a concave objective function subject to upper bounds on the total amounts allotted to certain groups of activities. If the constraints determine a polymatroid and...

  • ALTERNATE FORMULATIONS FOR STATIC MULTI-ATTRIBUTE ASSIGNMENT MODELS. Srinivasan, V.; Thompson, G. L. // Management Science;Oct73, Vol. 20 Issue 2, p154 

    In an earlier issue of this journal, Charnes, Cooper, Niehaus and Stedry provided different problem formulations to take into account the multiple attributes that organizations may consider in assigning men to jobs. The present paper shows that their formulations for static multi-attribute...

  • FOREST MANAGEMENT AND OPERATIONAL RESEARCH: A LINEAR PROGRAMMING STUDY. Wardle, P.A. // Management Science;Aug1965, Vol. 11 Issue 10, pB-260 

    The article discusses the use of linear programming for making decisions on the allocation of resources in forest management. The example of the problem is given as a forester having 100 acres with over-mature hardwood timber worth £200 per acre. The problem arises with the enterprise...

  • A DECISION AND VALUE APPROACH TO RESEARCH PERSONNEL ALLOCATION. Childs, Martin; Wolfe, Harvey // Management Science;Feb1972, Vol. 18 Issue 6, pB-269 

    A problem which exists in a large research laboratory is the allocation of professional people to work on research projects. Each department manager must allocate his personnel so that effectiveness, value of a given man to a given project, is maximized. Computationally, the transportation...

  • DISCRETE-VARIABLE EXTREMUM PROBLEMS. Dantzig, George B. // Operations Research;Apr57, Vol. 5 Issue 2, p266 

    This paper reviews some recent successes in the use of linear programming methods for the solution of discrete-variable extremum problems. One example of the use of the multistage approach of dynamic programming for this purpose is also discussed.

  • On the Maximum Noninteger Polyhedron Vertices of the Three-index Axial Assignment Problem. Kravtsov, V. M. // Automation & Remote Control;Mar2004, Vol. 65 Issue 3, p413 

    Consideration was given to the maximum noninteger polyhedron vertices in the three-index axial assignment problem of the order n, that is, vertices with 3n - 2 fractional components. New types of these vertices were specified and their combinatorial characteristics studied.

  • The Audit Staff Assignment Problem: A Linear Programming Analysis. Summers, Edward L. // Accounting Review;Jul72, Vol. 47 Issue 3, p443 

    This paper discusses the assignment of audit staff personnel to audit engagements to conform to the limitations of an audit office and at the same time meet the unique professional and economic objectives of that office. A linear programming model of this assignment problem is being discusses...

  • IMPLICATIONS OF RESOURCE DIRECTIVE ALLOCATION MODELS FOR ORGANIZATIONAL DESIGN. Freeland, James R.; Moore, Jeffrey H. // Management Science;Jun77, Vol. 23 Issue 10, p1050 

    This paper develops theoretical results, for a class of coordination mechanisms for resource allocation in decentralized firms, using as a model the decomposition of linear programs. Of the two pure decentralized allocation mechanisms (price-directive and resource-directive), resource-directive...

Share

Read the Article

Courtesy of THE LIBRARY OF VIRGINIA

Sorry, but this item is not currently available from your library.

Try another library?
Sign out of this library

Other Topics