Vector optimization is continuously needed in several science fields, particularly in economy, business, engineering, physics and mathematics. The evolution of these fields depends, in part, on the improvements in vector optimization in mathematical programming. The aim of this Ebook is to present the latest developments in vector optimization. The contributions have been written by some of the most eminent researchers in this field of mathematical programming. The Ebook is considered essential for researchers and students in this field.

Set-valued optimization is a vibrant and expanding branch of mathematics that deals with optimization problems where the objective map and/or the constraints maps are set-valued maps acting between certain spaces. Since set-valued maps subsumes single valued maps, set-valued optimization provides an important extension and unification of the scalar as well as the vector optimization problems. Therefore this relatively new discipline has justifiably attracted a great deal of attention in recent years. This book presents, in a unified framework, basic properties on ordering relations, solution concepts for set-valued optimization problems, a detailed description of convex set-valued maps, most recent developments in separation theorems, scalarization techniques, variational principles, tangent cones of first and higher order, sub-differential of set-valued maps, generalized derivatives of set-valued maps, sensitivity analysis, optimality conditions, duality and applications in economics among other things.

In vector optimization one investigates optimal elements such as min imal, strongly minimal, properly minimal or weakly minimal elements of a nonempty subset of a partially ordered linear space. The prob lem of determining at least one of these optimal elements, if they exist at all, is also called a vector optimization problem. Problems of this type can be found not only in mathematics but also in engineer ing and economics. Vector optimization problems arise, for exam ple, in functional analysis (the Hahn-Banach theorem, the lemma of Bishop-Phelps, Ekeland's variational principle), multiobjective pro gramming, multi-criteria decision making, statistics (Bayes solutions, theory of tests, minimal covariance matrices), approximation theory (location theory, simultaneous approximation, solution of boundary value problems) and cooperative game theory (cooperative n player differential games and, as a special case, optimal control problems). In the last decade vector optimization has been extended to problems with set-valued maps. This new field of research, called set optimiza tion, seems to have important applications to variational inequalities and optimization problems with multivalued data. The roots of vector optimization go back to F. Y. Edgeworth (1881) and V. Pareto (1896) who has already given the definition of the standard optimality concept in multiobjective optimization. But in mathematics this branch of optimization has started with the leg endary paper of H. W. Kuhn and A. W. Tucker (1951). Since about v Vl Preface the end of the 60's research is intensively made in vector optimization.

These notes grew out of a series of lectures given by the author at the Univer sity of Budapest during 1985-1986. Additional results have been included which were obtained while the author was at the University of Erlangen-Niirnberg under a grant of the Alexander von Humboldt Foundation. Vector optimization has two main sources coming from economic equilibrium and welfare theories of Edgeworth (1881) and Pareto (1906) and from mathemat ical backgrounds of ordered spaces of Cantor (1897) and Hausdorff (1906). Later, game theory of Borel (1921) and von Neumann (1926) and production theory of Koopmans (1951) have also contributed to this area. However, only in the fifties, after the publication of Kuhn-Tucker's paper (1951) on the necessary and sufficient conditions for efficiency, and of Deubreu's paper (1954) on valuation equilibrium and Pareto optimum, has vector optimization been recognized as a mathematical discipline. The stretching development of this field began later in the seventies and eighties. Today there are a number of books on vector optimization. Most of them are concerned with the methodology and the applications. Few of them offer a systematic study of the theoretical aspects. The aim of these notes is to pro vide a unified background of vector optimization,with the emphasis on nonconvex problems in infinite dimensional spaces ordered by convex cones. The notes are arranged into six chapters. The first chapter presents prelim inary material.

This book is devoted to one of the main questions of the theory of extremal problems, namely, to necessary and sufficient extremality conditions. The book consists of four parts. First, the abstract minimization problem with constraints is studied. The next chapter is devoted to one of the most important classes of extremal problems, the optimal control problem. Next, one of the main objects of the calculus of variations is studied, the integral quadratic form. Finally, local properties of smooth nonlinear mappings in a neighborhood of an abnormal point will be discussed. Audience: The book is intended for researchers interested in optimization problems. The book may also be useful for advanced students and postgraduate students.

This book is devoted to vector or multiple criteria approaches in optimization. Topics covered include: vector optimization, vector variational inequalities, vector variational principles, vector minmax inequalities and vector equilibrium problems. In particular, problems with variable ordering relations and set-valued mappings are treated. The nonlinear scalarization method is extensively used throughout the book to deal with various vector-related problems. The results presented are original and should be interesting to researchers and graduates in applied mathematics and operations research. Readers will benefit from new methods and ideas for handling multiple criteria decision problems.

The book is intended for people (graduates, researchers, but also undergraduates with a good mathematical background) involved in the study of (static) optimization problems (in finite-dimensional spaces). It contains a lot of material, from basic tools of convex analysis to optimality conditions for smooth optimization problems, for non smooth optimization problems and for vector optimization problems.The development of the subjects are self-contained and the bibliographical references are usually treated in different books (only a few books on optimization theory deal also with vector problems), so the book can be a starting point for further readings in a more specialized literature.Assuming only a good (even if not advanced) knowledge of mathematical analysis and linear algebra, this book presents various aspects of the mathematical theory in optimization problems. The treatment is performed in finite-dimensional spaces and with no regard to algorithmic questions. After two chapters concerning, respectively, introductory subjects and basic tools and concepts of convex analysis, the book treats extensively mathematical programming problems in the smmoth case, in the nonsmooth case and finally vector optimization problems.· Self-contained· Clear style and results are either proved or stated precisely with adequate references· The authors have several years experience in this field· Several subjects (some of them non usual in books of this kind) in one single book, including nonsmooth optimization and vector optimization problems· Useful long references list at the end of each chapter

The chapters in this volume, written by international experts from different fields of mathematics, are devoted to honoring George Isac, a renowned mathematician. These contributions focus on recent developments in complementarity theory, variational principles, stability theory of functional equations, nonsmooth optimization, and several other important topics at the forefront of nonlinear analysis and optimization.

This first volume presents the theory and methods of solving vector optimization problems, using initial definitions that include axioms and the optimality principle. This book proves, mathematically, that the result it presents for the solution of the vector (multi-criteria) problem is the optimal outcome, and, as such, solves the problem of vector optimization for the first time. It shows that applied methods of solving vector optimization problems can be used by researchers in modeling and simulating the development of economic systems and technical (engineering) systems.

Convex optimization problems arise frequently in many different fields. This book provides a comprehensive introduction to the subject, and shows in detail how such problems can be solved numerically with great efficiency. The book begins with the basic elements of convex sets and functions, and then describes various classes of convex optimization problems. Duality and approximation techniques are then covered, as are statistical estimation techniques. Various geometrical problems are then presented, and there is detailed discussion of unconstrained and constrained minimization problems, and interior-point methods. The focus of the book is on recognizing convex optimization problems and then finding the most appropriate technique for solving them. It contains many worked examples and homework exercises and will appeal to students, researchers and practitioners in fields such as engineering, computer science, mathematics, statistics, finance and economics.