A new one‐shot pointwise source reconstruction method

In this work, a new pointwise source reconstruction method is proposed. From a single pair of boundary measurements, we want to completely characterize the unknown set of pointwise sources, namely, the number of sources and their locations and intensities. The idea is to rewrite the inverse source problem as an optimization problem, where a Kohn‐Vogelius type functional is minimized with respect to a set of admissible pointwise sources. The resulting second‐order reconstruction algorithm is non‐iterative and thus very robust with respect to noisy data. Finally, in order to show the effectiveness of the devised reconstruction algorithm, some numerical experiments into two spatial dimensions are presented. Copyright © 2016 John Wiley & Sons, Ltd.     

Regularization in Sobolev Spaces with Fractional Order

We study the minimization of a quadratic functional where the Tichonov regularization term is an H ^s -norm with a fractional s > 0. Moreover, pointwise bounds for the unknown solution are given. A multilevel approach as an equivalent norm concept is introduced. We show higher regularity of the solution of the variational inequality. This regularity is used to show the existence of regular Lagrange multipliers in function space. The theory is illustrated by two applications: a Dirichlet boundary control problem and a parameter identification problem.     

A non-interactive elicitation method for non-linear multiattribute utility functions: Theory and application to agricultural economics

Practical implementation of Multiattribute Utility Theory is limited, partly for the lack of operative methods to elicit the parameters of the Multiattribute Utility Function, particularly when this function is not linear. As a consequence, most studies are restricted to linear specifications, which are easier to estimate and to interpret. We propose an indirect method to elicit the parameters of a non-linear utility function to be compatible with the observed behaviour of decision makers, rather than with their answers to direct surveys. The idea rests on approaching the parameter estimation problem as a dual of the decision problem by making the observed decisions to be compatible with a rational decision making process.     

An Interactive Algorithm for Multi-objective Route Planning

We address the route selection problem for Unmanned Air Vehicles (UAV) under multiple objectives. We consider a general case for this problem, where the UAV has to visit several targets and return to the base. We model this problem as a combination of two combinatorial problems. First, the path to be followed between each pair of targets should be determined. We model this as a multi-objective shortest path problem. Additionally, we need to determine the order of the targets to be visited. We model this as a multi-objective traveling salesperson problem (MOTSP). The overall problem is a combination of these two problems, which we define as a generalized MOTSP. We develop an exact interactive approach to identify the best paths and the best tour of a decision maker under a linear utility function.     

HARA frontiers of optimal portfolios in stochastic markets

In this paper, we consider the optimal portfolio selection problem in continuous-time settings where the investor maximizes the expected utility of the terminal wealth in a stochastic market. The utility function has the structure of the HARA family and the market states change according to a Markov process. The states of the market describe the prevailing economic, financial, social and other conditions that affect the deterministic and probabilistic parameters of the model. This includes the distributions of the random asset returns as well as the utility function. We analyzed Black–Scholes type continuous-time models where the market parameters are driven by Markov processes. The Markov process that affects the state of the market is independent of the underlying Brownian motion that drives the stock prices. The problem of maximizing the expected utility of the terminal wealth is investigated and solved by stochastic optimal control methods for exponential, logarithmic and power utility functions. We found explicit solutions for optimal policy and the associated value functions. We also constructed the optimal wealth process explicitly and discussed some of its properties. In particular, it is shown that the optimal policy provides linear frontiers.     

An Interactive Approach for Choosing the Best of a Set of Alternatives

In this paper we address the problem of choosing the most preferred alternative among a large number of alternatives where each alternative is defined by multiple criteria. We assume that the decision maker has a quasiconcave utility function. We develop an exact approach that combines the ideas that have appeared in the literature regarding the use of different types of dummy alternatives in conjunction with real alternatives. Our experimental results indicate that the new approach is comparable to leading existing approaches.     

Utility efficiency and its approximation

Summary We assume a multi-attribute decision making problem under uncertainty with partial information on the decision maker's preferences, by a vector utility function with two components and imprecision over their scaling constants. We propose an approximation set whose determination may be easier than the one of the utility efficient set and we consider an interactive procedure which uses such approximation to decision aid. We study some nesting and convergence properties based on the interactive reduction of the approximation set. Finally, we illustrate the procedure with a numerical example.     

An Approach to Fuzzy Noncooperative Nash Games

Systems that involve more than one decision maker are often optimized using the theory of games. In the traditional game theory, it is assumed that each player has a well-defined quantitative utility function over a set of the player decision space. Each player attempts to maximize/minimize his/her own expected utility and each is assumed to know the extensive game in full. At present, it cannot be claimed that the first assumption has been shown to be true in a wide variety of situations involving complex problems in economics, engineering, social and political sciences due to the difficulty inherent in defining an adequate utility function for each player in these types of problems. On the other hand, in many of such complex problems, each player has a heuristic knowledge of the desires of the other players and a heuristic knowledge of the control choices that they will make in order to meet their ends.In this paper, we utilize fuzzy set theory in order to incorporate the players' heuristic knowledge of decision making into the framework of conventional game theory or ordinal game theory. We define a new approach to N-person static fuzzy noncooperative games and develop a solution concept such as Nash for these types of games. We show that this general formulation of fuzzy noncooperative games can be applied to solve multidecision-making problems where no objective function is specified. The computational procedure is illustrated via application to a multiagent optimization problem dealing with the design and operation of future military operations.     

