Outline of a Decision Support System for Area-Wide Water Quality Planning

This working paper outlines requirements for an implementation of a computerized decision support system which addresses the technical aspects of area-wide water quality planning. The framework for this work is in the context of the environmental law adopted in the United States during 1972. This law, known as the Federal Water Pollution Control Act Amendments of 1972, specifies various requirements that both municipal and industrial discharges must eventually conform. By 1977 municipal waste treatment plants must have in place secondary treatment facilities and for industry it is necessary to utilize what is referred to as "best practical technology" for waste treatment. Under certain circumstances as described in section 303 of the law further treatment may be required to meet water quality standards. Section 208 of the Federal Water Pollution Control Act Amendments of 1972 calls for area-wide implementation of technical and management planning, with the objectives of meeting 1983 water quality goals and establishing a plan for municipal and industrial facilities construction over a twenty year period. Emphasis is placed on locally controlled planning, on dealing with non-point sources as well as point sources, and on consideration of both structural and nonstructural control methods. The scope of present examination is limited to those aspects of technical planning which are amenable to implementation within the framework of a computerized decision support system

Large-Scale Linear Programming

During the week of June 2-6, 1980, the System and Decision Sciences Area of the International Institute for Applied Systems Analysis organized a workshop on large-scale linear programming in collaboration with the Systems Optimization Laboratory (SOL) of Stanford University, and co-sponsored by the Mathematical Programming Society (MPS). The participants in the meeting were invited from amongst those who actively contribute to research in large-scale linear programming methodology (including development of algorithms and software). The first volume of the Proceedings contains five chapters. The first is an historical review by George B. Dantzig of his own and related research in time-staged linear programming problems. Chapter 2 contains five papers which address various techniques for exploiting sparsity and degeneracy in the now standard LU decomposition of the basis used with the simplex algorithm for standard (unstructured) problems. The six papers of Chapter 3 concern aspects of variants of the simplex method which take into account through basis factorization the specific block-angular structure of constraint matrices generated by dynamic and/or stochastic linear programs. In Chapter 4, five papers address extensions of the original Dantzig-Wolfe procedure for utilizing the structure of planning problems by decomposing the original LP into LP subproblems coordinated by a relatively simple LP master problem of a certain type. Chapter 5 contains four papers which constitute a mini-symposium on the now famous Shor-Khachian ellipsoidal method applied to both real and integer linear programs. The first chapter of Volume 2 contains three papers on non-simplex methods for linear programming. The remaining chapters of Volume 2 concern topics of present interest in the field. A bibliography a large-scale linear programming research completes Volume 2