bluuebunny/crossref_metadata_2025_split huggingface dataset:
Optimality conditions for the bilevel programming problem
Authors: Bard Jonathan F. 
Published: May 2007

AbstractThe bilevel programming problem (BLPP) is a sequence of two optimization problems where the constraint region of the first is determined implicitly by the solution to the second. In this article it is first shown that the linear BLPP is equivalent to maximizing a linear function over a feasible region comprised of connected faces and edges of the original polyhedral constraint set. The solution is shown to occur at a vertex of that set. Next, under assumptions of differentiability, first‐order necessary optimality conditions are developed for the more general BLPP, and a potentially equivalent mathematical program is formulated. Finally, the relationship between the solution to this problem and Pareto optimality is discussed and a number of examples given.
Periodic inspection policy with preventive maintenance
Authors: Nakagawa Toshio 
Published: May 2007

AbstractThis article considers a modified inspection policy with periodic check intervals, where the unit after check has the same age as before with probability p and is as good as new with probability q. The mean time to failure and the expected number of checks before failure are derived, forming renewal‐type equations. The total expected cost and the expected cost per unit of time until detection of failure are obtained. Optimum inspection policies which minimize the expected costs are given as a numerical example.
Learning and costs in airframe production: A multiple‐output production function approach
Authors: Gulledge Thomas R. , Worner Norman K. , Dorroh James R. 
Published: May 2007

AbstractThis article examines the influence of both production rate and learning on airframe program costs. A dynamic multiple‐output production model is developed and is used to observe the cost impact of changes in production rate and learning. Several simulations are performed to demonstrate the sensitivity of the optimal time path of cost to changes in the model parameters. The model is applied by estimating parameters from the F102 airframe program.
A model in which component failure rates depend on the working set
Authors: Ross Sheldon M. 
Published: May 2007

AbstractWe consider a multicomponent system in which the failure rate of a given component at any time depends on the set of working components at that time. Sufficient conditions are presented under which such a system has a life distribution of specified type. The Laplace transform of the time until all components are down is derived. When repair is allowed, conditions under which the resulting process is time reversible are presented.
Distribution of number of point targets killed and higher moments of coverage of area targets
Authors: Schroeter Gerhard 
Published: May 2007

AbstractThe coverage C of area targets by salvos of weapons generally varies randomly, because of random target location and weapon impact point fluctuations. A third source of variation appears when, instead of an area target, a multiple‐element target is considered, consisting of m point targets distributed randomly and independently of one another around the target center. A multiple‐integral expression is derived for the probability pk of killing exactly k target elements. It is shown that pk is a linear function of the higher moments, of the order k to m, of the area coverage C. More explicit expressions are derived for the case of two weapons and for circular‐symmetric functions. Similar to well‐known results for the expectation and variance of coverage of area targets, these expressions can be evaluated by numerical quadrature. Furthermore, the coverage problem in which all underlying functions are Gaussian can be completely solved in closed form. For such a problem, with two weapons, numerical results are presented. They show that the distribution of k can be approximated by a binomial distribution only if the target center and weapon impact point fluctuations are small.
Evaluation of costs of ordering policies in large machine repair problems
Authors: Albright S. Christian , Soni A. 
Published: May 2007

AbstractThis article examines a version of the machine repair problem where failures may be irreparable. Since the number of machines in the system keeps decreasing, we impose a fixed state‐dependent ordering policy of the type often encountered in inventory models. Although the system is Markovian, the number of states becomes very large. The emphasis of the article, therefore, is on deriving computationally tractable formulas for the steady‐state probabilities, the long‐run average cost per unit time, and the vector of expected discounted costs. When the state space is so large that exact computations may be infeasible, we propose approximations which are relatively quick and simple to compute and which yield very accurate results for the test problems examined.
An inventory model with finite‐range stochastic lead times
Authors: Sphicas Georghios P. , Nasri Farrokh 
Published: May 2007

AbstractThis article considers an inventory model with constant demand and stochastic lead times distributed over a finite range. A generalization of the EOQ formula with backorders is derived and ranges for the decision variables are obtained. The results are illustrated with the case of uniformly distributed lead time.
Testing goodness of fit to the increasing failure rate family
Authors: Tenga Robert , Santner Thomas J. 
Published: May 2007

