scientific article; zbMATH DE number 1105179
The book is devoted to a graphic decision support tool, the Feasible Goals Method (FGM), which is an original multiple criteria decision and negotiation support tool based on algorithms for approximation of multiple dimensional sets given by mappings. The Feasible Set in Criterion Space (FSCS), which is the image of the feasible decision set, is approximated and visualized for the case of three to seven criteria. Though the book is mostly devoted to the polyhedral approximation of convex bodies given by linear mappings, nonlinear case is considered in short, too. The book consists of five chapters. Three chapters of the book are written in a simple form that can be assessed by any computer-literate person. It is shown on the basis of multiple environmental and economic examples how the FGM combines the ideas of the goal method and the multiple criteria decision making for screening of huge or infinite varieties of strategies. Exploration of the FSCS (as well as its Edgeworth-Pareto hull) is based on a fast interactive or animated display of decision maps (collections of efficiency frontiers among two criteria). By this, user can receive graphic information about the potentialities of choice and efficient tradeoffs among three to seven criteria. The fourth chapter discusses current and possible future applications of the FGM for solution of public decision problems on Internet as well as other methodological problems. The fifth chapter contains short mathematical description of the FGM. Authors describe three groups of algorithms for approximation of multiple dimensional sets given by mappings. The first group of algorithms is based on Fourier convolution of linear inequalities and can be applies for linear models with a relatively small number of decision variables. The second group is based on polyhedral approximation of compact convex bodies given by support function. Theory of algorithms for optimal approximation of convex bodies by polytopes developed by authors is described. It is shown that the adaptive algorithms proposed by the authors are asymptotically optimal. These algorithms provide now the main approximation tool for linear or convex problems with a thousands of decision variables. The third group of algorithms described in the fifth chapter is used in the case of nonlinear models and nonconvex feasible sets. It is based on simulation of stochastically generated decision alternatives and on adaptive covering of the FSCS by systems of balls located in a subset of output points. Special attention is given to approximation of the Edgeworth-Pareto hull of the FSCS, visualization algorithms, and the particular case of dynamic systems. Actually, the fifth chapter provides an introduction into the mathematics of the FGM, it is supplied by a large number of references to the literature that contains detailed description of the mathematical results of the authors. Though the book is intended in the first instance for specialists in decision science and decision support systems, specialists in computational geometry will find new interesting results in the field of theory and especially practice of approximation of multi-dimensional sets given by mappings. Applications of von Neumann minimax theorem to functional analysis, in particular, monotone operators are considered. The theorem proves equality of minimax and maximin for convex-concave functionals. This theorem combined with the Hanh-Banach theorem (that a sublinear functional may be majorized by the linear one), and the Banach-Alaoglu theorem (about weak compactness of a ball in dual space) provides the author with the minimax technique to obtain new results and get simple proofs for well-known theorems. For example, Rockafellar's characterization of those monotone operators on a reflexive space that are maximal, the local boundedness of any nontrivial monotone multifunction in any absorbing point of its domain, the convexity of the domain of a maximal monotone multifunction, and so on. Some of known results are strengthened or generalized. The author proves that any point surrounded by the domain of a maximal monotone multifunction is an interior point of that domain. Using the minimax technique, the open mapping theorem is generalized. This helps to give a necessary and sufficient for the sum of maximal monotone multifunctions on a reflexive Banach space to be maximal monotone. Some nonreflexive cases are also considered. Note the generalizations of Rockafellar's result on maximal monotonicity of subdifferentials. For unbounded (discontinuous) positive linear operators from a Banach space to its dual, a criterion is given to be maximal monotone and other related properties are discussed. Most results obtained are based on the notion of ``big convexification of a multifunction graph, the set of probability measures with finite support contained in the graph. Three functionals on the set is introduced such that the relationships between their values give the monotonicity and maximal monotonicity conditions in the book.
- New external estimate for the reachable set of a nonlinear multistep dynamic system
- Construction of suboptimal coverings of the multidimensional unit sphere
- Method for constructing optimal dark coverings
- Equilibria and compromises in two-person zero-sum multicriteria games
- Launch pad method in multiextremal multiobjective optimization problems
- Multicriteria competitive games as models in operations research
- Extended launch pad method for the Pareto frontier approximation in multiextremal multiobjective optimization problems
- Simple efficient hybridization of classic global optimization and genetic algorithms for multiobjective optimization
- The quasi-reasonable goals method for integer multicriteria optimization problems
- Multicriteria optimization of convex dynamical systems
- Decomposition methods for polyhedral approximation of the Edgeworth-Pareto hull
- Convergence of Hausdorff approximation methods for the Edgeworth-Pareto hull of a compact set
- Study of hybrid methods for approximating the Edgeworth-Pareto hull in nonlinear multicriteria optimization problems
- Efficiency of the estimate refinement method for polyhedral approximation of multidimensional balls
- From chaos to order. Difference equations in one ecological problem
- Compromise Pareto's evaluation of parameters linear regression
- Multicriteria identification sets method
- Study of convergence rate and efficiency of two-phase methods for approximating the Edgeworth-Pareto hull
- Guaranteed-accuracy approximation of reachable sets for a linear dynamic system subject to impulse actions
- Study of an adaptive single-phase method for approximating the multidimensional Pareto frontier in nonlinear systems
- Hybrid adaptive methods for approximating a nonconvex multidimensional Pareto frontier
- Applying the linear scalarization in multicriteria maximin problems
- Reasonable goals method in the multicriteria choice problem with uncertain information
- Comparison of two Pareto frontier approximations
- Method of non-uniform coverages to solve the multicriteria optimization problems with guaranteed accuracy
- Asymptotic properties of the estimate refinement method in polyhedral approximation of multidimensional balls
- Decomposition of the problem of approximating the Edgeworth-Pareto hull
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4370596)