Michael Patriksson – författare

Revised with second printing, 2018.Optimization, or mathematical programming, is a fundamental subject within decision science and operations research in which mathematical decision models are constructed, analyzed, and solved.Andreasson provides a basis for the analysis of optimization models and candidate optimal solutions for continuous optimization models. Elementary but rigorous mathematics and linear algebra underlie the workings of convexity and duality, and necessary/sufficient local/global optimality conditions for continuous optimization problems. Natural algorithms are developed from these optimality conditions, and their most important convergence characteristics are analyzed. The author answers many more “Why?” and “Why not?” than “How?” questions.The author provides lecture, exercise and reading material for a first course on continuous optimization and mathematical programming. It is geared towards third-year students, and has already been used for nearly ten years. The preface describes the main changes to the first edition.The book can be used in mathematical optimization courses at engineering, economics, and business schools. It is a perfect starting point for anyone who wishes to develop an understanding of the subject before actually applying it.

This book collects selected presentations of the Meeting of the EURO Working Group on Transportation, which took place at the Department of Ma- ematics at Chalmers University of Technology, Göteborg (or, Gothenburg), Sweden, September 9–11, 1998. [The EURO Working Group on Transpor- tion was founded at the end of the 7th EURO Summer Institute on Urban Traffic Management, which took place in Cetraro, Italy, June 21–July, 1991. There were around 30 founding members of the Working Group, a number which now has grown to around 150. Meetings since then include Paris (1993), Barcelona (1994), and Newcastle (1996). ] About 100 participants were present, enjoying healthy rain and a memorable conference dinner in the Feskekôrka. The total number of presentations at the conference was about 60, coming from quite diverse areas within the field of operations research in transportation, and covering all modes of transport: Deterministic traffic equilibrium models (6 papers) Stochastic traffic equilibrium models (5 papers) Combined traffic models (3 papers) Dynamic traffic models (7 papers) Simulation models (4 papers) Origin–destination matrix estimation (2 papers) Urban public transport models (8 papers) Aircraft scheduling (1 paper) Ship routing (2 papers) Railway planning and scheduling (6 papers) Vehicle routing (3 papers) Traffic management (3 papers) Signal control models (3 papers) Transportation systems analysis (5 papers) ix x TRANSPORTATION PLANNING Among these papers, 14 were eventually selected to be included in this volume.

Since I started working in the area of nonlinear programming and, later on, variational inequality problems, I have frequently been surprised to find that many algorithms, however scattered in numerous journals, monographs and books, and described rather differently, are closely related to each other. This book is meant to help the reader understand and relate algorithms to each other in some intuitive fashion, and represents, in this respect, a consolidation of the field. The framework of algorithms presented in this book is called Cost Approxi­ mation. (The preface of the Ph.D. thesis [Pat93d] explains the background to the work that lead to the thesis, and ultimately to this book.) It describes, for a given formulation of a variational inequality or nonlinear programming problem, an algorithm by means of approximating mappings and problems, a principle for the update of the iteration points, and a merit function which guides and monitors the convergence of the algorithm. One purpose of this book is to offer this framework as an intuitively appeal­ ing tool for describing an algorithm. One of the advantages of the framework, or any reasonable framework for that matter, is that two algorithms may be easily related and compared through its use. This framework is particular in that it covers a vast number of methods, while still being fairly detailed; the level of abstraction is in fact the same as that of the original problem statement.

This book collects selected presentations of the Meeting of the EURO Working Group on Transportation, which took place at the Department of Ma- ematics at Chalmers University of Technology, Göteborg (or, Gothenburg), Sweden, September 9–11, 1998. [The EURO Working Group on Transpor- tion was founded at the end of the 7th EURO Summer Institute on Urban Traffic Management, which took place in Cetraro, Italy, June 21–July, 1991. There were around 30 founding members of the Working Group, a number which now has grown to around 150. Meetings since then include Paris (1993), Barcelona (1994), and Newcastle (1996). ] About 100 participants were present, enjoying healthy rain and a memorable conference dinner in the Feskekôrka. The total number of presentations at the conference was about 60, coming from quite diverse areas within the field of operations research in transportation, and covering all modes of transport: Deterministic traffic equilibrium models (6 papers) Stochastic traffic equilibrium models (5 papers) Combined traffic models (3 papers) Dynamic traffic models (7 papers) Simulation models (4 papers) Origin–destination matrix estimation (2 papers) Urban public transport models (8 papers) Aircraft scheduling (1 paper) Ship routing (2 papers) Railway planning and scheduling (6 papers) Vehicle routing (3 papers) Traffic management (3 papers) Signal control models (3 papers) Transportation systems analysis (5 papers) ix x TRANSPORTATION PLANNING Among these papers, 14 were eventually selected to be included in this volume.

Since I started working in the area of nonlinear programming and, later on, variational inequality problems, I have frequently been surprised to find that many algorithms, however scattered in numerous journals, monographs and books, and described rather differently, are closely related to each other. This book is meant to help the reader understand and relate algorithms to each other in some intuitive fashion, and represents, in this respect, a consolidation of the field. The framework of algorithms presented in this book is called Cost Approxi­ mation. (The preface of the Ph.D. thesis [Pat93d] explains the background to the work that lead to the thesis, and ultimately to this book.) It describes, for a given formulation of a variational inequality or nonlinear programming problem, an algorithm by means of approximating mappings and problems, a principle for the update of the iteration points, and a merit function which guides and monitors the convergence of the algorithm. One purpose of this book is to offer this framework as an intuitively appeal­ ing tool for describing an algorithm. One of the advantages of the framework, or any reasonable framework for that matter, is that two algorithms may be easily related and compared through its use. This framework is particular in that it covers a vast number of methods, while still being fairly detailed; the level of abstraction is in fact the same as that of the original problem statement.

This book collects selected presentations of the Meeting of the EURO Working Group on Transportation, which took place at the Department of Ma- ematics at Chalmers University of Technology, Göteborg (or, Gothenburg), Sweden, September 9–11, 1998. [The EURO Working Group on Transpor- tion was founded at the end of the 7th EURO Summer Institute on Urban Traffic Management, which took place in Cetraro, Italy, June 21–July, 1991. There were around 30 founding members of the Working Group, a number which now has grown to around 150. Meetings since then include Paris (1993), Barcelona (1994), and Newcastle (1996). ] About 100 participants were present, enjoying healthy rain and a memorable conference dinner in the Feskekôrka. The total number of presentations at the conference was about 60, coming from quite diverse areas within the field of operations research in transportation, and covering all modes of transport: Deterministic traffic equilibrium models (6 papers) Stochastic traffic equilibrium models (5 papers) Combined traffic models (3 papers) Dynamic traffic models (7 papers) Simulation models (4 papers) Origin–destination matrix estimation (2 papers) Urban public transport models (8 papers) Aircraft scheduling (1 paper) Ship routing (2 papers) Railway planning and scheduling (6 papers) Vehicle routing (3 papers) Traffic management (3 papers) Signal control models (3 papers) Transportation systems analysis (5 papers) ix x TRANSPORTATION PLANNING Among these papers, 14 were eventually selected to be included in this volume.