AbstractOne branch of the reliability literature is concerned with devising statistical procedures with various nonparametric “restricted family” model assumptions because of the potential improved operating characteristics of such procedures over totally nonparametric ones. In the single‐sample problem with unknown increasing failure rate (IFR) distribution F, (1) maximum‐likelihood estimators of F have been calculated, (2) upper or lower tolerance limits for F have been determined, and (3) tests of the null hypothesis that F is exponential have been constructed. Barlow and Campo proposed graphical methods for assessing goodness of fit to the IFR model when the validity of this assumption is unknown. This article proposes several analytic tests of the IFR null hypothesis based on the maximum distance and area between the cumulative hazard function and its greatest convex minorant (GCM), and the maximum distance and area between the total time on test statistic and its GCM. A table of critical points is provided to implement a specific test having good overall power properties.
Inequalities involving the lifetime of series and parallel systems
Authors: Stein William E. , Dattero Ronald , Pfaffenberger Roger C. 
Published: May 2007

AbstractLet {Xi} be independent HNBUE (Harmonic New Better Than Used in Expectation) random variables and let {Yi} be independent exponential random variables such that E{Xi}=E{Yi} It is shown that \documentclass{article}\pagestyle{empty}\begin{document}$ E\left[{u\left({\mathop {\min \,X_i}\limits_{l \le i \le n}} \right)} \right] \ge E\left[{u\left({\mathop {\min \,Y_i}\limits_{l \le i \le n}} \right)} \right] $\end{document} for all increasing and concave u. This generalizes a result of Kubat. When comparing two series systems with components of equal cost, one with lifetimes {Xi} and the other with lifetimes {Yi}, it is shown that a risk‐averse decision‐maker will prefer the HNBUE system. Similar results are obtained for parallel systems.
Present practices and future plans for MIL‐STD‐781
Authors: Wallace W. E. 
Published: May 2007

AbstractMIL‐STD‐781 specifies reliability acceptance test procedures based on both fixed‐length tests and probability ratio sequential tests. The assumption underlying MIL‐STD‐781 is a constant mean time between failures (MTBF) and typical practice applies MIL‐STD‐781 to electrical, electronic, and mechanical equipment. This article discusses some of the difficulties that have prompted the C and D revisions of MIL‐STD‐781. In addition, it discusses the relationship of MIL‐STD‐781 with MIL‐STD‐1635(EC) which deals with reliability growth testing. The article concludes with a discussion of needed research in reliability growth testing, in support of MIL‐STD‐781, and in the area of stress and its impact of MTBF.
Application of renewal theory to continuous sampling plans
Authors: Yang Grace L. 
Published: May 2007

AbstractRenewal theory is used to study the effectiveness of a class of continuous sampling plans first introduced by Dodge. This approach provides a simple way of viewing and computing the long‐run Average Outgoing Quality (AOQ) and its maximum AOQL. More importantly, it is used to study the average outgoing quality in a short production run through an approximation formula AOQ*(t). Formulas for AOQ and AOQ*(t) are provided. By simulation, it is found that AOQ*(t) is sufficiently accurate in situations corresponding to actual practice.
Toward a determination of optimal multilevel sampling plans
Authors: Sackrowitz Harold 
Published: May 2007

AbstractTraditionally continuous sampling plans have been evaluated according to relatively few criteria. These typically include the OC curve (on which AQL systems are based), the ASN, and the AOQ curve. These characteristics are all calculated under the assumption that the process is “in control” so that mathematically they are derived as long‐term averages. Thus, any two plans which (long term) spend the same proportion of time on each type of sampling inspection will be identical relative to these criteria. This is true whether sampling from lots or doing unit‐by‐unit inspection. The goal is to first establish desirable additional criteria and then to develop methods to determine which procedure (of those which satisfy the standard criteria) is optimal relative to the new criteria. To be considered will be measures of a plan's ability to detect a sudden drop in quality (such as ARL).
Qmp/USP: A modern alternative to MIL‐STD‐105D
Authors: Buswell George , Hoadley Bruce 
Published: May 2007

AbstractThe Quality Measurement Plan (QMP) and the Universal Sampling Plan (USP) are the data analysis and sampling plans for the AT&T Technologies quality audit. This article describes QMP/USP, an acceptance sampling plan based on QMP and USP principles. QMPIUSP is a complete acceptance sampling system. It combines the elements of classical rectification inspection plans with those of MIL‐STD‐IOSD. There is no switching between plans, no tables of numbers to look through, and no discontinue state. QMP/USP is a computerized, self‐contained system that features:

Acceptance decisions based on the QMP Bayes empirical Bayes analysis of current and past sampling result
Sample size selection based on USP, i.e., lot size, AQL, a cost ratio, the QMP analysis, and a budget constraint
Guaranteed AOQ
A complete statistical analysis of the quality process.
In this article, we describe the operation of QMP/USP and compare its performance with that of MIL‐STD‐IOSD. The comparison is made under many different quality environments with many metrics. Our results show that QMP/USP and MIL/STD/IOSD perform similarly for the environments where quality could be described as “in control”; and that QMPlUSP is superior in the environments where quality is “out of control”.
Heuristic modeling of supply availabilities in large networks
Authors: Patterson W. M. , Olson A. E. , Mitchell C. R. 
Published: May 2007

