This paper investigates the effect on the optimum solution of a capacitated generalized transportation problem when certain data of the problem are continuously varied as a linear function of a single parameter. First the rim conditions, then the cost coefficients, and finally the cell upper bounds are varied parametrically and the effect on the optimal solution, the associated change in costs and the dual changes are derived. Finally the effect of simultaneous changes in both cost coefficients and rim conditions are investigated. Bound operators that effect changes in upper bounds are shown to be equivalent to rim operators. The discussion in this paper is limited to basis preserving operators for which the changes in the data are such that the optimum bases are preserved. 相似文献
This paper is concerned with assigning and sequencing a set of activities for some or all members of a crew of operators so that the completion time of all such operations is minimized. It is assumed that each of the operators in the crew possesses, initially, certain tasks that only he can perform. A branch-and-bound scheme is proposed to treat the problem, and suitable computational experience is provided. 相似文献
In this paper we have applied the mathematical control theory to the accounting network flows, where the flow rates are constrained by linear inequalities. The optimal control policy is of the “generalized bang-bang” variety which is obtained by solving at each instant in time a linear programming problem whose objective function parameters are determined by the “switching function” which is derived from the Hamiltonian function. The interpretation of the adjoint variables of the control problem and the dual evaluators of the linear programming problem demonstrates an interesting interaction of the cross section phase of the problem, which is characterized by linear programming, and the dynamic phase of the problem, which is characterized by control theory. 相似文献
Although the strategic airlift system is under continuous analysis, C-5A problems provided impetus to analyze the airlift system productivity function by using a large-scale simulation model. Development of the simulation model (Simulation of Airlift Resources - SOAR) was initiated by the Office of Secretary of Defense (Systems Analysis) in 1966. SOAR had barely become operational in time for the study in November 1968. Since limited verification and validation tests had been performed on the simulation model, the design of experiments was of critical importance. The experimental design had to be flexible enough to salvage the maximum amount of information possible upon the discovery of either a verification or validation error. In addition, the experimental design was required to accommodate the estimation of a large number of possibly changing independent variables. The experimental design developed for the analysis was full factorial design sets for a finite number of factors. Initial analysis began with aggregated sets of factors at two levels, and information gained from experiment execution was used to parse the sets. The process was sequential and parsing continued until the major explanatory independent variables were identified or enough information was obtained to eliminate the factor from further direct analysis. This design permitted the overlapping of simulation runs to fill out the factorial design sets. In addition to estimating the airlift productivity function, several other findings are reported which tended to disprove previous assumptions about the nature of the strategic airlift system. 相似文献
This paper investigates the effect on the optimum solution of a (capacitated) transportation problem when the data of the problem (the rim conditions-i. e., the warehouse supplies and market demands-, the per unit transportation costs and the upper bounds) are continuously varied as a (linear) function of a single parameter. Operators that effect the transformation of optimum solution associated with such data changes, are shown to be a product of basis preserving operators (described in the earlier paper) that operate on a sequence of adjacent basis structures. Algorithms are provided for both rim and cost operators. The paper concludes with a discussion of the economic and managerial interpretations of the operators. 相似文献
The chief problems considered are: (1) In a parallel set of warehouses, how should stocks be allocated? (2) In a system consisting of a central warehouse and several subsidiary warehouses, how much stock should be carried in each? The demands may have known, or unknown, distribution functions. For problem (1), the i-th stock ni should usually be allocated in proportion to the i-th demand mi; in special cases, a significant improvement is embodied in the formula (N = total allocable stock)
The problem posed in this paper is to sequence or route n jobs, each originating at a particular location or machine, undergoing r?1 operations or repairs, and terminating at the location or machine from which it originated. The problem is formulated as a 0-1 integer program, with block diagonal structure, comprised of r assignment subproblems; and a joint set of constraints to insure cyclical squences. To obtain integer results the solutions to each subproblem are ranked as required and combinations thereof are implicitly enumerated. The procedure may be terminated at any step to obtain an approximate solution. Some limited computational results are presented. 相似文献