Muutke küpsiste eelistusi

E-raamat: Advances in Optimization and Linear Programming [Taylor & Francis e-raamat]

(Point Pleasant, New Jersey, USA)
  • Formaat: 194 pages, 5 Tables, black and white
  • Ilmumisaeg: 27-Jan-2022
  • Kirjastus: Apple Academic Press Inc.
  • ISBN-13: 9781003256052
  • Taylor & Francis e-raamat
  • Hind: 175,41 €*
  • * hind, mis tagab piiramatu üheaegsete kasutajate arvuga ligipääsu piiramatuks ajaks
  • Tavahind: 250,59 €
  • Säästad 30%
  • Formaat: 194 pages, 5 Tables, black and white
  • Ilmumisaeg: 27-Jan-2022
  • Kirjastus: Apple Academic Press Inc.
  • ISBN-13: 9781003256052
"This new volume provides the information needed to understand the simplex method, the revised simplex method, dual simplex method, and more for solving linear programming problems. Following a logical order, the book first gives a mathematical model of the linear problem programming and describes the usual assumptions under which the problem is solved. It gives a brief description of classic algorithms for solving linear programming problems as well as some theoretical results. It goes on to explain thedefinitions and solutions of linear programming problems, outlining the simplest geometric methods, and showing how they can be implemented. Practical examples are included along the way. The book concludes with a discussion of multi-criteria decision-making methods. This volume is a highly useful guide to linear programming for professors and students in optimization and linear programming"--

This new volume provides the information needed to understand the simplex method, the revised simplex method, dual simplex method, and more for solving linear programming problems.



This new volume provides the information needed to understand the simplex method, the revised simplex method, dual simplex method, and more for solving linear programming problems.
Following a logical order, the book first gives a mathematical model of the linear problem programming and describes the usual assumptions under which the problem is solved. It gives a brief description of classic algorithms for solving linear programming problems as well as some theoretical results. It goes on to explain the definitions and solutions of linear programming problems, outlining the simplest geometric methods and showing how they can be implemented. Practical examples are included along the way. The book concludes with a discussion of multi-criteria decision-making methods.
Advances in Optimization and Linear Programming
is a highly useful guide to linear programming for professors and students in optimization and linear programming.

About the Author v
Preface ix
1 Introduction
1(62)
1.1 Multiobjective Optimization
9(2)
1.2 Symbolic Transformations in Multi-Sector Optimization
11(3)
1.3 Pareto Optimality Test
14(3)
1.4 The Method of Weight Coefficients
17(16)
1.5 Mathematical Model
33(10)
1.6 Properties of a Set of Constraints
43(11)
1.7 Geometrical Method
54(9)
2 Simplex Method
63(100)
2.1 Properties of Simplex Methods
63(7)
2.2 The Algebraic Essence of the Simplex Method
70(6)
2.3 The Term Tucker's Tables and the Simplex Method for Basic Permissible Canonical Forms
76(3)
2.4 Algorithm of Simplex Method
79(22)
2.5 Determination of the Initial Basic Permissible Solution
101(2)
2.6 Two-Phase Simplex Methods
103(13)
2.6.1 A Two-Phase Simplex Method That Uses Artificial Variables
104(5)
2.6.2 Two-Phase Simplex Method Without Artificial Variables
109(7)
2.7 BigM Method
116(9)
2.8 Duality in Linear Programming
125(8)
2.9 Dual Simplex Method
133(6)
2.10 Elimination of Equations and Free Variables
139(5)
2.11 Revised Simplex Method
144(5)
2.12 Cycling Concept and Anti-Cyclic Rules
149(7)
2.13 Complexity of Simplex Methods and Minty-Klee Polyhedra
156(7)
3 Three Direct Methods in Linear Programming
163(20)
3.1 Basic Terms
164(2)
3.2 Minimum Angle Method
166(5)
3.3 Dependent Constraints and Application of Game Theory
171(5)
3.4 Algorithms and Implementation Details
176(1)
3.5 Direct Heuristic Algorithm with General Inverses
177(6)
Bibliography 183(8)
Index 191
Ivan Stanimirovi, PhD, is currently Associate Professor at the Department of Computer Science, Faculty of Sciences and Mathematics at the University of Ni, Serbia. He was formerly with the Faculty of Management at Megatrend University, Belgrade, as a lecturer. His work spans from multi-objective optimization methods to applications of generalized matrix inverses in areas such as image processing and restoration and computer graphics. His current research interests include computing generalized matrix inverses and their applications, applied multi-objective optimization and decision-making, as well as deep learning neural networks. Dr. Stanimirovi was the chairman of a workshop held at the 13th Serbian Mathematical Congress, Vrnjaèka Banja, Serbia, in 2014.