AbstractThe objective of this article is to describe heuristic solutions to the problem of modeling inventories at each node of a large network in the context of a computer simulation model of that network. The heuristic solutions are compared with the mathematical solution which is too unwieldy for use in a simulation model. The Weibull cumulative distribution is used as an approximation for the heuristic models. We question whether the good performance of the Weibull is coincidence or perhaps mathematically justifiable.
Attack and defense of ICBMs deceptively based in a number of identical areas
Authors: Bracken Jerome , Brooks Peter S. 
Published: May 2007

AbstractOn‐site verification of ICBMs in the context of an arms control agreement might involve a situation where an inspector would choose one or more of a number of identical areas to inspect and would have confidence that the other areas had the same characteristics. This article considers optimal attack and defense of missiles deceptively based in a number of identical areas. The attacker may allocate warheads across areas as he desires and uniformly within areas. The defender may allocate interceptors across areas as he desires and either uniformly or preferentially within areas. The effect of restricting the defender to uniform allocation across areas is explored for various assumptions. Robustness of surviving missiles with respect to the number of attacking warheads is studied. Results are presented for a wide range of cases.
The theory of combined‐arms lanchester‐type models of warfare
Authors: Maybee John S. 
Published: May 2007

AbstractThe mathematical theory necessary to solve combined arms models of military combat is presented here. We show how to apply the theory of positive operators to such models. Most of the results are purely qualitative in character showing that many properties of such systems are independent of the actual numerical values of the coefficients. Finally, we discuss in some detail an example of such a system.
Optimizing search with positive information feedback
Authors: Stewart Theodor J. 
Published: May 2007

AbstractA search model is formulated in which positive information may be obtained, through the detection of trails, as to the target's earlier whereabouts. The corresponding Bayesian update formulas for target location probabilities are derived. The model does not appear to be amenable to rigorous optimization. A moving‐horizon rule, and a heuristic simplification thereof, are, however, derived. In two numerical examples it is demonstrated that actively designing for detecting trail information, through use of these moving‐horizon rules, has substantial potential advantage over using, for example, myopic rules even if the positive information is adaptively incorporated into location probabilities before applying the latter rules in each time period.
Control of entry to a nonstationary queuing system
Authors: Nozari Ardavan 
Published: May 2007

AbstractIn this article the control of entry of customers to a queuing system with s servers is considered. It is assumed that the arrivals form a nonstationary Poisson process with a periodic rate. The service times are assumed to be exponentially distributed with a parameter independent of time. The cost structure considered is the same as that of Naor. It is demonstrated numerically that, like the stationary cases, the average expected benefit of customers per unit of time is a unimodal function of the critical point. And, also, the social critical point is smaller than the individual critical point. These suggest the use of a search technique for finding the social critical point. The results show successful application of the discrete version of the Fibonacci search.
Acceleration of the HAP approach for the multifacility location problem
Authors: Charalambous Christakis 
Published: May 2007

AbstractThis article considers the problem of locating multiple new facilities to minimize the cost function consisting of the sum of weighted distances among new facilities and between new and existing facilities. The hyperboloid approximate procedure (HAP) is probably the most widely used approach for solving this problem. In this article, an optimality condition for this problem is derived and a method to accelerate the convergence rate of the HAP for the case of Euclidean distances is presented. From the numerical results presented in this article, it can be concluded that the performance of the new algorithm is superior to the performance of the original HAP.
One‐facility location with rectilinear tour distances
Authors: Drezner Z. , Steiner G. , Wesolowsky G. O. 
Published: May 2007

AbstractThis article concerns the location of a facility among n points where the points are serviced by “tours” taken from the facility. Tours include m points at a time and each group of m points may become active (may need a tour) with some known probability. Distances are assumed to be rectilinear. For m ≤ 3, it is proved that the objective function is separable in each dimension and an exact solution method is given that involves finding the median of numbers appropriately generated from the problem data. It is shown that the objective function becomes multimodal when some tours pass through four or more points. A bounded heuristic procedure is suggested for this latter case. This heuristic involves solving an auxiliary three‐point tour location problem.
A finite descent theory for linear programming, piecewise linear convex minimization, and the linear complementarity problem
Authors: Solow Daniel , Sengupta Partha 
Published: May 2007

AbstractA descent algorithm simultaneously capable of solving linear programming, piecewise linear convex minimization, and the linear complementarity problem is developed. Conditions are given under which a solution can be found in a finite number of iterations using the geometry of the problem. A computer algorithm is developed and test problems are solved by both this method and Lemke's algorithm. Current results indicate a decrease in the number of cells visited but an increase in the total number of pivots needed to solve the problem.
State information lag markov decision process with control limit rule
Authors: Kim Soung H. 
Published: May 2007

