Author: Richard Kipp Martin
Publisher: Springer Science & Business Media
ISBN: 1461549752
Category : Business & Economics
Languages : en
Pages : 739
Book Description
This is a textbook about linear and integer linear optimization. There is a growing need in industries such as airline, trucking, and financial engineering to solve very large linear and integer linear optimization problems. Building these models requires uniquely trained individuals. Not only must they have a thorough understanding of the theory behind mathematical programming, they must have substantial knowledge of how to solve very large models in today's computing environment. The major goal of the book is to develop the theory of linear and integer linear optimization in a unified manner and then demonstrate how to use this theory in a modern computing environment to solve very large real world problems. After presenting introductory material in Part I, Part II of this book is de voted to the theory of linear and integer linear optimization. This theory is developed using two simple, but unifying ideas: projection and inverse projec tion. Through projection we take a system of linear inequalities and replace some of the variables with additional linear inequalities. Inverse projection, the dual of this process, involves replacing linear inequalities with additional variables. Fundamental results such as weak and strong duality, theorems of the alternative, complementary slackness, sensitivity analysis, finite basis the orems, etc. are all explained using projection or inverse projection. Indeed, a unique feature of this book is that these fundamental results are developed and explained before the simplex and interior point algorithms are presented.
Large Scale Linear and Integer Optimization: A Unified Approach
Author: Richard Kipp Martin
Publisher: Springer Science & Business Media
ISBN: 1461549752
Category : Business & Economics
Languages : en
Pages : 739
Book Description
This is a textbook about linear and integer linear optimization. There is a growing need in industries such as airline, trucking, and financial engineering to solve very large linear and integer linear optimization problems. Building these models requires uniquely trained individuals. Not only must they have a thorough understanding of the theory behind mathematical programming, they must have substantial knowledge of how to solve very large models in today's computing environment. The major goal of the book is to develop the theory of linear and integer linear optimization in a unified manner and then demonstrate how to use this theory in a modern computing environment to solve very large real world problems. After presenting introductory material in Part I, Part II of this book is de voted to the theory of linear and integer linear optimization. This theory is developed using two simple, but unifying ideas: projection and inverse projec tion. Through projection we take a system of linear inequalities and replace some of the variables with additional linear inequalities. Inverse projection, the dual of this process, involves replacing linear inequalities with additional variables. Fundamental results such as weak and strong duality, theorems of the alternative, complementary slackness, sensitivity analysis, finite basis the orems, etc. are all explained using projection or inverse projection. Indeed, a unique feature of this book is that these fundamental results are developed and explained before the simplex and interior point algorithms are presented.
Publisher: Springer Science & Business Media
ISBN: 1461549752
Category : Business & Economics
Languages : en
Pages : 739
Book Description
This is a textbook about linear and integer linear optimization. There is a growing need in industries such as airline, trucking, and financial engineering to solve very large linear and integer linear optimization problems. Building these models requires uniquely trained individuals. Not only must they have a thorough understanding of the theory behind mathematical programming, they must have substantial knowledge of how to solve very large models in today's computing environment. The major goal of the book is to develop the theory of linear and integer linear optimization in a unified manner and then demonstrate how to use this theory in a modern computing environment to solve very large real world problems. After presenting introductory material in Part I, Part II of this book is de voted to the theory of linear and integer linear optimization. This theory is developed using two simple, but unifying ideas: projection and inverse projec tion. Through projection we take a system of linear inequalities and replace some of the variables with additional linear inequalities. Inverse projection, the dual of this process, involves replacing linear inequalities with additional variables. Fundamental results such as weak and strong duality, theorems of the alternative, complementary slackness, sensitivity analysis, finite basis the orems, etc. are all explained using projection or inverse projection. Indeed, a unique feature of this book is that these fundamental results are developed and explained before the simplex and interior point algorithms are presented.
Linear and Integer Optimization
Author: Gerard Sierksma
Publisher: CRC Press
ISBN: 1498743129
Category : Business & Economics
Languages : en
Pages : 676
Book Description
Presenting a strong and clear relationship between theory and practice, Linear and Integer Optimization: Theory and Practice is divided into two main parts. The first covers the theory of linear and integer optimization, including both basic and advanced topics. Dantzig's simplex algorithm, duality, sensitivity analysis, integer optimization models
Publisher: CRC Press
ISBN: 1498743129
Category : Business & Economics
Languages : en
Pages : 676
Book Description
Presenting a strong and clear relationship between theory and practice, Linear and Integer Optimization: Theory and Practice is divided into two main parts. The first covers the theory of linear and integer optimization, including both basic and advanced topics. Dantzig's simplex algorithm, duality, sensitivity analysis, integer optimization models
Theory of Linear and Integer Programming
Author: Alexander Schrijver
Publisher: John Wiley & Sons
ISBN: 9780471982326
Category : Mathematics
Languages : en
Pages : 488
Book Description
Theory of Linear and Integer Programming Alexander Schrijver Centrum voor Wiskunde en Informatica, Amsterdam, The Netherlands This book describes the theory of linear and integer programming and surveys the algorithms for linear and integer programming problems, focusing on complexity analysis. It aims at complementing the more practically oriented books in this field. A special feature is the author's coverage of important recent developments in linear and integer programming. Applications to combinatorial optimization are given, and the author also includes extensive historical surveys and bibliographies. The book is intended for graduate students and researchers in operations research, mathematics and computer science. It will also be of interest to mathematical historians. Contents 1 Introduction and preliminaries; 2 Problems, algorithms, and complexity; 3 Linear algebra and complexity; 4 Theory of lattices and linear diophantine equations; 5 Algorithms for linear diophantine equations; 6 Diophantine approximation and basis reduction; 7 Fundamental concepts and results on polyhedra, linear inequalities, and linear programming; 8 The structure of polyhedra; 9 Polarity, and blocking and anti-blocking polyhedra; 10 Sizes and the theoretical complexity of linear inequalities and linear programming; 11 The simplex method; 12 Primal-dual, elimination, and relaxation methods; 13 Khachiyan's method for linear programming; 14 The ellipsoid method for polyhedra more generally; 15 Further polynomiality results in linear programming; 16 Introduction to integer linear programming; 17 Estimates in integer linear programming; 18 The complexity of integer linear programming; 19 Totally unimodular matrices: fundamental properties and examples; 20 Recognizing total unimodularity; 21 Further theory related to total unimodularity; 22 Integral polyhedra and total dual integrality; 23 Cutting planes; 24 Further methods in integer linear programming; Historical and further notes on integer linear programming; References; Notation index; Author index; Subject index
Publisher: John Wiley & Sons
ISBN: 9780471982326
Category : Mathematics
Languages : en
Pages : 488
Book Description
Theory of Linear and Integer Programming Alexander Schrijver Centrum voor Wiskunde en Informatica, Amsterdam, The Netherlands This book describes the theory of linear and integer programming and surveys the algorithms for linear and integer programming problems, focusing on complexity analysis. It aims at complementing the more practically oriented books in this field. A special feature is the author's coverage of important recent developments in linear and integer programming. Applications to combinatorial optimization are given, and the author also includes extensive historical surveys and bibliographies. The book is intended for graduate students and researchers in operations research, mathematics and computer science. It will also be of interest to mathematical historians. Contents 1 Introduction and preliminaries; 2 Problems, algorithms, and complexity; 3 Linear algebra and complexity; 4 Theory of lattices and linear diophantine equations; 5 Algorithms for linear diophantine equations; 6 Diophantine approximation and basis reduction; 7 Fundamental concepts and results on polyhedra, linear inequalities, and linear programming; 8 The structure of polyhedra; 9 Polarity, and blocking and anti-blocking polyhedra; 10 Sizes and the theoretical complexity of linear inequalities and linear programming; 11 The simplex method; 12 Primal-dual, elimination, and relaxation methods; 13 Khachiyan's method for linear programming; 14 The ellipsoid method for polyhedra more generally; 15 Further polynomiality results in linear programming; 16 Introduction to integer linear programming; 17 Estimates in integer linear programming; 18 The complexity of integer linear programming; 19 Totally unimodular matrices: fundamental properties and examples; 20 Recognizing total unimodularity; 21 Further theory related to total unimodularity; 22 Integral polyhedra and total dual integrality; 23 Cutting planes; 24 Further methods in integer linear programming; Historical and further notes on integer linear programming; References; Notation index; Author index; Subject index
Linear and Integer Programming
Author: Gerard Sierksma
Publisher: CRC Press
ISBN:
Category : Business & Economics
Languages : en
Pages : 704
Book Description
This unique reference/text details the theoretical and practical aspects of linear and integer programming - covering a wide range of subjects, including duality, optimality criteria, sensitivity analysis, and numerous solution techniques for linear programming problems. Requiring only an elementary knowledge of set theory, trigonometry, and calculus, Linear and Integer Programming reflects both the problem-analyzing and problem-solving abilities of linear and integer programming ... presents the more rigorous mathematical material in such a way that it can be easily skipped without disturbing the readability of the text ... contains important pedagogical features such as a user-friendly, IBM-compatible computer software package for solving linear-programming problems, numerous case studies, fully worked examples, helpful end-of-chapter exercises, the answers to selected problems, key literature citations, and over 1375 equations, drawings, and tables ... and more. Linear and Integer programming is a fundamental reference for applied mathematicians, operations researchers, computer scientists, economists, and industrial engineers, as well as an ideal text for upper-level undergraduate and graduate students in this disciplines.
Publisher: CRC Press
ISBN:
Category : Business & Economics
Languages : en
Pages : 704
Book Description
This unique reference/text details the theoretical and practical aspects of linear and integer programming - covering a wide range of subjects, including duality, optimality criteria, sensitivity analysis, and numerous solution techniques for linear programming problems. Requiring only an elementary knowledge of set theory, trigonometry, and calculus, Linear and Integer Programming reflects both the problem-analyzing and problem-solving abilities of linear and integer programming ... presents the more rigorous mathematical material in such a way that it can be easily skipped without disturbing the readability of the text ... contains important pedagogical features such as a user-friendly, IBM-compatible computer software package for solving linear-programming problems, numerous case studies, fully worked examples, helpful end-of-chapter exercises, the answers to selected problems, key literature citations, and over 1375 equations, drawings, and tables ... and more. Linear and Integer programming is a fundamental reference for applied mathematicians, operations researchers, computer scientists, economists, and industrial engineers, as well as an ideal text for upper-level undergraduate and graduate students in this disciplines.
Linear and Mixed Integer Programming for Portfolio Optimization
Author: Renata Mansini
Publisher: Springer
ISBN: 3319184822
Category : Business & Economics
Languages : en
Pages : 131
Book Description
This book presents solutions to the general problem of single period portfolio optimization. It introduces different linear models, arising from different performance measures, and the mixed integer linear models resulting from the introduction of real features. Other linear models, such as models for portfolio rebalancing and index tracking, are also covered. The book discusses computational issues and provides a theoretical framework, including the concepts of risk-averse preferences, stochastic dominance and coherent risk measures. The material is presented in a style that requires no background in finance or in portfolio optimization; some experience in linear and mixed integer models, however, is required. The book is thoroughly didactic, supplementing the concepts with comments and illustrative examples.
Publisher: Springer
ISBN: 3319184822
Category : Business & Economics
Languages : en
Pages : 131
Book Description
This book presents solutions to the general problem of single period portfolio optimization. It introduces different linear models, arising from different performance measures, and the mixed integer linear models resulting from the introduction of real features. Other linear models, such as models for portfolio rebalancing and index tracking, are also covered. The book discusses computational issues and provides a theoretical framework, including the concepts of risk-averse preferences, stochastic dominance and coherent risk measures. The material is presented in a style that requires no background in finance or in portfolio optimization; some experience in linear and mixed integer models, however, is required. The book is thoroughly didactic, supplementing the concepts with comments and illustrative examples.
Integer Programming
Author: Michele Conforti
Publisher: Springer
ISBN: 331911008X
Category : Business & Economics
Languages : en
Pages : 466
Book Description
This book is an elegant and rigorous presentation of integer programming, exposing the subject’s mathematical depth and broad applicability. Special attention is given to the theory behind the algorithms used in state-of-the-art solvers. An abundance of concrete examples and exercises of both theoretical and real-world interest explore the wide range of applications and ramifications of the theory. Each chapter is accompanied by an expertly informed guide to the literature and special topics, rounding out the reader’s understanding and serving as a gateway to deeper study. Key topics include: formulations polyhedral theory cutting planes decomposition enumeration semidefinite relaxations Written by renowned experts in integer programming and combinatorial optimization, Integer Programming is destined to become an essential text in the field.
Publisher: Springer
ISBN: 331911008X
Category : Business & Economics
Languages : en
Pages : 466
Book Description
This book is an elegant and rigorous presentation of integer programming, exposing the subject’s mathematical depth and broad applicability. Special attention is given to the theory behind the algorithms used in state-of-the-art solvers. An abundance of concrete examples and exercises of both theoretical and real-world interest explore the wide range of applications and ramifications of the theory. Each chapter is accompanied by an expertly informed guide to the literature and special topics, rounding out the reader’s understanding and serving as a gateway to deeper study. Key topics include: formulations polyhedral theory cutting planes decomposition enumeration semidefinite relaxations Written by renowned experts in integer programming and combinatorial optimization, Integer Programming is destined to become an essential text in the field.
Integer and Combinatorial Optimization
Author: Laurence A. Wolsey
Publisher: John Wiley & Sons
ISBN: 1118626869
Category : Mathematics
Languages : en
Pages : 782
Book Description
Rave reviews for INTEGER AND COMBINATORIAL OPTIMIZATION "This book provides an excellent introduction and survey of traditional fields of combinatorial optimization . . . It is indeed one of the best and most complete texts on combinatorial optimization . . . available. [And] with more than 700 entries, [it] has quite an exhaustive reference list."-Optima "A unifying approach to optimization problems is to formulate them like linear programming problems, while restricting some or all of the variables to the integers. This book is an encyclopedic resource for such formulations, as well as for understanding the structure of and solving the resulting integer programming problems."-Computing Reviews "[This book] can serve as a basis for various graduate courses on discrete optimization as well as a reference book for researchers and practitioners."-Mathematical Reviews "This comprehensive and wide-ranging book will undoubtedly become a standard reference book for all those in the field of combinatorial optimization."-Bulletin of the London Mathematical Society "This text should be required reading for anybody who intends to do research in this area or even just to keep abreast of developments."-Times Higher Education Supplement, London Also of interest . . . INTEGER PROGRAMMING Laurence A. Wolsey Comprehensive and self-contained, this intermediate-level guide to integer programming provides readers with clear, up-to-date explanations on why some problems are difficult to solve, how techniques can be reformulated to give better results, and how mixed integer programming systems can be used more effectively. 1998 (0-471-28366-5) 260 pp.
Publisher: John Wiley & Sons
ISBN: 1118626869
Category : Mathematics
Languages : en
Pages : 782
Book Description
Rave reviews for INTEGER AND COMBINATORIAL OPTIMIZATION "This book provides an excellent introduction and survey of traditional fields of combinatorial optimization . . . It is indeed one of the best and most complete texts on combinatorial optimization . . . available. [And] with more than 700 entries, [it] has quite an exhaustive reference list."-Optima "A unifying approach to optimization problems is to formulate them like linear programming problems, while restricting some or all of the variables to the integers. This book is an encyclopedic resource for such formulations, as well as for understanding the structure of and solving the resulting integer programming problems."-Computing Reviews "[This book] can serve as a basis for various graduate courses on discrete optimization as well as a reference book for researchers and practitioners."-Mathematical Reviews "This comprehensive and wide-ranging book will undoubtedly become a standard reference book for all those in the field of combinatorial optimization."-Bulletin of the London Mathematical Society "This text should be required reading for anybody who intends to do research in this area or even just to keep abreast of developments."-Times Higher Education Supplement, London Also of interest . . . INTEGER PROGRAMMING Laurence A. Wolsey Comprehensive and self-contained, this intermediate-level guide to integer programming provides readers with clear, up-to-date explanations on why some problems are difficult to solve, how techniques can be reformulated to give better results, and how mixed integer programming systems can be used more effectively. 1998 (0-471-28366-5) 260 pp.
Integer Linear Programming in Computational and Systems Biology
Author: Dan Gusfield
Publisher: Cambridge University Press
ISBN: 1108421768
Category : Computers
Languages : en
Pages : 431
Book Description
This hands-on tutorial text for non-experts demonstrates biological applications of a versatile modeling and optimization technique.
Publisher: Cambridge University Press
ISBN: 1108421768
Category : Computers
Languages : en
Pages : 431
Book Description
This hands-on tutorial text for non-experts demonstrates biological applications of a versatile modeling and optimization technique.
Combinatorial, Linear, Integer and Nonlinear Optimization Apps
Author: J. MacGregor Smith
Publisher: Springer Nature
ISBN: 303075801X
Category : Mathematics
Languages : en
Pages : 275
Book Description
This textbook provides an introduction to the use and understanding of optimization and modeling for upper-level undergraduate students in engineering and mathematics. The formulation of optimization problems is founded through concepts and techniques from operations research: Combinatorial Optimization, Linear Programming, and Integer and Nonlinear Programming (COLIN). Computer Science (CS) is also relevant and important given the applications of algorithms and Apps/algorithms (A) in solving optimization problems. Each chapter provides an overview of the main concepts of optimization according to COLINA, providing examples through App Inventor and AMPL software applications. All apps developed through the text are available for download. Additionally, the text includes links to the University of Wisconsin NEOS server, designed to handle more computing-intensive problems in complex optimization. Readers are encouraged to have some background in calculus, linear algebra, and related mathematics.
Publisher: Springer Nature
ISBN: 303075801X
Category : Mathematics
Languages : en
Pages : 275
Book Description
This textbook provides an introduction to the use and understanding of optimization and modeling for upper-level undergraduate students in engineering and mathematics. The formulation of optimization problems is founded through concepts and techniques from operations research: Combinatorial Optimization, Linear Programming, and Integer and Nonlinear Programming (COLIN). Computer Science (CS) is also relevant and important given the applications of algorithms and Apps/algorithms (A) in solving optimization problems. Each chapter provides an overview of the main concepts of optimization according to COLINA, providing examples through App Inventor and AMPL software applications. All apps developed through the text are available for download. Additionally, the text includes links to the University of Wisconsin NEOS server, designed to handle more computing-intensive problems in complex optimization. Readers are encouraged to have some background in calculus, linear algebra, and related mathematics.
Linear and Integer Programming Made Easy
Author: T. C. Hu
Publisher: Springer
ISBN: 3319240013
Category : Technology & Engineering
Languages : en
Pages : 151
Book Description
This textbook provides concise coverage of the basics of linear and integer programming which, with megatrends toward optimization, machine learning, big data, etc., are becoming fundamental toolkits for data and information science and technology. The authors’ approach is accessible to students from almost all fields of engineering, including operations research, statistics, machine learning, control system design, scheduling, formal verification and computer vision. The presentations enables the basis for numerous approaches to solving hard combinatorial optimization problems through randomization and approximation. Readers will learn to cast various problems that may arise in their research as optimization problems, understand the cases where the optimization problem will be linear, choose appropriate solution methods and interpret results appropriately.
Publisher: Springer
ISBN: 3319240013
Category : Technology & Engineering
Languages : en
Pages : 151
Book Description
This textbook provides concise coverage of the basics of linear and integer programming which, with megatrends toward optimization, machine learning, big data, etc., are becoming fundamental toolkits for data and information science and technology. The authors’ approach is accessible to students from almost all fields of engineering, including operations research, statistics, machine learning, control system design, scheduling, formal verification and computer vision. The presentations enables the basis for numerous approaches to solving hard combinatorial optimization problems through randomization and approximation. Readers will learn to cast various problems that may arise in their research as optimization problems, understand the cases where the optimization problem will be linear, choose appropriate solution methods and interpret results appropriately.