No label defined (Q4484085)

This monograph contains the results of the author's dissertation. Basic planning models are investigated. The monograph is divided into six chapters. Chapter I has an introductory character and brings some motivating examples from operations research. In Chapter II the author investigates two combinatorial problems: the knapsack and the set partitioning problem. An extension of the proof of the periodicity property of the knapsack problem function is presented and the dual all integer algorithm is revised when it is applied to the set partitioning problem. Creedoids and greedy algorithm are studied in Chapter III. This algorithm is then applied to solving some discrete optimization problems. Many practical planning problems have inexact input data or suffer from lack of a number of data. For this reason, the author investigates in Chapter IV so-called uncertain programming problems. In this connection, a genetic algorithm for chance constrained programming is suggested and chance constrained integer programming models for capital budgets in fuzzy environments as well as topological optimization models for communication networks with multiple reliability goals are investigated. Chapter V is devoted to the set covering problem, its solution by the genetic algorithm and information about the corresponding numerical experience. In Chapter VI a summary of the results is given.