Separable Programming
Separable Programming

Author: S.M. Stefanov

Publisher: Springer Science & Business Media

Published: 2013-11-11

Total Pages: 323

ISBN-13: 1475734174

DOWNLOAD EBOOK

In this book, the author considers separable programming and, in particular, one of its important cases - convex separable programming. Some general results are presented, techniques of approximating the separable problem by linear programming and dynamic programming are considered. Convex separable programs subject to inequality/ equality constraint(s) and bounds on variables are also studied and iterative algorithms of polynomial complexity are proposed. As an application, these algorithms are used in the implementation of stochastic quasigradient methods to some separable stochastic programs. Numerical approximation with respect to I1 and I4 norms, as a convex separable nonsmooth unconstrained minimization problem, is considered as well. Audience: Advanced undergraduate and graduate students, mathematical programming/ operations research specialists.

Separable Optimization
Separable Optimization

Author: Stefan M. Stefanov

Publisher: Springer Nature

Published: 2022-01-01

Total Pages: 360

ISBN-13: 3030784010

DOWNLOAD EBOOK

In this book, the theory, methods and applications of separable optimization are considered. Some general results are presented, techniques of approximating the separable problem by linear programming problem, and dynamic programming are also studied. Convex separable programs subject to inequality/ equality constraint(s) and bounds on variables are also studied and convergent iterative algorithms of polynomial complexity are proposed. As an application, these algorithms are used in the implementation of stochastic quasigradient methods to some separable stochastic programs. The problems of numerical approximation of tabulated functions and numerical solution of overdetermined systems of linear algebraic equations and some systems of nonlinear equations are solved by separable convex unconstrained minimization problems. Some properties of the Knapsack polytope are also studied. This second edition includes a substantial amount of new and revised content. Three new chapters, 15-17, are included. Chapters 15-16 are devoted to the further analysis of the Knapsack problem. Chapter 17 is focused on the analysis of a nonlinear transportation problem. Three new Appendices (E-G) are also added to this edition and present technical details that help round out the coverage. Optimization problems and methods for solving the problems considered are interesting not only from the viewpoint of optimization theory, optimization methods and their applications, but also from the viewpoint of other fields of science, especially the artificial intelligence and machine learning fields within computer science. This book is intended for the researcher, practitioner, or engineer who is interested in the detailed treatment of separable programming and wants to take advantage of the latest theoretical and algorithmic results. It may also be used as a textbook for a special topics course or as a supplementary textbook for graduate courses on nonlinear and convex optimization.

OPERATIONS RESEARCH
OPERATIONS RESEARCH

Author: K. RAJAGOPAL

Publisher: PHI Learning Pvt. Ltd.

Published: 2012-07-07

Total Pages: 609

ISBN-13: 8120346343

DOWNLOAD EBOOK

This comprehensive book provides the students with the basic knowledge of the processes involved in operations research and discusses the techniques of solutions to problems and their applications in daily life. Beginning with an overview of the operations research models and decision-making, the book describes in detail the various optimization techniques such as linear and non-linear programming, integer linear programming, dynamic programming, genetic programming, and network techniques such as PERT (program evaluation review technique) and CPM (critical path method). It also explains the transportation and assignment problems, queuing theory, games theory, sequencing, replacement and capital investment decisions and inventory. Besides, the book discusses the Monte Carlo simulation techniques for solving queuing, demand forecasting, inventory and scheduling problems and elaborates on genetic algorithms. Each mathematical technique is dealt with in two parts. The first part explains the theory underlying the methodology of solution to problems. The second part illustrates how the theory is applied to solve different kinds of problems. This book is designed as a textbook for the undergraduate students of mechanical engineering, electrical engineering, production and industrial engineering, computer science and engineering and information technology. Besides, the book will also be useful to the postgraduate students of production and industrial engineering, computer applications, business administration, commerce, mathematics and statistics. KEY FEATURES : Includes a large number of solved problems to help students comprehend the concepts with ease. Gives step-by-step explanation of algorithms by taking problems. Provides chapter-end exercises to drill the students in self-study.

Optimization
Optimization

Author: Kyrie Mueller

Publisher: Scientific e-Resources

Published: 2019-10-05

Total Pages: 314

ISBN-13: 1839473274

DOWNLOAD EBOOK

