Showing 1 - 10 of 15
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
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
the two-level linear programming problem. Geometric characterizations and algorithms are presented with some examples. The …
Persistent link: https://www.econbiz.de/10009214654
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
develop algorithms for numerous practical cost structures involving variable and fixed charges and prove that they all have …
Persistent link: https://www.econbiz.de/10009218241
In public policy decision making and in capital planning fractional criterion functions occur. For a given set of desirable target values (goals) \tau <sub>i</sub>, this paper develops an algorithm for solving a nonconvex programming problem of the type: Min<sub>x\in s</sub> Max<sub>i</sub>{\phi <sub>i</sub>(f<sub>i</sub>(x)/g<sub>i</sub>(x) - \tau <sub>i</sub>), i = 1,...
Persistent link: https://www.econbiz.de/10009218254
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
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
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
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