AbstractIn the framework of a discrete Markov decision process with state information lag, this article suggests a way for selecting an optimal policy using the control limit rule. The properties sufficient for an optimal decision rule to be contained in the class of control limit rules are also studied. The degradation in expected reward from that of the perfect information process provides a measure of the potential value of improving the information system.
Single‐period inventory models with demand uncertainty and quantity discounts: Behavioral implications and a new solution procedure
Authors: Jucker James V. , Rosenblatt Meir J. 
Published: May 2007

AbstractQuantity discounts are considered in the context of the single‐period inventory model known as “the newsboy problem.” It is argued that the behavioral implications of the all‐units discount schedule are more complex and interesting than the literature has suggested. Consideration of this behavior and the use of marginal analysis lead to a new method for solving this problem that is both conceptually simpler and more efficient than the traditional approach. This marginal‐cost solution procedure is described graphically, an algorithm is presented, and an example is used to demonstrate that this solution procedure can be extended easily to handle complex discount schedules, such as some combined (simultaneously applied) purchasing and transportation cost discount schedules.
An optimum multiechelon repair policy and stockage model
Authors: Kaplan A. , Orr D. 
Published: May 2007

AbstractCurrently, sophisticated multiechelon models compute stockage quantities for spares and repair parts that will minimize total inventory investment while achieving a target level of weapon system operational availability. The maintenance policies to be followed are input to the stockage models. The Optimum Allocation of Test Equipment/Manpower Evaluated Against Logistics (OATMEAL) model will determine optimum maintenance as well as stockage policies for a weapon system. Specifically, it will determine at which echelon each maintenance function should be performed, including an option for component or module throwaway. Test equipment requirements to handle work load at each echelon are simultaneously optimized. Mixed‐integer programming (MIP) combined with a Lagrangian approach are used to do the constrained cost minimization, that is, to minimize all costs dependent on maintenance and stockage policies while achieving a target weapons system operational availability. Real‐life test cases are included.
A heuristic with tie breaking for certain 0–1 integer programming models
Authors: Fox G. Edward , Scudder Gary D. 
Published: May 2007

AbstractA heuristic for 0–1 integer programming is proposed that features a specific rule for breaking ties that occur when attempting to determine a variable to set to 1 during a given iteration. It is tested on a large number of small‐ to moderate‐sized randomly generated generalized set‐packing models. Solutions are compared to those obtained using an existing well‐regarded heuristic and to solutions to the linear programming relaxations. Results indicate that the proposed heuristic outperforms the existing heuristic except for models in which the number of constraints is large relative to the number of variables. In this case, it performs on par with the existing heuristic. Results also indicate that use of a specific rule for tie breaking can be very effective, especially for low‐density models in which the number of variables is large relative to the number of constraints.
Production‐location problems with demand considerations
Authors: Venta Enrique R. , Hurter Arthur P. 
Published: May 2007

AbstractThe production‐location problem of a profit maximizing firm is considered. A model is developed for a single firm, facing the joint problems of determining the optimal plant location, the optimal input mix, and the optimal plant size. A homothetic production function is used as the model of the production technologies, and the existence of a sequential “separability” between the production, or input mix, problem and the location problem is demonstrated.
Causative matrix technique for deriving interim period transition probabilities in nonstationary markov process
Authors: Kim Soung H. 
Published: May 2007

AbstractThe Markov assumption that transition probabilities are assumed to be constant over entire periods has been applied in economic and social structures, for example, in the analysis of income and wage distributions. In many cases, however, nonstationary transition probabilities exist over different periods. Based on causative matrix technique, this study shows a binomial approximation for obtaining nonstationary interim transition probabilities under undisturbance when the first and the last transition matrices are known.
Aggregating assignment constraints
Authors: Fishburn Peter C. , Kochenberger Gary A. 
Published: May 2007

AbstractThis article shows how simple systems of linear equations with {0,1} variables can be aggregated into a single linear equation whose {0,1} solutions are identical to the solutions of the original system. Structures of the original systems are exploited to keep the aggregator's integer coefficients from becoming unnecessarily large. The results have potential application in integer programming and information theory, especially for problems that contain assignment‐type constraints along with other constraints. Several unresolved questions of a number‐theoretic nature are mentioned at the conclusion of the article.
On the use of a structural equation for determining inventory order quantities
Authors: Das Chandrasekhar 
Published: May 2007

AbstractThis article considers a structural equation useful for characterizing the order quantity of several inventory models. A correct interpretation of this equation is provided and it is stressed that the equation should be used in conjunction with another equation for the reorder point. Failure to do so may give rise to improper interpretations and invalid conclusions. A specific case like this is cited for the sake of illustration.