摘要:

AbstractProblems having the mathematical structure of a quadratic assignment problem are found in a diversity of contexts: by the economist in assigning a number of plants or indivisible operations to a number of different geographical locations; by the architect or indusatrial engineer in laying out activities, offices, or departments in a building; by the human engineer in arranging the indicators and controls in an operators control room; by the electronics engineer in laying out components on a backboard; by the computer systems engineer in arranging information in drum and disc storage; by the production scheduler in sequencing work through a production facility; and so on.In this paper we discuss several types of algorithms for solving such problems, presenting a unifying framework for some of the existing algorithms, and dcscribing some new algorithms. All of the algorithms discussed proceed first to a feasible solution and then to better and better feasible solutions, until ultimately one is discovered which is shown to be optimal.

ISSN:0028-1441    

DOI:10.1002/nav.3800180102

出版商:Wiley Subscription Services, Inc., A Wiley Company    

年代:1971

数据来源: WILEY

摘要:

AbstractThis paper analyzes the problem faced by a field commander who, confronted by an enemy onNbattlefields, must determine an interdiction policy for the enemy's logistics system which minimizes the amount of war material flowing through this system per unit time. The resource utilized to achieve this interdiction is subject to constraint. It can be shown that this problem is equivalent to determining the set of arcsZ* to remove subject to constraint from a directed graphGsuch that the resulting maximal flow is minimized. A branch and bound algorithm for the solution to this problem is described, and a numerical example is provided.

ISSN:0028-1441    

DOI:10.1002/nav.3800180103

出版商:Wiley Subscription Services, Inc., A Wiley Company    

年代:1971

数据来源: WILEY

摘要:

AbstractIn the first part of this paper we study the unconstrained {0, 1} hyperbolic programming problem treated in [1]. We describe a new algorithm for this problem which produces an optimal solution by scanning just once the set of fractions to be analysed. This algorithm shows better computing performance than the one described in [1].In the second part we study the {0, 1} hyperbolic programming problem with constraints given by inequalities on nondeereasing pseudo‐boolean functions. We describe a “branch and bound” type algorithm for this pr

ISSN:0028-1441    

DOI:10.1002/nav.3800180104

出版商:Wiley Subscription Services, Inc., A Wiley Company    

年代:1971

数据来源: WILEY

摘要:

AbstractGeneralized Lagrange Multipliers (GLM) are used to develop an algorithm for a type of multiproduct single period production planning problem which involves discontinuities of the fixed charge variety. Several properties of the GLM technique are developed for this class of problems and from these properties an algorithm is obtained. The problem of resolving the gaps which are exposed by the GLM procedure is considered, and an example involving a quadratic cost function is explored in detail.

ISSN:0028-1441    

DOI:10.1002/nav.3800180105

出版商:Wiley Subscription Services, Inc., A Wiley Company    

年代:1971

数据来源: WILEY

摘要:

AbstractSuppose a given set of jobs has to be processed on a multi‐purpose facility which has various settings or states. There is a choice of states in which to process a job and the cost of processing depends on the state. In addition, there is also a sequence‐dependent changeover cost between states. The problem is then to schedule the jobs, and pick an optimum setting for each job, so as to minimize the overall operating costs.A dynamic programming model is developed for obtaining an optimal solution to the problem. The model is then extended using the method of successive approximations with a view to handling large‐dimensioned problems. This extension yields good (but not necessarily optimal) solutions at a significant computational saving over the direct dynamic programming app

ISSN:0028-1441    

DOI:10.1002/nav.3800180106

出版商:Wiley Subscription Services, Inc., A Wiley Company    

年代:1971

数据来源: WILEY

摘要:

AbstractThis article is concerned with the optimal location of any number (n) of facilities in relation to any number (m) of destinations on the Euclidean plane. The criterion to be satisfied is the minimization of total weighted distances where the distances are rectangular. The destinations may be either single points, lines or rectangular areas. A gradient reduction solution procedure is described which has the property that the direction of descent is determined by the geometrical properties of the problem.

ISSN:0028-1441    

DOI:10.1002/nav.3800180107

出版商:Wiley Subscription Services, Inc., A Wiley Company    

年代:1971

数据来源: WILEY

摘要:

AbstractThis paper presents a method of selecting design parameters which optimizes a specific measure (aircraft design example: minimum weight, maximum mission effectiveness) and guarantees designated levels of response in specified areas (such as combal ceiling, acceleration time). The method employs direct search optimization applied to a nonlinear functional constrained by nonlinear surfaces. The composite design technique is combined with regression methods to determine adequate surface representations with a minimum of required data points. A sensitivity analysis is conducted at the optimum set of design parameters to test for uniqueness.

ISSN:0028-1441    

DOI:10.1002/nav.3800180108

出版商:Wiley Subscription Services, Inc., A Wiley Company    

年代:1971

数据来源: WILEY

摘要:

AbstractThe dual linear programs associated with finite statistical games are investigated and their optimal solutions are interpreted. The usual statistical game is generalized to a two‐sided (inference) game and its possible application as a tactical model is discusse

ISSN:0028-1441    

DOI:10.1002/nav.3800180109

出版商:Wiley Subscription Services, Inc., A Wiley Company    

年代:1971

数据来源: WILEY

摘要:

AbstractSome general results are derived for single‐channel queues with Poisson input and state‐dependent Erlang service times in view of the possible use of this model to approximate arbitraryM/G/1‐like state‐dependent queues in a manner similar to that suggested by Rosenshine, and by Kendall, and Kotiah, Thompson, and Waugh for theM/G/1. Numerical procedures are indicated for the evaluation of stationary state probabilities, expected system sizes and waiting times, and parameter est

ISSN:0028-1441    

DOI:10.1002/nav.3800180110

出版商:Wiley Subscription Services, Inc., A Wiley Company    

年代:1971

数据来源: WILEY

摘要:

AbstractFor each n, X1(n),…Xn(n) are independent and identically distributed random variables, with common probability density function\documentclass{article}\pagestyle{empty}\begin{document}$$ f(x) = 0\,{\rm for}\,x < \theta $$\end{document}\documentclass{article}\pagestyle{empty}\begin{document}$$ f\left(x \right) = c\left({x - \theta } \right)^\alpha \left[{1 + r\left({x - \theta } \right)} \right]\,for\,x \ge \theta, $$\end{document}Wherec, θ, α, andr(y) are all unknown. It is shown that we can make asymptotic inferences aboutc, θ, and α, whenr(y) satisfies mild condi

ISSN:0028-1441    

DOI:10.1002/nav.3800180111

出版商:Wiley Subscription Services, Inc., A Wiley Company    

年代:1971

数据来源: WILEY