bluuebunny/crossref_metadata_2025_split huggingface dataset:
The value statement
Authors: Nightengale M. E. 
Published: May 2007

AbstractFrequently there exists an insufficient amount of actual data upon which to base a decision. In this paper a method is presented whereby the subjective opinions of a group of qualified persons are utilized to quantify the relative importance of a finite number of parameters or objectives. A means of testing the consistency among the judges is given which allows the decision maker to determine the validity of the opinions gathered.The application presented here is in the area of Multiple Incentive Contracting. Namely, a method is proposed to facilitate the answering of the question, “What is the value to the purchaser of an incremental change in the performance of a system?” Such a vehicle is not essential to the methodology proposed.
A stochastic constrained optimal replacement model
Authors: Kalman Peter J. 
Published: May 2007

AbstractIn this paper a stochastically constrained replacement model is formulated. This model determines a sequence of replacement dates such that the total “current account” cost of all future costs and capital expenditures over an infinite time horizon for the n initial incumbent machines is minimized subject to the constraints that an expected number of machines are in a chosen utility class at any point in time. We then indicate one possible solution method for the model.
A backward recursive technique for optimal sequential sampling plans
Authors: Wortham A. W. , Wilson E. B. 
Published: May 2007

AbstractThis paper presents a procedure akin to dynamic programming for designing optimal acceptance sampling plans for item‐by‐item inspection. Using a Bayesian procedure, a prior distribution is specified, and a suitable cost model is employed depicting the cost of sampling, accepting or rejecting the lot. An algorithm is supplied which is digital computer oriented.
Determining the most vital link in a flow network
Authors: Lubore S. H. , Ratliff H. D. , Sicilia G. T. 
Published: May 2007

AbstractThe most vital link in a single commodity flow network is that are whose removal results in the greatest reduction in the value of the maximal flow in the network between a source node and a sink node. This paper develops an iterative labeling algorithm to determine the most vital link in the network. A necessary condition for an are to be the most vital link is established and is employed to decrease the number of ares which must be considered.
Bayes adaptive control of two‐echelon inventory systems i: development for a special case of one‐station lower echelon and monte carlo evaluation
Authors: Zacks S. , Fennell J. 
Published: May 2007

AbstractBayes adaptive control policies are developed in the present paper for the special case of a one‐station lower echelon: a Poisson distribution of demand, whose mean is assumed to have a prior gamma distribution. The cost structure is of a common type. The ordering policy for the upper echelon, which minimizes expected cost, is replaced by a new type of policy, called Bayes prediction policy. This policy does not require tedious computations, of the sort required by dynamic programming solutions. The characteristics of the policies are studied by Monte Carlo simulation, and supplemented by further theoretical development.
A unified model for demand prediction in the context of provisining and replenishment
Authors: Haber Sheldon E. , Sitgreaves Rosedith 
Published: May 2007

AbstractAn improved demand prediction model is presented which incorporates features of two earlier models. The unified model pools usage data classified by repair part class and by component class. The performance of the model is evaluated in a provisioning and replenishment context and compared with that for the current procedure which employs technicians' usage estimates.
Optimal inventory policies in contagious demand models
Authors: Ravindran Arunachalam 
Published: May 2007

AbstractIn the past, contagious distributions have been successfully applied in bacteriology, entomology, and accident statistics. This paper applies the notion of contagious distributions in the inventory control of new products and seasonal or style goods, which have an lying “true contagion” for their demands, namely, the influence of past demands on occurrence of demands. A contagious distribution is derived by assuming a nonstationary Poisson process where the demand rate at any instant depends on the past demands to that instant. Using this contagious distribution, an inventory model is developed seasonal goods and new product lines. Optimal order policies as a function of the initial level and the review period are derived.
Termination policies for a two‐state stochastic process
Authors: Handler Gary 
Published: May 2007

AbstractThe purpose of this paper is to investigate and optimize policies which can be used to terminate a two‐state stochastic process with a random lifetime. Such a policy consists of a schedule of times at which termination attempts should be made. Conditions are given which reduce the difficulty of finding the optimal policy by eliminating constraints and some boundary points from consideration. Finally, a bound for the optimal policy is derived for a case where some restrictions are imposed on the model.
Computational techniques for optimizing systems with standby redundancy
Authors: Henin Claude 
Published: May 2007

AbstractThree methods are used to solve the following problem: For P, a positive constant, maximize (P. Reliability‐cost) of a system with standby redundancy. The results show that a method which rounds a noninteger solution to the nearest integer solution can lead to tremendous mistakes. However, neither a well known dynamic programming algorithm nor a previously developed branch and bound technique are able to solve large size problems. The solution of problems of large dimension thus requires the use of the noninteger solution of the first method to limit the number of possible solutions when using either the dynamic programming algorithm or a modified branch and bound technique. With this assistance, the branch and bound technique is able to solve large problems in a short amount of computational time.
Postoptimality analysis in zero‐one programming by implicit enumeration
Authors: Roodman Gary M. 
Published: May 2007

