Mathematical Programming Control Theory (24 results)

Paperback. Condition: Very Good. The book has been read, but is in excellent condition. Pages are intact and not marred by notes or highlighting. The spine remains undamaged.

paperback. Condition: Gut. Seiten; 9780470264072.3 Gewicht in Gramm: 500.

Hardcover. Condition: Good. Dust Jacket Condition: Good Dust Jacket. good hardcover in good dust jacket, minor marginalia/underlining.

Paperback. Condition: Good. Dust Jacket Condition: Unknown. thisex-library copy has a solid tight binding with clean unmarked pages.edge wear.

Condition: Good. This is an ex-library book and may have the usual library/used-book markings inside.This book has hardback covers. In good all round condition. No dust jacket. Please note the Image in this listing is a stock photo and may not match the covers of the actual item,700grams, ISBN:

Paperback. Condition: Very Good. Non circulating ex University of California, Berkeley reference library book with some library markings. Softcover overbound with stiff library boards. Binding is tight. No other marks in very lightly read book.

Broschiert. Condition: Gut. 158 Seiten; Das hier angebotene Buch stammt aus einer teilaufgelösten Bibliothek und kann die entsprechenden Kennzeichnungen aufweisen (Rückenschild, Instituts-Stempel.); der Buchzustand ist ansonsten ordentlich und dem Alter entsprechend gut. In ENGLISCHER Sprache. Sprache: Englisch Gewicht in Gramm: 220.

Condition: New. In.

PF. Condition: New.

VG, unmarked 5 1/2" x 8 1/2" Paperback; front end-paper foxed. xi + 163 pp.

gebundene Ausgabe. Condition: Gut. 285 Seiten Das hier angebotene Buch stammt aus einer teilaufgelösten Bibliothek und kann die entsprechenden Kennzeichnungen aufweisen (Rückenschild, Instituts-Stempel.); der Buchzustand ist ansonsten ordentlich und dem Alter entsprechend gut. In ENGLISCHER Sprache. Sprache: Englisch Gewicht in Gramm: 520.

Taschenbuch. Condition: Neu. Druck auf Anfrage Neuware - Printed after ordering - 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.

Condition: New. SUPER FAST SHIPPING.

Condition: New.

Halbleinen. Condition: Sehr gut. Zust: Gutes Exemplar. XII, 285 Seiten, Englisch 562g.

Condition: New. Series: Chapman and Hall Mathematics Series (Closed). Num Pages: 176 pages, biography. BIC Classification: PBK. Category: (P) Professional & Vocational; (UP) Postgraduate, Research & Scholarly; (UU) Undergraduate. Dimension: 216 x 140 x 9. Weight in Grams: 231. . 1978. Paperback. . . . .

Condition: New. Series: Chapman and Hall Mathematics Series (Closed). Num Pages: 176 pages, biography. BIC Classification: PBK. Category: (P) Professional & Vocational; (UP) Postgraduate, Research & Scholarly; (UU) Undergraduate. Dimension: 216 x 140 x 9. Weight in Grams: 231. . 1978. Paperback. . . . . Books ship from the US and Ireland.

Paperback. Condition: new. Paperback. 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. 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. Shipping may be from multiple locations in the US or from the UK, depending on stock availability.

Paperback. Condition: new. Paperback. 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. 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. Shipping may be from our Sydney, NSW warehouse or from our UK or US warehouse, depending on stock availability.

Hardcover. Condition: Good. Ex-library book, usual markings. Hardback/Hardcover without dust cover. Clean text, sound binding. Quick dispatch from UK seller.

Paperback / softback. Condition: New. This item is printed on demand. New copy - Usually dispatched within 5-9 working days 260.

Condition: Good. Former library book; may include library markings. Used book that is in clean, average condition without any missing pages.

Taschenbuch. Condition: Neu. This item is printed on demand - Print on Demand Titel. Neuware -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.Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg 176 pp. Englisch.

Taschenbuch. Condition: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -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. 176 pp. Englisch.