Publisher's Synopsis
A linear semi–infinite program is an optimization problem with linear objective functions and linear constraints in which either the number of unknowns or the number of constraints is finite. The many direct applications of linear semi–infinite optimization (or programming) have prompted considerable and increasing research effort in recent years. The authors′ aim is to communicate the main theoretical ideas and applications techniques of this fascinating area, from the perspective of convex analysis. The four sections of the book cover:
∗ Modelling with primal and dual problems – the primal problem, space of dual variables, the dual problem.
∗ Linear semi–infinite systems – existence theorems, alternative theorems, redundancy phenomena, geometrical properties of the solution set.
∗ Theory of linear semi–infinite programming – optimality, duality, boundedness, perturbations, well–posedness.
∗ Methods of linear semi–infinite programming – an overview of the main numerical methods for primal and dual problems.
Exercises and examples are provided to illustrate both theory and applications. The reader is assumed to be familiar with elementary calculus, linear algebra and general topology. An appendix on convex analysis is provided to ensure that the book is self–contained. Graduate students and researchers wishing to gain a deeper understanding of the main ideas behind the theory of linear optimization will find this book to be an essential text.
