Bøger af C. M. Shetty

The disjunctive cut principle of Balas and Jeroslow, and the related polyhedral annexation principle of Glover, provide new insights into cutting plane theory.

On the conditions of optima1ity they deal mainly with generali- tions of known results to more general problems and also with less restrictive assumptions. This book is intended for researchers in nonlinear programming, and deals mainly with convex analysis, optimality conditions and duality in nonlinear programming.