Constraint systems and optimization problems

The Lipschitz-like property and the Robinson stability of the solution map of a parametric linear constraint system by means of normal coderivative, the Mordukhovich criterion, and a related theorem due to Levy and Mordukhovich.

124p elephantcarrot 02-07-2021 25 5   Download

Evolutionary Methods for the Design of Reliable Networks Alice E. Smith and Berna Dengiz Introduction to the Design Problem The problem of how to design a network so that certain constraints are met and one or more objectives are optimized is relevant in many real world applications in telecommunications (Abuali et al., 1994a; Jan et al., 1993; Koh and Lee, 1995; Walters and Smith, 1995), computer networking (Chopra et al., 1984; Pierre et al., 1995), water systems (Savic and Walters, 1995) and oil and gas lines (Goldberg, 1989).

18p tienvovan 11-09-2010 88 9   Download

Upon reading Cook’s paper, I realized at once that his concept of an archetypal combinatorial problem was a formalization of an idea that had long been part of the folklore of combinatorial optimization. Workers in that field knew that the integer programming problem, which is essentially the problem of deciding whether a system of linear inequalities has a solution in integers, was general enough to express the constraints of any of the commonly encountered combinatorial optimization problems. Dantzig had published a paper on that theme in 1960.

0p ledung 13-03-2009 96 5   Download