Chapter V Polyhedral combinatorics

摘要: Publisher Summary This chapter discusses the polyhedral combinatorics, which deals with interactions between linear algebra, Euclidean geometry, programming, and combinatorial optimization. The combinatorics provides min–max theorems that form an essential part of optimization algorithms.The role in obtaining relationships is discussed. major methods tools are also presented. describes two important ways strengthening relationships—facet characterizations dual integrality. Polarity blocking antiblocking relations for reversing roles objects relations. A useful property, dimension, its uses covered chapter. All relevant definitions theory some approaches using extra variables, eliminating variables discussed this