Showing 1 - 9 of 9
We formulate the Forest Management Problem as a Multicommodity Network Flow Problem with a convex cost function. We then show how to transfer the problem to an equivalent Single-Commodity Network Flow formulation in order to address several sensitivity analysis questions using results by Granot...
Persistent link: https://www.econbiz.de/10009209376
Persistent link: https://www.econbiz.de/10005323654
Persistent link: https://www.econbiz.de/10005347964
Persistent link: https://www.econbiz.de/10005277316
We introduce and analyze a Hotelling like game wherein players can locate in a city, at a fixed cost, according to an exogenously given order. Demand intensity is assumed to be strictly decreasing in distance and players locate in the city as long as it is profitable for them to do so. For a...
Persistent link: https://www.econbiz.de/10008551266
We develop in this paper two types of heuristic methods for solving the positive 0-1 polynomial programming (PP) problem of finding a 0-1 vector x that maximizes c<sup>T</sup>x subject to f(x) \le b where c, b \ge 0 and f is an m-vector of polynomials with non-negative coefficients. The various heuristics...
Persistent link: https://www.econbiz.de/10009208649
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
Persistent link: https://www.econbiz.de/10012624513
Persistent link: https://www.econbiz.de/10012815645