Various imperfections in existing market systems prevent the free market from serving as a truly efficient allocation mechanism, but optimization of economic activities provides an effective remedial measure. Cooperative optimization claims that socially optimal and individually rational solutions to decision problems involving strategic action over time exist. To ensure that cooperation will last throughout the agreement period, however, the stringent condition of subgame consistency is required.

This textbook presents a study of subgame consistent economic optimization, developing game-theoretic optimization techniques to establish the foundation for an effective policy menu to tackle the suboptimal behavior that the conventional market mechanism fails to resolve.

Column Generation is an insightful overview of the state-of-the-art in integer programming column generation and its many applications. The volume begins with "A Primer in Column Generation" which outlines the theory and ideas necessary to solve large-scale practical problems, illustrated with a variety of examples. Other chapters follow this introduction on "Shortest Path Problems with Resource Constraints," "Vehicle Routing Problem with Time Window," "Branch-and-Price Heuristics," "Cutting Stock Problems," each dealing with methodological aspects of the field. Three chapters deal with transportation applications: "Large-scale Models in the Airline Industry," "Robust Inventory Ship Routing by Column Generation," and "Ship Scheduling with Recurring Visits and Visit Separation Requirements." Production is the focus of another three chapters: "Combining Column Generation and Lagrangian Relaxation," "Dantzig-Wolfe Decomposition for Job Shop Scheduling," and "Applying Column Generation to Machine Scheduling." The final chapter by FranAois Vanderbeck, "Implementing Mixed Integer Column Generation," reviews how to set-up the Dantzig-Wolfe reformulation, adapt standard MIP techniques to the column generation context (branching, preprocessing, primal heuristics), and deal with specific column generation issues (initialization, stabilization, column management strategies).

The book is the first systematic treatment of column generation methodologies. It will provide students, researchers, and experienced column generation users with a much-needed state-of-the-art survey of the field.

This book introduces several topics related to linear model theory: multivariate linear models, discriminant analysis, principal components, factor analysis, time series in both the frequency and time domains, and spatial data analysis. The second edition adds new material on nonparametric regression, response surface maximization, and longitudinal models. The book provides a unified approach to these disparate subject and serves as a self-contained companion volume to the author's Plane Answers to Complex Questions: The Theory of Linear Models. Ronald Christensen is Professor of Statistics at the University of New Mexico. He is well known for his work on the theory and application of linear models having linear structure. He is the author of numerous technical articles and several books and he is a Fellow of the American Statistical Association and the Institute of Mathematical Statistics. Also Available: Christensen, Ronald. Plane Answers to Complex Questions: The Theory of Linear Models, Second Edition (1996). New York: Springer-Verlag New York, Inc. Christensen, Ronald. Log-Linear Models and Logistic Regression, Second Edition (1997). New York: Springer-Verlag New York, Inc.

Metaheuristics: Progress as Real Problem Solvers is a peer-reviewed volume of eighteen current, cutting-edge papers by leading researchers in the field. Included are an invited paper by F. Glover and G. Kochenberger, which discusses the concept of Metaheuristic agent processes, and a tutorial paper by M.G.C. Resende and C.C. Ribeiro discussing GRASP with path-relinking. Other papers discuss problem-solving approaches to timetabling, automated planograms, elevators, space allocation, shift design, cutting stock, flexible shop scheduling, colorectal cancer and cartography. A final group of methodology papers clarify various aspects of Metaheuristics from the computational view point.

Optimization is an essential tool in every project in every large-scale organization, whether in business, industry, engineering, and science. In recent years, algorithmic advances and software and hardware improvements have given managers a powerful framework for making key decisions about everything from production planning to scheduling distribution.

This comprehensive resource brings together in one volume the major advances in the field. Distinguished contributors focus on the algorithmic and computational aspects of optimization, particularly the most recent methods for solving a wide range of decision-making problems. The book is divided into three main sections: algorithms, covering every type of programming; applications, where computational tools are put to work solving tasks in planning, production, distribution, scheduling and other decisions in project management; and software, a comprehensive introduction to languages and systems. Designed as a practical resource for proprammers and project planners and managers, it covers optimization problems in a wide range of settings, from the airline and aerospace industries to telecommunications, finance, health systems, biomedicine, and engineering.

Supply Chain Optimization captures the latest results in a segment of current research activity in supply chain management. This research area focuses on applying optimization techniques to supply chain management problems. The research papers that make up the volume provide a snapshot of state-of-the-art optimization methods within the field. This book presents rigorous modelling approaches for supply chain operations problems with a goal of improving supply chain performance (or the performance of some segment thereof). It contains high-quality works from leading researchers in the field whose expertise fits within this scope. The book provides a diverse blend of research topics and novel modelling and solution approaches for difficult classes of supply chain operations, planning, and design problems.

The era of interior point methods (IPMs) was initiated by N. Karmarkar's 1984 paper, which triggered turbulent research and reshaped almost all areas of optimization theory and computational practice. This book offers comprehensive coverage of IPMs. It details the main results of more than a decade of IPM research. Numerous exercises are provided to aid in understanding the material.