AbstractThe procedures for postoptimality analysis that are so much a part of linear programming studies have no simple counterparts in an integer programming context. In the case of Balas' Additive Algorithm, however, it would appear that the capacity of the technique to facilitate certain types of postoptimality analysis has not been fully exploited. This paper proposes an extension of the additive algorithm that utilizes insights generated while solving the original problem to do subsequent analysis upon it. In particular, procedures are developed for doing limited parameter ranging and for seeking new optima in light of parameter changes.
Determining optimal growth paths in logistics operations
Authors: Srinivasan V. , Thompson G. L. 
Published: May 2007

AbstractThis paper considers a logistics system modelled as a transportation problem with a linear cost structure and lower bounds on supply from each origin and to each destination. We provide an algorithm for obtaining the growth path of such a system, i. e., determining the optimum shipment patterns and supply levels from origins and to destinations, when the total volume handled in the system is increased. Extensions of the procedure for the case when the costs of supplying are convex and piecewise linear and for solving transportation problems that are not in “standard form” are discussed. A procedure is provided for determining optimal plant capacities when the market requirements have prespecified growth rates. A goal programming growth model where the minimum requirements are treated as goals rather than as absolute requirements is also formulated.
A mathematical programming approach to identification and optimization of a class of unknown systems
Authors: Holloway Charles A. 
Published: May 2007

AbstractThere exists a class of decision problems for which: (1) models of input‐output response functions are not available in a closed‐form, functional representation; (2) informational costs associated with learning about the response function are significant. For these problems, combining identification with optimization using mathematical programming is potentially attractive. Three approaches to the identification‐optimization problem are proposed: an outer‐linearized approximation using relaxation (OLR); an inner‐linearized approximation using restriction (ILR); and a sequential combination of inner‐ and outer‐linearized subproblems (SIO). Algorithms based on each approach are developed and computational experience reported.
A comparison of the primal‐simplex and complementary pivot methods for linear programming
Authors: Ravindran Arunachalam 
Published: May 2007

AbstractA comparison of the complementary pivot method of Lemke‐Howson and the more commonly used primal‐simplex method for solving linear programming problems in symmetric dual form has been made. In our tests the complementary pivot method shows a definite superiority over the simplex method both with regard to the number of iterations and computation time.
An efficient heuristic procedure for the uncapacitated warehouse location problem
Authors: Khumawala Basheer M. 
Published: May 2007

AbstractThis paper introduces an efficient heuristic procedure for a special class of mixed integer programming problems called the uncapacitated warehouse (plant) location problem. This procedure is derived from the branching decision rules proposed for the branch and bound algorithm by the author in an earlier paper. It can be viewed as tracing a single path of the branch and bound tree (from the initial node to the terminal node), the path being determined by the particular branching decision rule used. Unlike branch and bound the computational efficiency of this procedure is substantially less than linearly related to the number of potential warehouse locations (integer variables) in the problem. Its computational efficiency is tested on problems found in the literature.
Peak rate of occurrence of a poisson process
Authors: Alam Khursheed 
Published: May 2007

AbstractSuppose that a nonhomogeneous Poisson process is observed for a length of time T, say Let λ (t) denote the mean value function of the process. It is assumed that λ (t) is first increasing then decreasing inside the interval (0, T) with peak at t = t0, say. Three methods are given for estimating to. One of these methods is nonparametric, and the other two methods are based on the standard regression technique and the maximum likelihood principleThe given resull has application in a problem of determining the azimuth of a target from the radar‐impulse data. The time series of incoming signals may be approximated by the occurrence of a nonhomogeneous Poisson process with mean value function λ (t). The azimuth of the target is reasonably determined from the direction of the axis of the radar beam at the instant to, corresponding to the peak value of λ (t).
Optimal search using two nonconcurrent sensors
Authors: Persinger Carl A. 
Published: May 2007

AbstractSearch for a stationary target is considered for a situation in which two sensors are available, but cannot be used simultaneously. The cost (in time) of switching from one sensor to the other is ignored, and each sensor is assumed to have perfect discrimination. For a specified class of searches an optimal allocation of search effort is obtained. In the case of a circular normal prior target location distribution, an example is presented in which one sensor is assumed to have a fixed sweep width and the other a stochastic sweep width. An optimal plan is found for this example. This plan produces an allocation of search effort which is expended in a disk by one sensor and in a bounding annulus by the other.
The single server queue in discrete time‐numerical analysis I
Authors: Neuts Marcel F. 
Published: May 2007

