Showing papers on "Metaheuristic published in 1982"

Combinatorial optimization: algorithms and complexity

Abstract: This clearly written , mathematically rigorous text includes a novel algorithmic exposition of the simplex method and also discusses the Soviet ellipsoid algorithm for linear programming; efficient algorithms for network flow, matching, spanning trees, and matroids; the theory of NP-complete problems; approximation algorithms, local search heuristics for NPcomplete problems, more All chapters are supplemented by thoughtprovoking problems A useful work for graduate-level students with backgrounds in computer science, operations research, and electrical engineering Mathematicians wishing a self-contained introduction need look no further—American Mathematical Monthly 1982 ed

A Reliability Optimization Method for Complex Systems with the Criterion of Local Optimality

Abstract: A method with a new criterion of local optimality is proposed to solve reliability optimization problems of complex systems, where the structure need not be series. Unlike previous methods, the proposed algorithm yields a solution which is optimal in 2-neighborhood. The effectiveness of the method is shown through examples.

Computation of the search direction in constrained optimization algorithms

Abstract: Several algorithms for constrained optimization are based on the idea of choosing the search direction as the solution of a quadratic program (QP). However, there is considerable variation in the precise nature of the quadratic program to be solved. Furthermore, significant differences exist in the procedures advocated to ensure that the search direction is well defined, and some algorithms abandom the quadratic programming approach for particular iterations under certain conditions. In this paper, we discuss some crucial differences in formulation and solution that arise in QP-based methods for linearly constrained and nonlinearly constrained optimization, with particular emphasis on the treatment of inequality constraints. For linearly constrained problems, we consider the effect of formulating the constraints of the QP sub-problem as equalities or inequalities. In the case of nonlinear constraints, the issues to be discussed include incompatibility or ill-conditioning of the constraints, determination of the active set, Lagrange multiplier estimates, and approximation of the Lagrangian function.