Author: Thomas L. Saaty
Publisher: RWS Publications
ISBN: 1888603372
Category : Business & Economics
Languages : en
Pages : 310
Book Description
This text, the first of its kind, surveys the entire field of optimization in integers. It is designed for students of mathematics, engineering, science, social science, and operations research. It will stimulate and excite the reader's interest in the elementary methods and ideas. of discrete optimization and related problems. The text presents the current theories and a wide variety of examples and applications of optimization in integers in both geometric end algebraic settings. Coverage is given to a wide class of problems and the ways in which they may be handled. The text includes numerous exercises and illustrations.
Optimization in integers and related extremal problems
Author: Thomas L. Saaty
Publisher: RWS Publications
ISBN: 1888603372
Category : Business & Economics
Languages : en
Pages : 310
Book Description
This text, the first of its kind, surveys the entire field of optimization in integers. It is designed for students of mathematics, engineering, science, social science, and operations research. It will stimulate and excite the reader's interest in the elementary methods and ideas. of discrete optimization and related problems. The text presents the current theories and a wide variety of examples and applications of optimization in integers in both geometric end algebraic settings. Coverage is given to a wide class of problems and the ways in which they may be handled. The text includes numerous exercises and illustrations.
Publisher: RWS Publications
ISBN: 1888603372
Category : Business & Economics
Languages : en
Pages : 310
Book Description
This text, the first of its kind, surveys the entire field of optimization in integers. It is designed for students of mathematics, engineering, science, social science, and operations research. It will stimulate and excite the reader's interest in the elementary methods and ideas. of discrete optimization and related problems. The text presents the current theories and a wide variety of examples and applications of optimization in integers in both geometric end algebraic settings. Coverage is given to a wide class of problems and the ways in which they may be handled. The text includes numerous exercises and illustrations.
Optimization in Integers and Related Extremal Problems
Author: Thomas L. Saaty
Publisher:
ISBN:
Category : Mathematical optimization
Languages : en
Pages : 295
Book Description
Publisher:
ISBN:
Category : Mathematical optimization
Languages : en
Pages : 295
Book Description
Optimization in Integers and Related Extremal Problems
Author: Thomas L. Saaty
Publisher:
ISBN:
Category : Mathematical optimization
Languages : en
Pages : 295
Book Description
Publisher:
ISBN:
Category : Mathematical optimization
Languages : en
Pages : 295
Book Description
Optimization in Integers and Related Extremal Problems [by] Thomas L. Sssty
Author: Thomas L. Saaty
Publisher:
ISBN:
Category : Mathematical optimization
Languages : en
Pages : 295
Book Description
Publisher:
ISBN:
Category : Mathematical optimization
Languages : en
Pages : 295
Book Description
Optimization in integers and related extremal problems : from a course given at the University of California, Los Angeles, and at the George Washington University
Author: Thomas L. Saaty
Publisher:
ISBN:
Category : Mathematical optimization
Languages : en
Pages : 295
Book Description
Publisher:
ISBN:
Category : Mathematical optimization
Languages : en
Pages : 295
Book Description
OPTIMIZATION IN INTEGERS AND RELATED EXTREMAL PROBLEMS : FROM A COURSE GIVEN AT THE UNIV. OF CALIFORNIA, LOS ANGELES, AND AT THE GEORGE WASHINGTON UNIV.
Large-scale Optimization
Author: Vladimir Tsurkov
Publisher: Springer Science & Business Media
ISBN: 9780792368175
Category : Computers
Languages : en
Pages : 328
Book Description
Decomposition methods aim to reduce large-scale problems to simpler problems. This monograph presents selected aspects of the dimension-reduction problem. Exact and approximate aggregations of multidimensional systems are developed and from a known model of input-output balance, aggregation methods are categorized. The issues of loss of accuracy, recovery of original variables (disaggregation), and compatibility conditions are analyzed in detail. The method of iterative aggregation in large-scale problems is studied. For fixed weights, successively simpler aggregated problems are solved and the convergence of their solution to that of the original problem is analyzed. An introduction to block integer programming is considered. Duality theory, which is widely used in continuous block programming, does not work for the integer problem. A survey of alternative methods is presented and special attention is given to combined methods of decomposition. Block problems in which the coupling variables do not enter the binding constraints are studied. These models are worthwhile because they permit a decomposition with respect to primal and dual variables by two-level algorithms instead of three-level algorithms. Audience: This book is addressed to specialists in operations research, optimization, and optimal control.
Publisher: Springer Science & Business Media
ISBN: 9780792368175
Category : Computers
Languages : en
Pages : 328
Book Description
Decomposition methods aim to reduce large-scale problems to simpler problems. This monograph presents selected aspects of the dimension-reduction problem. Exact and approximate aggregations of multidimensional systems are developed and from a known model of input-output balance, aggregation methods are categorized. The issues of loss of accuracy, recovery of original variables (disaggregation), and compatibility conditions are analyzed in detail. The method of iterative aggregation in large-scale problems is studied. For fixed weights, successively simpler aggregated problems are solved and the convergence of their solution to that of the original problem is analyzed. An introduction to block integer programming is considered. Duality theory, which is widely used in continuous block programming, does not work for the integer problem. A survey of alternative methods is presented and special attention is given to combined methods of decomposition. Block problems in which the coupling variables do not enter the binding constraints are studied. These models are worthwhile because they permit a decomposition with respect to primal and dual variables by two-level algorithms instead of three-level algorithms. Audience: This book is addressed to specialists in operations research, optimization, and optimal control.
Applied Integer Programming
Author: Der-San Chen
Publisher: John Wiley & Sons
ISBN: 1118210026
Category : Mathematics
Languages : en
Pages : 489
Book Description
An accessible treatment of the modeling and solution of integer programming problems, featuring modern applications and software In order to fully comprehend the algorithms associated with integer programming, it is important to understand not only how algorithms work, but also why they work. Applied Integer Programming features a unique emphasis on this point, focusing on problem modeling and solution using commercial software. Taking an application-oriented approach, this book addresses the art and science of mathematical modeling related to the mixed integer programming (MIP) framework and discusses the algorithms and associated practices that enable those models to be solved most efficiently. The book begins with coverage of successful applications, systematic modeling procedures, typical model types, transformation of non-MIP models, combinatorial optimization problem models, and automatic preprocessing to obtain a better formulation. Subsequent chapters present algebraic and geometric basic concepts of linear programming theory and network flows needed for understanding integer programming. Finally, the book concludes with classical and modern solution approaches as well as the key components for building an integrated software system capable of solving large-scale integer programming and combinatorial optimization problems. Throughout the book, the authors demonstrate essential concepts through numerous examples and figures. Each new concept or algorithm is accompanied by a numerical example, and, where applicable, graphics are used to draw together diverse problems or approaches into a unified whole. In addition, features of solution approaches found in today's commercial software are identified throughout the book. Thoroughly classroom-tested, Applied Integer Programming is an excellent book for integer programming courses at the upper-undergraduate and graduate levels. It also serves as a well-organized reference for professionals, software developers, and analysts who work in the fields of applied mathematics, computer science, operations research, management science, and engineering and use integer-programming techniques to model and solve real-world optimization problems.
Publisher: John Wiley & Sons
ISBN: 1118210026
Category : Mathematics
Languages : en
Pages : 489
Book Description
An accessible treatment of the modeling and solution of integer programming problems, featuring modern applications and software In order to fully comprehend the algorithms associated with integer programming, it is important to understand not only how algorithms work, but also why they work. Applied Integer Programming features a unique emphasis on this point, focusing on problem modeling and solution using commercial software. Taking an application-oriented approach, this book addresses the art and science of mathematical modeling related to the mixed integer programming (MIP) framework and discusses the algorithms and associated practices that enable those models to be solved most efficiently. The book begins with coverage of successful applications, systematic modeling procedures, typical model types, transformation of non-MIP models, combinatorial optimization problem models, and automatic preprocessing to obtain a better formulation. Subsequent chapters present algebraic and geometric basic concepts of linear programming theory and network flows needed for understanding integer programming. Finally, the book concludes with classical and modern solution approaches as well as the key components for building an integrated software system capable of solving large-scale integer programming and combinatorial optimization problems. Throughout the book, the authors demonstrate essential concepts through numerous examples and figures. Each new concept or algorithm is accompanied by a numerical example, and, where applicable, graphics are used to draw together diverse problems or approaches into a unified whole. In addition, features of solution approaches found in today's commercial software are identified throughout the book. Thoroughly classroom-tested, Applied Integer Programming is an excellent book for integer programming courses at the upper-undergraduate and graduate levels. It also serves as a well-organized reference for professionals, software developers, and analysts who work in the fields of applied mathematics, computer science, operations research, management science, and engineering and use integer-programming techniques to model and solve real-world optimization problems.
Nondifferentiable Optimization and Polynomial Problems
Author: N.Z. Shor
Publisher: Springer Science & Business Media
ISBN: 9780792349976
Category : Mathematics
Languages : en
Pages : 422
Book Description
Polynomial extremal problems (PEP) constitute one of the most important subclasses of nonlinear programming models. Their distinctive feature is that an objective function and constraints can be expressed by polynomial functions in one or several variables. Let :e = {:e 1, ... , :en} be the vector in n-dimensional real linear space Rn; n PO(:e), PI (:e), ... , Pm (:e) are polynomial functions in R with real coefficients. In general, a PEP can be formulated in the following form: (0.1) find r = inf Po(:e) subject to constraints (0.2) Pi (:e) =0, i=l, ... ,m (a constraint in the form of inequality can be written in the form of equality by introducing a new variable: for example, P( x) ~ 0 is equivalent to P(:e) + y2 = 0). Boolean and mixed polynomial problems can be written in usual form by adding for each boolean variable z the equality: Z2 - Z = O. Let a = {al, ... ,a } be integer vector with nonnegative entries {a;}f=l. n Denote by R[a](:e) monomial in n variables of the form: n R[a](:e) = IT :ef'; ;=1 d(a) = 2:7=1 ai is the total degree of monomial R[a]. Each polynomial in n variables can be written as sum of monomials with nonzero coefficients: P(:e) = L caR[a](:e), aEA{P) IX x Nondifferentiable optimization and polynomial problems where A(P) is the set of monomials contained in polynomial P.
Publisher: Springer Science & Business Media
ISBN: 9780792349976
Category : Mathematics
Languages : en
Pages : 422
Book Description
Polynomial extremal problems (PEP) constitute one of the most important subclasses of nonlinear programming models. Their distinctive feature is that an objective function and constraints can be expressed by polynomial functions in one or several variables. Let :e = {:e 1, ... , :en} be the vector in n-dimensional real linear space Rn; n PO(:e), PI (:e), ... , Pm (:e) are polynomial functions in R with real coefficients. In general, a PEP can be formulated in the following form: (0.1) find r = inf Po(:e) subject to constraints (0.2) Pi (:e) =0, i=l, ... ,m (a constraint in the form of inequality can be written in the form of equality by introducing a new variable: for example, P( x) ~ 0 is equivalent to P(:e) + y2 = 0). Boolean and mixed polynomial problems can be written in usual form by adding for each boolean variable z the equality: Z2 - Z = O. Let a = {al, ... ,a } be integer vector with nonnegative entries {a;}f=l. n Denote by R[a](:e) monomial in n variables of the form: n R[a](:e) = IT :ef'; ;=1 d(a) = 2:7=1 ai is the total degree of monomial R[a]. Each polynomial in n variables can be written as sum of monomials with nonzero coefficients: P(:e) = L caR[a](:e), aEA{P) IX x Nondifferentiable optimization and polynomial problems where A(P) is the set of monomials contained in polynomial P.
Dual-Feasible Functions for Integer Programming and Combinatorial Optimization
Author: Cláudio Alves
Publisher: Springer
ISBN: 3319276042
Category : Business & Economics
Languages : en
Pages : 166
Book Description
This book provides a postgraduate audience the keys they need to understand and further develop a set of tools for the efficient computation of lower bounds and valid inequalities in integer programs and combinatorial optimization problems. After discussing the classical approaches described in the literature, the book addresses how to extend these tools to other non-standard formulations that may be applied to a broad set of applications. Examples are provided to illustrate the underlying concepts and to pave the way for future contributions.
Publisher: Springer
ISBN: 3319276042
Category : Business & Economics
Languages : en
Pages : 166
Book Description
This book provides a postgraduate audience the keys they need to understand and further develop a set of tools for the efficient computation of lower bounds and valid inequalities in integer programs and combinatorial optimization problems. After discussing the classical approaches described in the literature, the book addresses how to extend these tools to other non-standard formulations that may be applied to a broad set of applications. Examples are provided to illustrate the underlying concepts and to pave the way for future contributions.