AbstractThis is the first of a sequence of papers dealing with the computational aspects of the transient behavior of queues in discrete timeIt is shown that for a substantial class of queues of practical interest, a wealth of numerical information may be obtained by relatively unsophisticated methodsThis approach should prove useful in the analysis of unstable queues which operate over a limited time interval, but is by no means limited to such queuesMathematically the service unit is modeled in terms of a multivariate Markov chain, whose particular structure is used in iterative computation. Many important queue features may then be derived from the n‐step transition probabilities of this chain.
Hyperbolic integer programming
Authors: Grunspan M. , Thomas M. E. 
Published: May 2007

AbstractThe hyperbolic integer program is treated as a special case of a hyperbolic program with a finite number of feasible points. The continuous hyperbolic program also belongs to this class since its solution can be obtained by considering only the extreme points of the feasible set. A general algorithm for solving the hyperbolic integer program which reduces to solving a sequence of linear integer problems is proposed. When the integer restriction is removed, this algorithm is similar to the Isbell‐Marlow procedure. The geometrical aspects of the hyperbolic problem are also discussed and several cutting plane algorithms are given.
Convergence of the bounded fixed charge programming problem
Authors: Tiplitz Charles I. 
Published: May 2007

AbstractCalculating the solution for a mixed integer linear programming problem has been problematic for any sizable dimension because of the time required. Accordingly, an improved method for the fixed charge problem is presented here. The method is a modification of a bounding technique first suggested by Balinski, and it exploits fully the ratio of costio‐use, first described by Cooper and Drebes. It exploits those local properties which have global application so that enumeration is confined to those relatively few combinations which cannot be evaluated otherwise.
An empirical bayes estimator for the scale parameter of the two‐parameter weibull distribution
Authors: Bennett G. Kemble , Martz H. F. 
Published: May 2007

AbstractAn empirical Bayes estimator is given for the scale parameter in the two‐parameter Weibull distribution. The scale parameter is assumed to vary randomly throughout a sequence of experiments according to a common, but unknown, prior distribution. The shape parameter is assumed to be known, however, it may be different in each experiment. The estimator is obtained by means of a continuous approximation to the unknown prior density function. Results from Monte Carlo simulation are reported which show that the estimator has smaller mean‐squared errors than the usual maximum‐likelihood estimator.
Optimal allocation of unreliable components for maximizing expected profit over time
Authors: Henin Claude G. 
Published: May 2007

AbstractIn the present paper, we solve the following problem: Determine the optimum redundancy level to maximize the expected profit of a system bringing constant returns over a time period T; i. e., maximize the expression \documentclass{article}\pagestyle{empty}\begin{document}$ P\int_0^T {Rdt - C} $\end{document}, where P is the return of the system per unit of time, R the reliability of this system, C its cost, and T the period for which the system is supposed to workWe present theoretical results so as to permit the application of a branch and bound algorithm to solve the problem. We also define the notion of consistency, thereby determining the distinction of two cases and the simplification of the algorithm for one of them.
Using decomposition in integer programming
Authors: Schrage Linus 
Published: May 2007

AbstractWhen implicit enumeration algorithms are used for solving integer programs, a form of primal decomposition can be used to reduce the number of solutions which must be implicitly examined. If the problem has the proper structure, then under the proper decomposition a different enumeration tree can be defined for which the number of solutions which must be implicitly examined increases with a power of the number of variables rather then exponentially. The proper structure for this kind of decomposition is that the southwest and northeast corners of the constraint matrix be zero or equivalently that the matrix be decomposable except for linking columns. Many real traveling salesmen, plant location, production scheduling, and covering problems have this structure.
Optimal design of a multi‐item, multi‐location, multi‐repair type repair and supply system
Authors: Porteus Evan L. , Lansdowne Zachary F. 
Published: May 2007

AbstractThe design of a system with many locations, each with many items which may fail while in use, is considered. When items fail, they require repair; the particular type of repair being governed by a probability distribution. As repairs may be lengthy, spares are kept on hand to replace failed items. System ineffectiveness is measured by expected weighted shortages over all items and locations, in steady state. This can be reduced by either having more spares or shorter expected repair times. Design consists of a provisioning of the number of spares for each item, by location; and specifying the expected repair times for each type of repair, by item and location. The optimal design minimizes expected shortages within a budget constraint, which covers both (i) procurement of spares and (ii) procurement of equipment and manning levels for the repair facilities. All costs are assumed to be separable so that a Lagrangian approach is fruitful, yielding an implementable algorithm with outputs useful for sensitivity analysis. A numerical example is presented.
Finding equivalent transportation formulations for constrained transportation problems
Authors: Glover F. , Klingman Darwin , Ross G. Terry 
Published: May 2007

