Showing papers on "Discrete optimization published in 1976"

Optimal design of pressure relieving piping networks by discrete merging

Abstract: Refinery relief-header network design can be optimized by a new discrete optimization technique which requires no rounding of decision variables, no initial guesses for the solution, and no artificial termination criteria; it produces parametric solutions when the optimum is attained. The method is also faster and more compact than the alternative continuous optimization methods.

Methodology for simultaneous optimization with reliability: nuclear PWR example

Abstract: Approaches to combining optimization and reliability usually treat the two as separate problems, determining the reliability by integer programming. The purpose of the paper is to describe a method for including reliability in the usual process optimization problem. The algorithm applied to this mixed integer problem is the adaptive random search, which can search both discrete and continuous variables simultaneously. This method is applied to optimization of the primary cooling system of a PWR, which has twelve independent variables, three of which are integers directly affecting system reliability. Reliability data were obtained from USAEC-WASH 1400 report. Optimization results are presented for various levels of reliability.

Program Optimization Using Invariants

Abstract: Optimizing a computer program is defined as improving the execution time without disturbing the correctness. We show how to use invariants generated from the program to change the statements in and around the program's loops. This approach is shown to systematize existing optimization methods, and to sometimes allow stronger optimizations than are possible under the standard transformation approach.

FLOPT2--A Program for Least pth Optimization with Extrapolation to Minimax Solutions (Computer Program Descriptions)

Abstract: To solve least pth optimization problems, featuring art extrapolation procedure for minimax designs and a scheme for dropping inactive functions, assuming the availability of first partial derivatives with respect to the design parameters.

A numerical procedure for sensitivity analysis in geometric programming

Abstract: This paper presents a development of sensitivity analysis (post optimal) for non-linear optimization problems. The basis for this development is the optimization technique known as geometric programming. Efficient procedures are developed which relate changes in the coefficients to the new design variables. The procedure is used to analyze the design of a condenser.

An Introduction to Simulation and Optimization

Abstract: A review of recent work in simulation and optimization is made with the aim of introducing the designer to the benefits of automating optimal design procedures and to indicate limitations imposed by the current state of the art

Algorithms for Rational Discrete Least Squares Approximation Part I: Unconstrained Optimization

Abstract: In this paper a modification of L. Wittmeyer’s method ([1], [14]) for rational discrete least squares approximation is given which corrects for its failure to converge to a non-optimal point in general. The modification makes necessary very little additional computing effort only. It is analysed thoroughly with respect to its conditions for convergence and its numerical properties. A suitable implementation is shown to be benign in the sense of F. L. Bauer [2]. The algorithm has proven successful even in adverse situations.