Advertisement

Mathematical Programming and Control Theory

  • B. D. Craven

Part of the Chapman and Hall Mathematics Series book series (CHMS)

Table of contents

  1. Front Matter
    Pages i-xi
  2. B. D. Craven
    Pages 1-18
  3. B. D. Craven
    Pages 19-35
  4. B. D. Craven
    Pages 36-48
  5. B. D. Craven
    Pages 49-75
  6. B. D. Craven
    Pages 76-90
  7. B. D. Craven
    Pages 91-118
  8. B. D. Craven
    Pages 119-146
  9. Back Matter
    Pages 147-163

About this book

Introduction

In a mathematical programming problem, an optimum (maxi­ mum or minimum) of a function is sought, subject to con­ straints on the values of the variables. In the quarter century since G. B. Dantzig introduced the simplex method for linear programming, many real-world problems have been modelled in mathematical programming terms. Such problems often arise in economic planning - such as scheduling industrial production or transportation - but various other problems, such as the optimal control of an interplanetary rocket, are of similar kind. Often the problems involve nonlinear func­ tions, and so need methods more general than linear pro­ gramming. This book presents a unified theory of nonlinear mathe­ matical programming. The same methods and concepts apply equally to 'nonlinear programming' problems with a finite number of variables, and to 'optimal control' problems with e. g. a continuous curve (i. e. infinitely many variables). The underlying ideas of vector space, convex cone, and separating hyperplane are the same, whether the dimension is finite or infinite; and infinite dimension makes very little difference to the proofs. Duality theory - the various nonlinear generaliz­ ations of the well-known duality theorem of linear program­ ming - is found relevant also to optimal control, and the , PREFACE Pontryagin theory for optimal control also illuminates finite dimensional problems. The theory is simplified, and its applicability extended, by using the geometric concept of convex cones, in place of coordinate inequalities.

Keywords

Linear Programming algorithms mathematical programming network optimal control optimization project

Authors and affiliations

  • B. D. Craven
    • 1
  1. 1.University of MelbourneAustralia

Bibliographic information

  • DOI https://doi.org/10.1007/978-94-009-5796-1
  • Copyright Information Springer Science+Business Media B.V. 1978
  • Publisher Name Springer, Dordrecht
  • eBook Packages Springer Book Archive
  • Print ISBN 978-0-412-15500-0
  • Online ISBN 978-94-009-5796-1
  • Buy this book on publisher's site