群体多指标决策的偏好集结方法

研究多个指标条件下,利用个体决策结果形成群体一致偏好的方法、假设个体有加性效用函数,将个体多指标效用函数表示成单个指标评价函数的加权和,群体指标评价函数表示成个体指标评价函数的加权和.通过协商指标权重、指标评价函数、支付意愿三个参数,成对个体达成双方一致.提出了(n-1)对个体之间达成双方一致,从而得出群体效用函数的决策方法,这种分析框架同样可以扩展到联盟协商一致中.     

Experiments with an interactive paired comparison simplex method for molp problems

In this paper, an interactive paired comparison simplex based method formultiple objective linear programming (MOLP) problems is developed and compared to other interactive MOLP methods. The decision maker (DM)’s utility function is assumed to be unknown, but is an additive function of his known linearized objective functions. A test for ‘utility efficiency’ for MOLP problems is developed to reduce the number of efficient extreme points generated and the number of questions posed to the DM. The notion of ‘strength of preference ’ is developed for the assessment of the DM’s unknown utility function where he can express his preference for a pair of extreme points as ‘strong ’, ‘weak ’, or ‘almost indifferent ’. The problem of ‘inconsistency of the DM’ is formalized and its resolution is discussed. An example of the method and detailed computational results comparing it with other interactive MOLP methods are presented. Several performance measures for comparative evaluations of interactive multiple objective programming methods are also discussed. All rights reserved. This study, or parts thereof, may not be reproduced in any form without written permission of the authors.     

Pointwise Debreu Lexicographic Powers

A linear ordering is Debreu (respectively, pointwise Debreu) if each of its suborderings can be mapped into it with an order-preserving function that is both injective (respectively, locally injective) and continuous (respectively, locally continuous) with respect to the order topology on both spaces. Each Debreu linear ordering is pointwise Debreu, but the converse does not hold. In the context of utility representations in mathematical economics, it has been proved that any lexicographic power with an uncountable exponent fails to be Debreu. We sharpen this result by analyzing lexicographic powers that are pointwise Debreu.     

Simulation-based parametric optimization for long-term asset allocation using behavioral utilities

This article presents a simulation-based methodology for finding optimal investment strategy for long-term financial planning. The problem becomes intractable due to its size or the properties of the utility function of the investors. One approach is to make simplifying assumptions regarding the states of the world and/or utility functions in order to obtain a solution. These simplifications lead to the true solution of an approximate problem. Our approach is to find a good approximate solution to the true problem. We approximate the optimal decision in each period with a low dimensional parameterization, thus reformulating the problem as a non-linear, simulation-based optimization in the parameter space. The dimension of the reformulated optimization problem becomes linear in the number of periods. The approach is extendable to other problems where similar solution characteristics are known.     

On the rate allocation problem under co-existence of uncertain utility function parameters and uncertain link capacities

The allocation problem is considered for a computer communication network with network links being shared among multiple transmissions running at the same time. Typically, each transmission brings benefit to a network owner proportional to the transmission rate allowed. Since the link capacities are limited and the minimal rates defined by Quality of Service (QoS) requirements have to be preserved, the rate allocation problem is defined here as a problem of maximizing the overall benefit (utility) under capacity and QoS constraints. In this paper, we consider the uncertain version of the problem, in which unknown utility function parameters and unknown link capacities are treated as uncertain variables characterized by certainty distributions. We present a method for solving the problem in a unified way, with both uncertainties combined in a single certainty index.     

Portfolio selection in stochastic markets with exponential utility functions

We consider the optimal portfolio selection problem in a multiple period setting where the investor maximizes the expected utility of the terminal wealth in a stochastic market. The utility function has an exponential structure and the market states change according to a Markov chain. The states of the market describe the prevailing economic, financial, social and other conditions that affect the deterministic and probabilistic parameters of the model. This includes the distributions of the random asset returns as well as the utility function. The problem is solved using the dynamic programming approach to obtain the optimal solution and an explicit characterization of the optimal policy. We also discuss the stochastic structure of the wealth process under the optimal policy and determine various quantities of interest including its Fourier transform. The exponential return-risk frontier of the terminal wealth is shown to have a linear form. Special cases of multivariate normal and exponential returns are disussed together with a numerical illustration.     

UTA-poly and UTA-splines: Additive value functions with polynomial marginals

Additive utility function models are widely used in multiple criteria decision analysis. In such models, a numerical value is associated to each alternative involved in the decision problem. It is computed by aggregating the scores of the alternative on the different criteria of the decision problem. The score of an alternative is determined by a marginal value function that evolves monotonically as a function of the performance of the alternative on this criterion. Determining the shape of the marginals is not easy for a decision maker. It is easier for him/her to make statements such as “alternative a is preferred to b”. In order to help the decision maker, UTA disaggregation procedures use linear programming to approximate the marginals by piecewise linear functions based only on such statements. In this paper, we propose to infer polynomials and splines instead of piecewise linear functions for the marginals. In this aim, we use semidefinite programming instead of linear programming. We illustrate this new elicitation method and present some experimental results.     