This book focuses on various aspects of dynamic game theory, presenting state-of-the-art research and serving as a testament to the vitality and growth of the field of dynamic games and their applications. Its contributions, written by experts in their respective disciplines, are outgrowths of presentations originally given at the 14th International Symposium of Dynamic Games and Applications held in Banff.

"Advances in Dynamic Games" covers a variety of topics, ranging from evolutionary games, theoretical developments in game theory and algorithmic methods to applications, examples, and analysis in fields as varied as mathematical biology, environmental management, finance and economics, engineering, guidance and control, and social interaction. Featured throughout are valuable tools and resources for researchers, practitioners, and graduate students interested in dynamic games and their applications to mathematics, engineering, economics, and management science. "

New Approaches to Circle Packing into the Square is devoted to the most recent results on the densest packing of equal circles in a square. In the last few decades, many articles have considered this question, which has been an object of interest since it is a hard challenge both in discrete geometry and in mathematical programming. The authors have studied this geometrical optimization problem for a long time, and they developed several new algorithms to solve it. The book completely covers the investigations on this topic.

Structural Optimization is intended to supplement the engineer s box of analysis and design tools making optimization as commonplace as the finite element method in the engineering workplace. It begins with an introduction to structural optimization and the methods of nonlinear programming such as Lagrange multipliers, Kuhn-Tucker conditions, and calculus of variations. It then discusses solution methods for optimization problems such as the classic method of linear programming which leads to the method of sequential linear programming. It then proposes using sequential linear programming together with the incremental equations of structures as a general method for structural optimization. It is furthermore intended to give the engineer an overview of the field of structural optimization."

This chapter is organized as follows. The economic problem on which this book focuses is motivated in Section 1. The two tools used to study this economic problem, which are real options theory and game theory, are discussed in Sections 2 and 3, respectively. Section 4 surveys the contents of this book. In Section 5 some promising extensions of the research presented in this book are listed. 1. TECHNOLOGY INVESTMENT Investment expenditures of companies govern economic growth. Es pecially investments in new and more efficient technologies are an impor tant determinant. In particular, in the last two decades an increasing part of the investment expenditures concerns investments in informa tion and communication technology. Kriebel, 1989 notes that (already) in 1989 roughly 50 percent of new corporate capital expenditures by major United States companies was in information and communication technology. Due to the rapid progress in these technologies, the tech nology investment decision of the individual firm has become a very complex matter. As an example of the very high pace of technological improvement consider the market for personal computers. IBM intro duced its Pentium personal computers in the early 1990s at the same price at which it introduced its 80286 personal computers in the 1980s. Therefore it took less than a decade to improve on the order of twenty times in terms of both speed and memory capacities, without increasing the cost (Yorukoglu, 1998)."

This book presents two natural generalizations of continuous mappings, namely usco and quasicontinuous mappings. The first class considers set-valued mappings, the second class relaxes the definition of continuity. Both these topological concepts stem naturally from basic mathematical considerations and have numerous applications that are covered in detail.

Everything should be made as simple as possible, but not simpler. (Albert Einstein, Readers Digest, 1977) The modern practice of creating technical systems and technological processes of high effi.ciency besides the employment of new principles, new materials, new physical effects and other new solutions ( which is very traditional and plays the key role in the selection of the general structure of the object to be designed) also includes the choice of the best combination for the set of parameters (geometrical sizes, electrical and strength characteristics, etc.) concretizing this general structure, because the Variation of these parameters ( with the structure or linkage being already set defined) can essentially affect the objective performance indexes. The mathematical tools for choosing these best combinations are exactly what is this book about. With the advent of computers and the computer-aided design the pro bations of the selected variants are usually performed not for the real examples ( this may require some very expensive building of sample op tions and of the special installations to test them ), but by the analysis of the corresponding mathematical models. The sophistication of the mathematical models for the objects to be designed, which is the natu ral consequence of the raising complexity of these objects, greatly com plicates the objective performance analysis. Today, the main (and very often the only) available instrument for such an analysis is computer aided simulation of an object's behavior, based on numerical experiments with its mathematical model."

Extending the well-known connection between classical linear potential theory and probability theory (through the interplay between harmonic functions and martingales) to the nonlinear case of tug-of-war games and their related partial differential equations, this unique book collects several results in this direction and puts them in an elementary perspective in a lucid and self-contained fashion.

Researchers working with nonlinear programming often claim "the word is non linear" indicating that real applications require nonlinear modeling. The same is true for other areas such as multi-objective programming (there are always several goals in a real application), stochastic programming (all data is uncer tain and therefore stochastic models should be used), and so forth. In this spirit we claim: The word is multilevel. In many decision processes there is a hierarchy of decision makers, and decisions are made at different levels in this hierarchy. One way to handle such hierar chies is to focus on one level and include other levels' behaviors as assumptions. Multilevel programming is the research area that focuses on the whole hierar chy structure. In terms of modeling, the constraint domain associated with a multilevel programming problem is implicitly determined by a series of opti mization problems which must be solved in a predetermined sequence. If only two levels are considered, we have one leader (associated with the upper level) and one follower (associated with the lower level)."