AbstractThis paper describes a procedure for determining if constrained transportation problems (i.e., transportation problems with additional linear constraints) can be transformed into equivalent pure transportation problems by a linear transformation involving the node constraints and the extra constraints. Our results extend procedures for problems in which the extra constraints consist of bounding certain partial sums of variables.
Computerized scheduling of seagoing tankers
Authors: McKay M. D. , Hartley H. O. 
Published: May 2007

AbstractComputerized Scheduling of Seagoing Tankers The tanker scheduling problem considered in this paper is that of the Defense Fuel Supply Center (DFSC) and the Military Sealift Command (MSC) in the worldwide distribution of bulk petroleum products. Routes and cargoes which meet delivery schedule dates for a multiplicity of product requirements at minimum cost are to be determined for a fleet of tankers. A general mathematical programming model is presented, and then a mixed integer model is developed which attempts to reflect the true scheduling task of DFSC and MSC as closely as possible. The problem is kept to within a workable size by the systematic construction of a set of tanker routes which does not contain many possible routes that can be judged unacceptable from practical considerations alone.
Structural models of award fee contracts
Authors: Marshall Clifford W. 
Published: May 2007

AbstractThis paper describes the construction of a mathematical model structure in a particular area of management. In addition it is intended as an illustration of how appropriate levels of mathematics can be utilized in management research when original formulations lack sufficient precision for conducting quantitative analyses. The specific area studied deals with the formulation and analysis of contract types. In particular the award fee type contract is treated. At present mathematical structure models for other contract types have received considerable attention, but award fee types have not been structured in mathematical terms. The paper provides a discussion of model formulation for award fee contracts, develops a detailed example of such a structure, and illustrates that model by numerical examples indicating the application of such models to the formulation and analysis of award fee contracts.
Managerial inventory formulations with stockout objectives and fiscal constraints
Authors: Schroeder Roger C. 
Published: May 2007

AbstractMost inventory formulations seek to minimize the sum of ordering costs, holding costs, and stockout costs: however, management often directs inventory policy by specifying a maximum investment level and/or a purchasing budget constraint. Within these limitations, they expect lower level managers to optimize some level of customer satisfaction, such as minimum stockouts or minimum shortages. The author has developed several cases of these “managerial” inventory formulations and has presented some computational results.
Simultaneous equation production functions (cobb‐douglas type) for decisions pertaining to sea‐based tactical air resources
Authors: Lewis Chantee 
Published: May 2007

AbstractThis paper proposes the use of a set of simultaneous, modified Cobb‐Douglas production functions to determine the “best” mix of aircraft inputs (men, spare parts, support equipment, etc.) to achieve certain levels of output. The simultaneous equations are “solved” by the use of proxy values in an iterative search process. Tests of this production function model indicate that real world data fits quite well (R2 ranges from 0.884 to 0.951) and the residuals do not appear to have any significant bias.The aircraft production functions for several types of aircraft (F‐4, A‐7, A‐6, A‐4) have been maximized for a fixed budget and specific constraints. A potential increase in output of up to 10 percent appears possible. In general the marginal value of spare parts surpasses the other inputs.
A two product dynamic economic lot size production model with either‐or production constraints
Authors: Crabill Thomas B. , Jaquette David L. 
Published: May 2007

AbstractThis paper considers the production of two products with known demands over a finite set of periods. The production and inventory carrying costs for each product are assumed to be concave. We seek the minimum cost production schedule meeting all demands, without backlogging, assuming that at most one of the two products can be produced in any period. The optimization problem is first stated as a nonlinear programming problem, which allows the proof of a result permitting the search for the optimal policy to be restricted to those which produce a product only when its inventory level is zero. A dynamic programming formulation is given and the model is then formulated as a shortest route problem in a specially constructed network.
Efficient computational devices for the capacitated transportation problem
Authors: Langley Robert W. , Kennington Jeff , Shetty C. M. 
Published: May 2007

AbstractThis paper presents the details for applying and specializing the work of Ellis Johnson [10] and [11] to develop a primal code for the well‐known capacitated transportation problem. The code was developed directly from the work of Johnson, but is similar to codes developed by Glover, Karney, Klingman, and Napier [6] and Srinivasan and Thompson [14]. The emphasis in the presentation is the use of the graphical representation of the basis to carry out the revised simplex operations. This is a means of exploiting the special structure and sparseness of the constraint matrix to minimize computational effort and storage requirements. We also present the results of solving several large problems with the code developed.