{"title":"A finite descent theory for linear programming, piecewise linear convex minimization, and the linear complementarity problem","authors":"Daniel Solow, P. Sengupta","doi":"10.1002/NAV.3800320306","DOIUrl":"https://doi.org/10.1002/NAV.3800320306","url":null,"abstract":"A 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.","PeriodicalId":431817,"journal":{"name":"Naval Research Logistics Quarterly","volume":"1152 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1985-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126238736","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"A reliability model with states of partial operation","authors":"A. Bendell, S. Humble","doi":"10.1002/NAV.3800320313","DOIUrl":"https://doi.org/10.1002/NAV.3800320313","url":null,"abstract":"This article generalizes the classical dichotomic reliability model to include states of partial operation. The generalized model can be considered as a special case of a general jump process. Both continuous and discrete state spaces are included. The relationship to cumulative damage shock models is discussed. Properties of the model are investigated and these are illustrated via examples. The equivalence of three forms of component independence is proved, but this equivalence does not generalize to the property of zero covariance. Alternative forms of series and parallel connections and the effect of component replacement are discussed.","PeriodicalId":431817,"journal":{"name":"Naval Research Logistics Quarterly","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1985-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134048707","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Statistical analysis of very high‐dimensional data sets of hierarchically structured binary variables with missing data: An application to marine corps readiness evaluations","authors":"S. Zacks, W. Marlow, S. Brier","doi":"10.1002/NAV.3800320310","DOIUrl":"https://doi.org/10.1002/NAV.3800320310","url":null,"abstract":"Abstract : The present analysis deals with very high-dimensional data sets, each one containing close to nine hundred binary variables. Each data set corresponds to an evaluation of one complex system. These data sets are characterized by large portions of missing data where, moreover, the unobserved variables are not the same in different evaluations. Thus, the problems which confront the statistical analysis are those of multivariate binary data analysis, where the number of variables is much larger than the sample size and in which missing data varies with the sample elements. The variables, however, are hierarchically structured and the problem of clustering variables to groups does not exist in the present study. In order to motivate the statistical problem under consideration, the Marine Corps Combat Readiness Evaluation System (MCCRES) is described for infantry battalions and then used for exposition. The present paper provides a statistical model for data from MCCRES and develops estimation and prediction procedures which utilize the dependence structure. The E-M algorithm is applied to obtain maximum likelihood estimates of the parameters of interest. Numerical examples illustrate the proposed methods.","PeriodicalId":431817,"journal":{"name":"Naval Research Logistics Quarterly","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1985-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116540749","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Transshipment along a single road","authors":"M. Posner, W. Szwarc","doi":"10.1002/NAV.3800320302","DOIUrl":"https://doi.org/10.1002/NAV.3800320302","url":null,"abstract":"This article explores the problem of the transshipment of goods between centers that are situated along a single road. Costs are incurred both for goods that are shipped and for goods that remain in their original centers. A procedure is developed that determines a partial optimal assignment by use of a northwest corner rule solution. This partial assignment then is completed by solving a number of smaller tridiagonal transportation problems.","PeriodicalId":431817,"journal":{"name":"Naval Research Logistics Quarterly","volume":"129 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1985-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133931202","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"On finding spanning eulerian subgraphs","authors":"M. B. Richey, R. Parker, R. Rardin","doi":"10.1002/NAV.3800320308","DOIUrl":"https://doi.org/10.1002/NAV.3800320308","url":null,"abstract":"In this article, we examine the problem of producing a spanning Eulerian subgraph in an undirected graph. After the ℋ-completeness of the general problem is established, we present polynomial-time algorithms for both the maximization and minimization versions where instances are defined on a restricted class of graphs referred to as series-parallel. Some novelties in the minimization case are discussed, as are heuristic ideas.","PeriodicalId":431817,"journal":{"name":"Naval Research Logistics Quarterly","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1985-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132349809","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"State information lag markov decision process with control limit rule","authors":"S. Kim","doi":"10.1002/NAV.3800320311","DOIUrl":"https://doi.org/10.1002/NAV.3800320311","url":null,"abstract":"In 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.","PeriodicalId":431817,"journal":{"name":"Naval Research Logistics Quarterly","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1985-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125594808","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Sensitivity analysis of the optimal location of a facility","authors":"Z. Drezner","doi":"10.1002/NAV.3800320203","DOIUrl":"https://doi.org/10.1002/NAV.3800320203","url":null,"abstract":"We perform a sensitivity analysis of the Euclidean, single-facility minisum problem, which is also known as the Weber problem. We find the sensitivity of the optimal site of the new facility to changes in the locations and weights of the demand points. We apply these results to get the optimal site if some of the parameters in the problem are changed. We also get approximate formulas for the set of all possible optimal sites if demand points are restricted to given areas, and weights must be within given ranges, which is a location problem under conditions of uncertainty.","PeriodicalId":431817,"journal":{"name":"Naval Research Logistics Quarterly","volume":"53 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1985-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115426982","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Control of entry to a nonstationary queuing system","authors":"A. Nozari","doi":"10.1002/NAV.3800320208","DOIUrl":"https://doi.org/10.1002/NAV.3800320208","url":null,"abstract":"In 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.","PeriodicalId":431817,"journal":{"name":"Naval Research Logistics Quarterly","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1985-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124108550","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Tests of independence of continuous random variables which guard against special alternatives","authors":"L. Weiss","doi":"10.1002/NAV.3800320213","DOIUrl":"https://doi.org/10.1002/NAV.3800320213","url":null,"abstract":"For the problem of testing the independence of a set of continuous random variables, where the test is to be based on n independent and identically distributed observations, tests are constructed that guard against all alternatives but are particularly effective against special alternatives of interest. The tests are based on the numbers of observations falling in the cells of a grid constructed using order statistics.","PeriodicalId":431817,"journal":{"name":"Naval Research Logistics Quarterly","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1985-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115229720","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Optimizing search with positive information feedback","authors":"T. Stewart","doi":"10.1002/NAV.3800320207","DOIUrl":"https://doi.org/10.1002/NAV.3800320207","url":null,"abstract":"A 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.","PeriodicalId":431817,"journal":{"name":"Naval Research Logistics Quarterly","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1985-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131928941","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}