Stadtherr, Mark A.; Rudd, Dale F.
March 1978
Management Science;Mar78, Vol. 24 Issue 7, p740
Academic Journal
The petrochemical industry is a system of chemical processes that convert petroleum and natural gas into chemicals from which plastics, elastomers, and other synthetic materials can be made. As petroleum and natural gas supplies dwindle, this industry must look elsewhere for its raw materials. A linear-programming model of the industry is described, in which the objective is the efficient use of feedstocks. Four feedstock alternatives are evaluated with this model; the results of these studies are analyzed with respect to changes in the optimal process technology resulting from changes in feedstock availability. The model solutions also indicate the net change in feedstock requirement for the industry, per unit increase in demand for each product. This "feedstock efficiency index" indicates areas of incentive for developing new process technology; these areas are different for different feedstock alternatives. Analysis such as this should provide government planners with information for long-range planning and resource management.


Related Articles

  • DISPATCHING AND ALLOCATING SERVERS TO STOCHASTICALLY FAILING NETWORKS. Moses, Michael // Management Science;Feb1972, Vol. 18 Issue 6, pB-289 

    The problem considered is that of allocating and dispatching servers to networks whose nodes and/or arcs fail stochastically. A mathematical programming formulation is developed which allocates servers to nodal demands so that expected loss is minimized. From this a zero-one programming problem...

  • SUCCESSIVE LINEAR PROGRAMMING AT EXXON. Baker, Thomas E.; Lasdon, Leon S. // Management Science;Mar85, Vol. 31 Issue 3, p264 

    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...

  • ON THE LOADING PROBLEM--A COMMENT. Lev, Benjamin // Management Science;Mar72, Vol. 18 Issue 7, p428 

    The author responds to the paper "The Loading Problem," by Eilon and Christofides. He focuses on suggesting a solution to the problem. The recommended solution involves a heuristic algorithm that allegedly requires fewer computations than the one proposed by Eilon and Christofides. It is...

  • On a Local and Global Search Involved in Nonconvex Optimization Problems. Strekalovsky, A. S.; Yakovleva, T. V. // Automation & Remote Control;Mar2004, Vol. 65 Issue 3, p375 

    A new approach to the solution of nonconvex problems of optimal control and mathematical programming is treated, which rests on the theory of global optimality conditions (GOC). Moreover, attention is given to the development and investigation of special methods of local search and to...

  • PARAMETRIC AND POSTOPTIMALITY ANALYSIS IN INTEGER LINEAR PROGRAMMING. Geoffrion, A. M.; Nauss, R. // Management Science;Jan1977, Vol. 23 Issue 5, p453 

    The purpose of this paper is to take stock of what is known and to suggest some conceptual foundations for future progress in the areas of postoptimality analysis and parametric optimization techniques for integer programming.

  • OPTIMAL RESOURCE ALLOCATION BETWEEN SPOT AND PACKAGE DEMANDS. Kinberg, Yoram; Rao, Ambar G.; Sudit, Ephraim F. // Management Science;Sep80, Vol. 26 Issue 9, p890 

    This paper deals with the problem of allocating fixed resources between two types of demands; (a) spot demand; and (b) package (subscription) demand--demand that is satisfied by selling usage rights over a prespecified time period prior to actual consumption. In Model 1, a probabilistic spot...

  • A Multiplier Adjustment Method for Dynamic Resource Allocation Problems. Carvalho, Tassio A.; Powell, Warren B. // Transportation Science;May2000, Vol. 34 Issue 2, p150 

    Dynamic fleet management problems (with a homogeneous fleet) are classically formulated as dynamic networks, or linear programs with side constraints. Recently, a new dynamic control approach was introduced, called a logistics queueing network. Instead of a large linear program, the problem is...

  • RESOURCE ALLOCATION TO INTERRELATED RISKY PROJECTS USING A MULTIATTRIBUTE UTILITY FUNCTION. Mehrez, Abraham; Sinuany-Stern, Zilla // Management Science;Apr1983, Vol. 29 Issue 4, p430 

    Two major contributions are made to the problem of resource allocation to indivisible projects with uncertain outcomes: the concepts of preferential independence and utility independence for the space of discrete projects are defined, and a multiattribute utility theory is linked with...

  • A NOTE ON MINIMAX (MAXIMIN) PROGRAMMING. Kawaguchi, T.; Maruyama, Y. // Management Science;Feb1976, Vol. 22 Issue 6, p670 

    Charnes [2] has established the equivalence between the linear programming and the constrained rectangular game. An attempt is made here to establish a similar equivalence between the linear programming and a more general class of decision problems which may be referred to as the "minimax (or...


Read the Article


Sorry, but this item is not currently available from your library.

Try another library?
Sign out of this library

Other Topics