-
作者：Block, HW; Savits, TH; Singh, H
作者单位：Pennsylvania Commonwealth System of Higher Education (PCSHE); University of Pittsburgh; West Virginia University; Panjab University
摘要：Optimum burn-in times have been determined for a variety of criteria such as mean residual life and conditional survival. In this paper we consider a residual coefficient of variation that balances mean residual life with residual variance. To study this quantity, we develop a general result concerning the preservation of bathtub distributions. Using this result, we give a condition so that the residual coefficient of variation is bathtub-shaped. Furthermore, we show that it attains its optimu...
-
作者：Tseng, CL; Barz, G
作者单位：University System of Maryland; University of Maryland College Park; McKinsey & Company
摘要：This paper discusses using real options to value power plants with unit commitment constraints over a short-term period. We formulate the problem as a multistage stochastic problem and propose a solution procedure that integrates forward-moving Monte Carlo simulation with backward-moving dynamic programming. We assume that the power plant operator maximizes expected profit by deciding in each hour whether or not to run the unit, that a certain lead time for commitment and decommitment decision...
-
作者：Alpern, S; Gal, S
作者单位：University of London; London School Economics & Political Science; University of Haifa
摘要：There is an extensive theory regarding optimal continuous path search for a mobile or immobile target. The traditional theory assumes that the target is one of three types: (i) an object with a known distribution of paths, (ii) a mobile or immobile hider who wants to avoid or delay capture, or (iii) a rendezvouser who wants to find the searcher. This paper introduces a new type of search problem by assuming that aims of the target are not known to the searcher. The target may be either a type ...
-
作者：Menon, S; Schrage, L
作者单位：Oklahoma State University System; Oklahoma State University - Stillwater; University of Chicago
摘要：A common problem encountered in paper-production facilities is that of allocating customer orders to machines so as to minimize the total cost of production. It can be formulated as a dual-angular integer program, with identical machines inducing symmetry. While the potential advantages of decomposing large mathematical programs into smaller subproblems have long been recognized, the solution of decomposable integer programs remains extremely difficult. Symmetry intensifies the difficulty. Thi...
-
作者：Agarwal, YK
作者单位：Indian Institute of Management (IIM System); Indian Institute of Management Lucknow
摘要：This paper addresses the problem of designing a multicommodity network using several facilities with different costs and capacities. The problem is addressed in a special context of designing private telecommunications networks using Fractional-T1 services. The algorithm starts from any given solution of the problem and gradually improves it by solving a series of subproblems, arriving at a local minimum. The subproblem is defined over a subset of links, called the subnetwork, by using one of ...
-
作者：Mookerjee, VS; Tan, Y
作者单位：University of Texas System; University of Texas Dallas; University of Washington; University of Washington Seattle
摘要：Experience shows that document caching by a web browser is a cheap and effective way to improve the performance of the World Wide Web. This study analyzes a LRU (Least Recently Used) policy for cache management in a web browser. In this policy, the cache is filled with documents based upon a document's age, defined as the time elapsed since the document was last accessed. The user's preference for a document is modeled as a general function that declines with the document's age. Two popular me...
-
作者：Bertsimas, D; Popescu, I
作者单位：Massachusetts Institute of Technology (MIT); INSEAD Business School
摘要：The idea of investigating the relation of option and stock prices based just on the no-arbitrage assumption, but without assuming any model for the underlying price dynamics, has a long history in the financial economics literature. We introduce convex and, in particular semidefinite optimization methods, duality, and complexity theory to shed new light on this relation. For die single stock problem, given moments of the prices of the underlying assets, we show that we can find best-possible b...
-
作者：Netessine, S; Dobson, G; Shumsky, RA
作者单位：University of Pennsylvania; University of Rochester
摘要：We consider a firm that provides multiple services using both specialized and flexible capacity, Pie problem is formulated as a two-stage, single-period stochastic program. The firm invests in capacity before the actual demand is known and optimally assigns capacity to customers when demand is realized. Sample applications include a car rental company's use of mid-sized cars to satisfy unexpectedly high demand for compact cars and an airline's use of business-class seats to satisfy economy-cla...
-
作者：Chen, HM
摘要：This paper considers the inverse problem of estimating time-varying attrition coefficients in Lanchester's square law with reinforcements, using observed data on some or all of the battle's strength histories and the reinforcement schedules. The method employed is a nonparametric extension of the parametric conjugate gradient method (P-CGM). We use hypothetical strength histories and reinforcement schedules that are known to be without error at several points in time to illustrate the method. ...
-
作者：Flagle, CD