Theory of convex cones in multicriteria decision making

We develop the theory of convex polyhedral cones in the objective-function space of a multicriteria decision problem. The convex cones are obtained from the decision-maker's pairwise judgments of decision alternatives and are applicable to any quasiconcave utility function. Therefore, the cones can be used in any progressively articulated solution procedure that employs pairwise comparisons. The cones represent convex sets of solutions that are inferior to known solutions to a multicriteria problem. Therefore, these convex sets can be eliminated from consideration while solving the problem. We develop the underlying theory and a framework for representing knowledge about the decision-maker's preference structure using convex cones. This framework can be adopted in the interactive solution of any multicriteria problem after taking into account the characteristics of the problem and the solution procedure. Our computational experience with different multicriteria problems shows that this approach is both viable and efficient in solving practical problems of moderate size.     

Dynamic decision making without expected utility: An operational approach

Non-expected utility theories, such as rank dependent utility (RDU) theory, have been proposed as alternative models to EU theory in decision making under risk. These models do not share the separability property of expected utility theory. This implies that, in a decision tree, if the reduction of compound lotteries assumption is made (so that preferences at each decision node reduce to RDU preferences among lotteries) and that preferences at different decision nodes are identical (same utility function and same weighting function), then the preferences are not dynamically consistent; in particular, the sophisticated strategy, i.e., the strategy generated by a standard rolling back of the decision tree, is likely to be dominated w.r.t. stochastic dominance. Dynamic consistency of choices remains feasible, and the decision maker can avoid dominated choices, by adopting a non-consequentialist behavior, with his choices in a subtree possibly depending on what happens in the rest of the tree. We propose a procedure which: (i) although adopting a non-consequentialist behavior, involves a form of rolling back of the decision tree; (ii) selects a non-dominated strategy that realizes a compromise between the decision maker’s discordant goals at the different decision nodes. Relative to the computations involved in the standard expected utility evaluation of a decision problem, the main computational increase is due to the identification of non-dominated strategies by linear programming. A simulation, using the rank dependent utility criterion, confirms the computational tractability of the model.     

Gradient projection and local region search for multiobjective optimisation

This paper presents a new method for multiobjective optimisation based on gradient projection and local region search. The gradient projection is conducted through the identification of normal vectors of an efficient frontier. The projection of the gradient of a nonlinear utility function onto the tangent plane of the efficient frontier at a given efficient solution leads to the definition of a feasible local region in a neighbourhood of the solution. Within this local region, a better efficient solution may be sought. To implement such a gradient-based local region search scheme, a new auxiliary problem is developed. If the utility function is given explicitly, this search scheme results in an iterative optimisation algorithm capable of general nonseparable multiobjective optimisation. Otherwise, an interactive decision making algorithm is developed where the decision maker (DM) is expected to provide local preference information in order to determine trade-off directions and step sizes. Optimality conditions for the algorithms are established and the convergence of the algorithms is proven. A multiobjective linear programming (MOLP) problem is taken for example to demonstrate this method both graphically and analytically. A nonlinear multiobjective water quality management problem is finally examined to show the potential application of the method to real world decision problems.     

Formulating an <Emphasis Type="Italic">n</Emphasis>-person noncooperative game as a tensor complementarity problem

In this paper, we consider a class of n-person noncooperative games, where the utility function of every player is given by a homogeneous polynomial defined by the payoff tensor of that player, which is a natural extension of the bimatrix game where the utility function of every player is given by a quadratic form defined by the payoff matrix of that player. We will call such a problem the multilinear game. We reformulate the multilinear game as a tensor complementarity problem, a generalization of the linear complementarity problem; and show that finding a Nash equilibrium point of the multilinear game is equivalent to finding a solution of the resulted tensor complementarity problem. Especially, we present an explicit relationship between the solutions of the multilinear game and the tensor complementarity problem, which builds a bridge between these two classes of problems. We also apply a smoothing-type algorithm to solve the resulted tensor complementarity problem and give some preliminary numerical results for solving the multilinear games.     

Repulsive Assignment Problem

Standard assignment is the problem of obtaining a matching between two sets of respectively persons and positions so that each person is assigned exactly one position and each position receives exactly one person, while a linear decision maker utility function is maximized. We introduce a variant of the problem where the persons individual utilities are taken into account in a way that a feasible solution must satisfy not only the standard assignment constraints, but also an equilibrium constraint of the complementarity type, which we call repulsive. The equilibrium constraint can be, in turn, transformed into a typically large set of linear constraints. Our problem is NP-hard and it is a special case of the assignment problem with side constraints. We study an exact penalty function approach which motivates a heuristic algorithm. We provide computational experiments that show the usefulness of a heuristic mechanism inspired by the exact approach. The heuristics outperforms a state-of-the-art integer linear programming solver.