This monograph presents a collection of results, observations, and examples related to dynamical systems described by linear and nonlinear ordinary differential and difference equations. In particular, dynamical systems that are susceptible to analysis by the Liapunov approach are considered. The naive observation that certain "diagonal-type" Liapunov functions are ubiquitous in the literature attracted the attention of the authors and led to some natural questions. Why does this happen so often? What are the spe cial virtues of these functions in this context? Do they occur so frequently merely because they belong to the simplest class of Liapunov functions and are thus more convenient, or are there any more specific reasons? This monograph constitutes the authors' synthesis of the work on this subject that has been jointly developed by them, among others, producing and compiling results, properties, and examples for many years, aiming to answer these questions and also to formalize some of the folklore or "cul ture" that has grown around diagonal stability and diagonal-type Liapunov functions. A natural answer to these questions would be that the use of diagonal type Liapunov functions is frequent because of their simplicity within the class of all possible Liapunov functions. This monograph shows that, although this obvious interpretation is often adequate, there are many in stances in which the Liapunov approach is best taken advantage of using diagonal-type Liapunov functions. In fact, they yield necessary and suffi cient stability conditions for some classes of nonlinear dynamical systems."

Wim van der Linden was just given a lifetime achievement award by the National Council on Measurement in Education. There is no one more prominent in the area of educational testing.

There are hundreds of computer-based credentialing exams in areas such as accounting, real estate, nursing, and securities, as well as the well-known admissions exams for college, graduate school, medical school, and law school - there is great need on the theory of testing.

This book presents the statistical theory and practice behind constructing good tests e.g., how is the first test item selected, how are the next items selected, and when do you have enough items.

On August 1997 a conference titled "From Local to Global Optimiza- tion" was held at Storgarden in Rimfor.sa near the Linkoping Institute of Technology, Sweden. The conference gave us the opportunity to cel- ebrate Hoang Thy's achievements in Optimization during his 70 years of life. This book consists of a collection of research papers based on results presented during the conference and are dedicated to Professor Hoang Thy on the occasion of his 70th birthday. The papers cover a wide range of recent results in Mathematical Pro- gramming. The work of Hoang Thy, in particular in Global Optimiza- tion, has provided directions for new algorithmic developments in the field. We are indebted to the Kluwer Academic Publishers for inviting us to publish this volume, and the Center for Industrial Information Transfer (CENIIT) for financial support. We wish to thank the referees for their help and the authors for their papers. We also wish to join all contributors of this book in expressing birthday wishes and gratitude to Hoang Thy for his inspiration, support, and friendship to all of us. Athanasios Migdalas, Panos M. Pardalos, and Peter Varbrand November 1998 xv Hoang Tuy: An Appreciation Its a pleasure for me as colleague and friend to take this opportunity to celebrate Hoang 'I\lY'S numerous contributions to the field of mathemat- ical programming.

'Optimization Day' (OD) has been a series of annual mini-conferences in Aus tralia since 1994. The purpose of this series of events is to gather researchers in optimization and its related areas from Australia and their collaborators, in order to exchange new developments of optimization theories, methods and their applications. The first four OD mini-conferences were held in The Uni versity of Ballarat (1994), The University of New South Wales (1995), The University of Melbourne (1996) and Royal Melbourne Institute of Technology (1997), respectively. They were all on the eastern coast of Australia. The fifth mini-conference Optimization Days was held at the Centre for Ap plied Dynamics and Optimization (CADO), Department of Mathematics and Statistics, The University of Western Australia, Perth, from 29 to 30 June 1998. This is the first time the OD mini-conference has been held at the west ern coast of Australia. This fifth OD preceded the International Conference on Optimization: Techniques and Applications (ICOTA) held at Curtin Uni versity of Technology. Many participants attended both events. There were 28 participants in this year's mini-conference and 22 presentations in the mini conference. The presentations in this volume are refereed contributions based on papers presented at the fifth Optimization Days mini-conference. The volume is di vided into the following parts: Global Optimization, Nonsmooth Optimization, Optimization Methods and Applications."

Optimization is a rich and thriving mathematical discipline. The theory underlying current computational optimization techniques grows ever more sophisticated. The powerful and elegant language of convex analysis unifies much of this theory. The aim of this book is to provide a concise, accessible account of convex analysis and its applications and extensions, for a broad audience. It can serve as a teaching text, at roughly the level of first year graduate students. While the main body of the text is self-contained, each section concludes with an often extensive set of optional exercises. The new edition adds material on semismooth optimization, as well as several new proofs that will make this book even more self-contained.

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.

Strategic Interaction and Markets explores the theoretical richness of economic contexts such as product differentiation, strategic barriers to entry, and imperfect information, where economic agents act strategically taking into account the impact of their behaviour on competitors' behaviour and prices. This non-ideal form of competition is the standard result when competition is amongst a small number of agents. Designed as an ancillary text for graduate students, this book is an accessible introduction to the applications of a complex area of mathematical economics.