Finite-dimensional optimization issues happen all through the numerical sciences. The greater part of these issues can't be explained systematically. This prologue to optimization endeavors to strike a harmony between introduction of scientific hypothesis and improvement of numerical calculations. Expanding on understudies' abilities in math and straight variable based math, the content gives a thorough piece without undue deliberation. Its weight on factual applications will be particularly speaking to graduate understudies of insights and biostatistics. The target group additionally incorporates understudies in connected arithmetic, computational science, software engineering, financial aspects, and material science who need to see thorough math joined with genuine applications. Applications are characterized by their principle useful regions in modern arranging, outline, and control. The fields secured are machine sequencing, stock control and planning, plant recharging, conveyance, money related issues, and compound process control and outline. These last two, specifically, are subjects frequently ignored in operations examine educational program. In each field the place and status of optimization methods is first portrayed and afterward an extensive variety of sensible contextual analyses and cases are looked into, a considerable lot of them universal.

Planning and Design of Engineering Systems
Planning and Design of Engineering Systems

Author: Graeme Dandy

Publisher: CRC Press

Published: 2018-04-17

Total Pages: 397

ISBN-13: 1351991299

DOWNLOAD EBOOK

Providing students with a commonsense approach to the solution of engineering problems and packed full of practical case studies to illustrate the role of the engineer, the type of work involved and the methodologies employed in engineering practice, this textbook is a comprehensive introduction to the scope and nature of engineering. It outlines a conceptual framework for undertaking engineering projects then provides a range of techniques and tools for solving the sorts of problems that commonly arise. Focusing in particular on civil engineering design, problem solving, and the range of techniques and tools it employs, the authors also explore: creativity and problem solving, social and environmental issues, management, communications and law, and ethics the planning, design, modelling and analysis phases and the implementation or construction phase. Designed specifically for introductory courses on undergraduate engineering programs, this extensively revised and extended second edition is an invaluable resource for all new engineering undergraduates as well as non-specialist readers who are seeking information on the nature of engineering work and how it is carried out.

Network Flows and Monotropic Optimization
Network Flows and Monotropic Optimization

Author: R. Tyrell Rockafellar

Publisher: Athena Scientific

Published: 1999-06-01

Total Pages: 632

ISBN-13: 188652906X

DOWNLOAD EBOOK

A rigorous and comprehensive treatment of network flow theory and monotropic optimization by one of the world's most renowned applied mathematicians. This classic textbook covers extensively the duality theory and the algorithms of linear and nonlinear network optimization optimization, and their significant extensions to monotropic programming (separable convex constrained optimization problems, including linear programs). It complements our other book on the subject of network optimization Network Optimization: Continuous and Discrete Models (Athena Scientific, 1998). Monotropic programming problems are characterized by a rich interplay between combinatorial structure and convexity properties. Rockafellar develops, for the first time, algorithms and a remarkably complete duality theory for these problems. Among its special features the book: (a) Treats in-depth the duality theory for linear and nonlinear network optimization (b) Uses a rigorous step-by-step approach to develop the principal network optimization algorithms (c) Covers the main algorithms for specialized network problems, such as max-flow, feasibility, assignment, and shortest path (d) Develops in detail the theory of monotropic programming, based on the author's highly acclaimed research (e) Contains many examples, illustrations, and exercises (f) Contains much new material not found in any other textbook

Integer Programming and Related Areas
Integer Programming and Related Areas

Author: C. Kastning

Publisher: Springer Science & Business Media

Published: 2013-11-11

Total Pages: 504

ISBN-13: 3662022842

DOWNLOAD EBOOK

Integer Prograw~ing is one of the most fascinating and difficult areas in the field of Mathematical Optimization. Due to this fact notable research contributions to Integer Programming have been made in very different branches of mathematics and its applications. Since these publications are scattered over many journals, proceedings volumes, monographs, and working papers, a comprehensive bibliography of all these sources is a helpful tool even for specialists in this field. I initiated this compilation of literature in 1970 at the Institut fur ~konometrie und Operations Research, University of Bonn. Since then many collaborators have contributed to and worked on it. Among them Dipl.-Math. Claus Kastning has done the bulk of the work. With great perseverance and diligence he has gathered all the material and checked it with the original sources. The main aim was to incorporate rare and not easily accessible sources like Russian journals, preprints or unpublished papers. Without the invaluable and dedicated engagement of Claus Kastning the bibliography would never have reached this final version. For this reason he must be considered its responsible editor. As with any other collection this literature list has a subjective viewpoint and may be in some sense incomplete. We have however tried to be as complete as possible. The bibliography contains 4704 different publications by 6767 authors which were classified by 11839 descriptor entries.