This volume describes the relationship between systems of linear inequalities and the geometry of convex polygons, examines solution sets for systems of linear inequalities in two and three unknowns (extension of the processes introduced to systems in any number of unknowns is quite simple), and examines questions of the consistency or inconsistency of such systems. Finally, it discusses the field of linear programming, one of the principal applications of the theory of systems of linear inequalities. A proof of the duality theorem of linear programming is presented in the last section.

This volume describes the relationship between systems of linear inequalities and the geometry of convex polygons, examines solution sets for systems of linear inequalities in two and three unknowns (extension of the processes introduced to systems in any number of unknowns is quite simple), and examines questions of the consistency or inconsistency of such systems. Finally, it discusses the field of linear programming, one of the principal applications of the theory of systems of linear inequalities. A proof of the duality theorem of linear programming is presented in the last section.

This volume describes the relationship between systems of linear inequalities and the geometry of convex polygons, examines solution sets for systems of linear inequalities in two and three unknowns (extension of the processes introduced to systems in any number of unknowns is quite simple), and examines questions of the consistency or inconsistency of such systems. Finally, it discusses the field of linear programming, one of the principal applications of the theory of systems of linear inequalities. A proof of the duality theorem of linear programming is presented in the last section.