Showing papers on "Discrete optimization published in 1975"

Discrete Mathematical Structures with Applications to Computer Science

Abstract: Discrete mathematical structures with applications to computer science , Discrete mathematical structures with applications to computer science , مرکز فناوری اطلاعات و اطلاع رسانی کشاورزی

Optimal Stratification and Grouping by Dynamic Programming

Abstract: In statistics and their fields of application a number of different problems in respect to stratification and grouping of random variables or their values result in optimization problems of the same structure. By a suitable transformation a global optimal solution of these problems can be determined by dynamic programming. The results are illustrated for discrete and continuous random variables by numerical results.

Sensitivity Analysis in Discrete Optimization

Abstract: : Theory and methods are presented for analyzing sensitivity of the optimal value and optimal solution set to perturbations in problem data in nonlinear bounded optimization problems with discrete variables. Emphasis is given to studying behavior of the optimal value function. Theory is developed primarily for mixed integer programming (MIP) problems, where the domain is a subset of a Euclidean vector space.

Applications of Optimal Control Theory to Structural Optimization: Analytical and Numerical Approach

Abstract: In the recent years a considerable amount of effort has been devoted to the field of synthesis of complex discretized structures with the use of mathematical programming. Nevertheless, optimization of basic continuous structural members—such as a bar, a beam, a plate or a shell—under various conditions has not been fully explored yet and is still of utmost interest. In addition to providing well-known solutions with which the validity of various discrete optimization schemes may be tested, it also permits an insight into the non-trivial and most often overlooked problem of existence and uniqueness of optimal solutions.

The Discrete Model

Abstract: The discrete model of the theory of structures fits into the general scheme presented in Chapter 4.

Optimization Techniques for Computerized Simulation Models.

Abstract: : This paper reports on the state of the art of available optimization techniques which can be associated with computerized simulation models Specifically, the paper focuses on findings from a literature search and contacts with professionals involved in current research on those optimization techniques which can be applied to the identification of an optimum value for a single output performance measure when a family of input variables can assume either continuous or discrete values In addition, the research considers a set of measures of effectiveness which can be used to assess the relative merits of the various optimization techniques encountered without providing a numerical ranking

System theory: A unified state-space approach to continuous and discrete time systems

Abstract: In this age of modern era, the use of internet must be maximized. Yeah, internet will help us very much not only for important thing but also for daily activities. Many people now, from any level can use internet. The sources of internet connection can also be enjoyed in many places. As one of the benefits is to get the on-line system theory a unified state space approach to continuous and discrete systems book, as the world window, as many people suggest.

The Use of the Box Step Method in Discrete Optimization

Abstract: The Boxstep method is used to maximize Lagrangean functions in the context of a branch-and-bound algorithm for the general discrete optimization problem. Results are presented for three applications: facility location, multi-item production scheduling, and single machine scheduling. The performance of the Boxstep method is contrasted with that of the subgradient optimization method.

THe Use of the Box Step Method in Discrete Optimization

Abstract: The Boxstep method is used to maximize Lagrangean functions in the context of a branch-and-bound algorithm for the general discrete optimization problem. Results are presented for three applications: facility location, multi-item production scheduling, and single machine scheduling. The performance of the Boxstep method is contrasted with that of the subgradient optimization method.

Optimization in Design by Reliability

Abstract: This paper considers the problem of minimizing the total cost to be spent on controlling the stress and strength parameters for the normal variables subject to the constraint that the component must have a specified reliability. A numerical example is solved to illustrate the optimization technique.

Optimal design of nonlinear dc transistor circuits without solving network equations

Abstract: A method is described for the optimization of nonlinear dc circuits. A performance index is defined to measure the difference. between the desired and the actual specifications. The novel approach taken here is to treat the network equations as equality constraints on the design parameters. The constrained optimization problem is then converted to an unconstrained one by a penalty function technique. A straightforward method is given for computing all the gradients needed during the optimization, given only the topology of the network and the branch relationships. This makes the algorithm easily amenable to a package program.

Optimization of Structural Elements

Abstract: A numerical method for the solution of structural optimization problems involving ordinary differential equations is presented for a simple situation where the constraint is of an aeroelastic nature. The method is adapted from optimal control theory and has proven successful in a number of structural optimization problems. Its extension to two dimensional structures is outlined ; limitation to situations involving plates, however, is emphasized. It is assumed that the instability exhibited by the optimality condition is related to the fact that plates cannot in general achieve global extrema. Suggestions for further research in this area are presented.

A Functional Package for Monitoring Branching Methods in Combinatorial Optimization

Abstract: It was found that SICOBA could be used mainly for the three following purposes for testing various strategies on various combinatorial optimization problems for helping to find better heuristics for solving directly complex problems without using mathematical models.

Performance optimization of nonlinear electrical networks

Abstract: A program suite for the optimization of nonlinear networks is described. This suite provides an interactive automated design aid within a small-machine environment. A unified approach for time-domain design is presented. A generalized form of performance function is used and is based on the development of the adjoint-network from Tellegen's theorem. A suitable set of the adjoint-network excitations is also obtained. The constrained optimization of the performance function is transformed by a change of variables into an unconstrained problem. Powell's algorithm for unconstrained minimization is used. The optimization algorithm requires the value of the performance function and its derivatives which are obtained from analyses of the network and its adjoint. The program is implemented on a small computer with 16k words of (16-bit) core store. The overall structure of the program suite is described and results of the optimization of some simple circuits are given.