numerical methods solving semi infinite von tezel özturan (7 Ergebnisse)

Taschenbuch. Zustand: Neu. Neuware -A semi-infinite programming problem is an optimization problem in which finitely many variables appear in infinitely many constraints. This model naturally arises in an abundant number of applications in different fields of mathematics, economics and engineering. If the infinite index set also depends on the decision variable of optimization, then the problem is called generalized semi-infinite programming problem (GSIP). Chebyshev approximation, reverse Chebyshev approximation, design centering, robust optimizations, the optimal layout of an assembly line, time minimal control and disjunctive optimization are some examples for GSIP problems. This book gives a brief review of numerical methods for solving semi-infinite programming problems and introduces the semi smooth Newton method for solving GSIP problems. Convergence and numerical results shows that the method is a promising numerical method for solution of GSIP problems.Books on Demand GmbH, Überseering 33, 22297 Hamburg 160 pp. Englisch.

Zustand: New.

Zustand: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. Autor/Autorin: Tezel Oezturan AysunDr. Aysun TEZEL OeZTURAN was born in 1978 in Ordu, Turkey. She studied Mathematics at the Middle East Technical University (METU) in Ankara. She completed her Ph.D. in Mathematics at METU in year 2010 and received b.

Taschenbuch. Zustand: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -A semi-infinite programming problem is an optimization problem in which finitely many variables appear in infinitely many constraints. This model naturally arises in an abundant number of applications in different fields of mathematics, economics and engineering. If the infinite index set also depends on the decision variable of optimization, then the problem is called generalized semi-infinite programming problem (GSIP). Chebyshev approximation, reverse Chebyshev approximation, design centering, robust optimizations, the optimal layout of an assembly line, time minimal control and disjunctive optimization are some examples for GSIP problems. This book gives a brief review of numerical methods for solving semi-infinite programming problems and introduces the semi smooth Newton method for solving GSIP problems. Convergence and numerical results shows that the method is a promising numerical method for solution of GSIP problems. 160 pp. Englisch.

Taschenbuch. Zustand: Neu. nach der Bestellung gedruckt Neuware - Printed after ordering - A semi-infinite programming problem is an optimization problem in which finitely many variables appear in infinitely many constraints. This model naturally arises in an abundant number of applications in different fields of mathematics, economics and engineering. If the infinite index set also depends on the decision variable of optimization, then the problem is called generalized semi-infinite programming problem (GSIP). Chebyshev approximation, reverse Chebyshev approximation, design centering, robust optimizations, the optimal layout of an assembly line, time minimal control and disjunctive optimization are some examples for GSIP problems. This book gives a brief review of numerical methods for solving semi-infinite programming problems and introduces the semi smooth Newton method for solving GSIP problems. Convergence and numerical results shows that the method is a promising numerical method for solution of GSIP problems.

Zustand: New. PRINT ON DEMAND.

Zustand: New. Print on Demand.