Narrow search
Showing 1 - 10 of 79
Cover Image
Information Acquisition and the Adoption of New Technology
McCardle, Kevin F. - In: Management Science 31 (1985) 11, pp. 1372-1389
The profitability of a new technology is rarely known with certainty at its announcement date. Consequently, prior to … estimate of profitability crosses one of two thresholds: upon crossing the upper threshold the firm adopts the technology …, whereas the firm rejects the technology if the lower threshold is crossed. The model predicts that even the manager who …
Persistent link: https://www.econbiz.de/10009218336
Cover Image
A Transportation Type Aggregate Production Model with Backordering
Posner, Marc E.; Szwarc, Wlodzimierz - In: Management Science 29 (1983) 2, pp. 188-199
In this paper we consider a certain aggregate production planning model. This model permits regular and overtime production and allows for backordering of goods for a number of periods. Although the discussed model can be formulated as a linear programming problem a special (noniterative) method...
Persistent link: https://www.econbiz.de/10009203840
Cover Image
Three Scheduling Algorithms Applied to the Earth Observing Systems Domain
Wolfe, William J.; Sorensen, Stephen E. - In: Management Science 46 (2000) 1, pp. 148-166
then introduced that outperforms the dispatcher by about 12% with only a small increase in run time. These algorithms set …
Persistent link: https://www.econbiz.de/10009204420
Cover Image
Finding Embedded Network Rows in Linear Programs I. Extraction Heuristics
Bixby, Robert E.; Fourer, Robert - In: Management Science 34 (1988) 3, pp. 342-376
An embedded network within a linear program is, roughly speaking, a subset of constraints that represent conservation of flow. We examine three broad classes of heuristic techniques---row-scanning deletion, column-scanning deletion, and row-scanning addition---for the extraction of large...
Persistent link: https://www.econbiz.de/10009208454
Cover Image
Scheduling to Minimize Maximum Workload
Lüthi, Hans-Jakob; Polyméris, Andrés - In: Management Science 31 (1985) 11, pp. 1409-1415
minimizes the maximum total workload. These algorithms require a computational time of the order of m<sup>2</sup> and negligible …
Persistent link: https://www.econbiz.de/10009208709
Cover Image
Successive Linear Programming at Exxon
Baker, Thomas E.; Lasdon, Leon S. - In: Management Science 31 (1985) 3, pp. 264-274
Successive Linear Programming (SLP) has been used extensively in the refining and petrochemical industries for over 20 years. This paper concentrates on some recent work at Exxon to unify the treatment of nonlinear terms in "mostly linear" models. We first discuss the source of nonlinearities in...
Persistent link: https://www.econbiz.de/10009208846
Cover Image
Covering Relaxation for Positive 0-1 Polynomial Programs
Granot, Daniel; Granot, Frieda; Kallberg, Jerry - In: Management Science 25 (1979) 3, pp. 264-273
Granot and Hammer (Granot, F., P. L. Hammer. 1971. On the use of boolean functions in 0-1 programming. Operations Research, Statistics and Economic Mimeograph Series No. 70, Technion (August 1970). (Published in Methods of Oper. Res. 12 154-184); Granot, F., P. L. Hammer. 1975. On the role of...
Persistent link: https://www.econbiz.de/10009209396
Cover Image
An Overview of Techniques for Solving Multiobjective Mathematical Programs
Evans, Gerald W. - In: Management Science 30 (1984) 11, pp. 1268-1282
Multiobjective mathematical programming has been one of the fastest growing areas of OR/MS during the last 15 years. This paper presents: (1) some reasons for the rapidly growing increase in interest in multiobjective mathematical programming, (2) a discussion of the advantages and disadvantages...
Persistent link: https://www.econbiz.de/10009214210
Cover Image
Two-Level Linear Programming
Bialas, Wayne F.; Karwan, Mark H. - In: Management Science 30 (1984) 8, pp. 1004-1020
the two-level linear programming problem. Geometric characterizations and algorithms are presented with some examples. The …
Persistent link: https://www.econbiz.de/10009214654
Cover Image
A Forward Simplex Method for Staircase Linear Programs
Aronson, Jay E.; Morton, Thomas E.; Thompson, Gerald L. - In: Management Science 31 (1985) 6, pp. 664-679
design, agricultural planning, dynamic traffic assignment, production planning, and scheduling models. Forward algorithms … when a stopping rule can be invoked (or a decision horizon found). Such algorithms are available for a large number of …
Persistent link: https://www.econbiz.de/10009214751