Naval Research Logistics Quarterly最新文献_第5页

Decentralized stockage policies in a multiechelon environment 多层环境中的分散存储策略

Naval Research Logistics Quarterly Pub Date : 1986-05-01 DOI: 10.1002/NAV.3800330203

S. Frazza, A. Kaplan

引用次数: 1

Optimal selection with alternative information 具有可选信息的最优选择

Naval Research Logistics Quarterly Pub Date : 1986-05-01 DOI: 10.1002/NAV.3800330211

G. Monahan

引用次数: 1

An entropy model for marketing structure analysis and price decision of new brand 新品牌营销结构分析与价格决策的熵模型

Naval Research Logistics Quarterly Pub Date : 1986-05-01 DOI: 10.1002/NAV.3800330208

I. Arizono, H. Ohta

引用次数: 2

Heterogeneous discrete expenditure for diminishing returns 收益递减的异质离散支出

Naval Research Logistics Quarterly Pub Date : 1986-05-01 DOI: 10.1002/NAV.3800330204

H. Hamburger, J. Slagle

引用次数: 0

Comparative evaluation of prior versus progressive articulation of preference in bicriterion optimization 双标准优化中优先选择与渐进选择的比较评价

Naval Research Logistics Quarterly Pub Date : 1986-05-01 DOI: 10.1002/NAV.3800330212

G. Klein, H. Moskowitz, A. Ravindran

{"title":"Comparative evaluation of prior versus progressive articulation of preference in bicriterion optimization","authors":"G. Klein, H. Moskowitz, A. Ravindran","doi":"10.1002/NAV.3800330212","DOIUrl":"https://doi.org/10.1002/NAV.3800330212","url":null,"abstract":"Procedures for solving multiple criteria problems are receiving increasing attention. Two major solution approaches are those involving prior articulation and progressive articulation of preference information. A progressive articulation (interactive) optimization approach, called the Paired Comparison Method (PCM) is compared to the prior articulation approach of a priori utility function measurement in a quality control decision environment from the perspective of the decision maker. The three major issues investigated included: (1) the ease of use of each method, (2) the preferences of solutions obtained, and (3) the insight provided by the methodology into the nature and structure of the problem. The problem setting involved management students who were rquired to determine an acceptance sampling plan using both methods. The PCM provided the most preferred solutions and was considered easier to use and understand. The prior articulation of preference method was found to give more insight into the problem structure. The results suggest that a hybrid approach, combining both prior preference assessment and an interactive procedure exploiting the advantages of each, should be employed to solve multiple criteria problems.","PeriodicalId":431817,"journal":{"name":"Naval Research Logistics Quarterly","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1986-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130461623","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}

引用次数: 24

Using simulated annealing to solve routing and location problems 用模拟退火法求解布线和定位问题

Naval Research Logistics Quarterly Pub Date : 1986-05-01 DOI: 10.1002/NAV.3800330209

B. Golden, C. C. Skiscim

引用次数: 211

Use of discounted force arrivals in static force comparisons 静力比较中贴现力到达的使用

Naval Research Logistics Quarterly Pub Date : 1986-05-01 DOI: 10.1002/NAV.3800330205

R. Lorentzen

引用次数: 0

The analysis of some algorithms for generating random variates with a given hazard rate 分析了在给定风险率下产生随机变量的几种算法

Naval Research Logistics Quarterly Pub Date : 1986-05-01 DOI: 10.1002/NAV.3800330210

L. Devroye

引用次数: 6

Successive approximation in separable programming: an improved procedure for convex separable programs 可分规划中的逐次逼近:凸可分规划的改进程序

Naval Research Logistics Quarterly Pub Date : 1986-05-01 DOI: 10.1002/NAV.3800330213

L. Thakur

{"title":"Successive approximation in separable programming: an improved procedure for convex separable programs","authors":"L. Thakur","doi":"10.1002/NAV.3800330213","DOIUrl":"https://doi.org/10.1002/NAV.3800330213","url":null,"abstract":"We implement a solution procedure for general convex separable programs where a series of relatively small piecewise linear programs are solved as opposed to a single large one, and where, based on bound calculations developed in [13] and [14], the ranges of linearization are systematically reduced for successive programs. The procedure inherits e-convergence to the global optimum in a finite number of steps, but perhaps its most distinct feature is the rigorous way in which ranges containing an optimal solution are reduced from iteration to iteration. This paper describes the procedure, called successive approximation, discusses its convergence, tightness of the bounds, bound-calculation overhead, and its robustness. It presents a computer implementation to demonstrate its effectiveness for general problems and compares it (1) with the more standard separable programming approach and (2) with one of the recent augmented Lagrangian methods [10] included in a comprehensive study of nonlinear programming codes [12]. It seems clear from over 130 cases resulting from 80 distinct problems studied here that significant savings in terms of computational effort can be realized by a judicious use of the procedure, and the ease with which it can be used is appreciably increased by the robustness it shows. Moreover, for most of these problems, the advantage increases as the size, nonlinearity, and the degree of desired accuracy increase. Other important benefits include significantly smaller storage requirements, the ability to estimate the error in the current solution, and to terminate the algorithm as soon as the acceptable level of accuracy has been achieved. Problems requiring up to about 10,000 nonzero elements in their specification and about 45,000 nonzero elements in the generated separable programs resulting from up to 70 original nonlinear variables and 70 nonlinear constraints are included in the computations.","PeriodicalId":431817,"journal":{"name":"Naval Research Logistics Quarterly","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1986-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125330710","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}

引用次数: 7

Optimal stocking policies for low usage items in multi‐echelon inventory systems 多级库存系统中低使用率物品的最优库存策略

Naval Research Logistics Quarterly Pub Date : 1986-02-01 DOI: 10.1002/NAV.3800330103

Morris A. Cohen, P. Kleindorfer, Hau L. Lee

引用次数: 116