Characterization of properly optimal elements with variable ordering structures

In vector optimization with a variable ordering structure, the partial ordering defined by a convex cone is replaced by a whole family of convex cones, one associated with each element of the space. In recent publications, it was started to develop a comprehensive theory for these vector optimization problems. Thereby, also notions of proper efficiency were generalized to variable ordering structures. In this paper, we study the relation between several types of proper optimality. We give scalarization results based on new functionals defined by elements from the dual cones which allow complete characterizations also in the nonconvex case.     

Optimality of routing and servicing in dependent parallel processing systems

In a system of dependent, parallel processing service stations, when is it optimal to route customers to the shortest queue and to devote auxiliary capacity to serve the longest queue? We show that this RSQ/SLQ policy is optimal for a wide class of Markovian systems, where the arrival and service rates at the stations, which may depend on the numbers of customers at all the stations, satisfy certain symmetry and monotonicity conditions. Under this policy, the queue lengths will be stochastically smaller in the weak submajorization ordering than the queue lengths under any other policy. Furthermore, this policy minimizes standard discounted and average cost functionals over finite and infinite horizons.     

Remarks on variational methods and lower-upper solutions

The presence of lower and upper solutions to semilinear elliptic equations is linked to some variational properties of the associated action functionals. We exploit this variational characterization to find existence and multiplicity of solutions when multiple lower and upper solutions are given in various ordering relations. Received July 1998     

Dynamic cost allocation for economic lot sizing games

We consider a cooperative game defined by an economic lot sizing problem with concave ordering costs over a finite time horizon, in which each player faces demand for a single product in each period and coalitions can pool orders. We show how to compute a dynamic cost allocation in the strong sequential core of this game, i.e. an allocation over time that exactly distributes costs and is stable against coalitional defections at every period of the time horizon.     

Optimal stopping problem in a model with compensated refusal of reward

We consider the optimal stopping problem with a possible compensated refusal of reward. We discuss functionals of exponential Brownian motion. The optimal stopping time is defined on the set of all finite stopping times. The functionals under consideration correspond to payments for standard American options.     

Optimal control of a finite-capacity inventory system with setup cost and lost sales

One of the most fundamental results in inventory theoryis the optimality of (s, S) policy for inventory systems withsetup cost. This result is established based on a key assumptionof infinite production/ordering capacity. Several studies haveshown that, when there is a finite production/ordering capacity,the optimal policy for the inventory system is very complicatedand indeed, only partial characterization for the optimal policyis possible. In this paper, we consider a continuous reviewinventory system with finite production/ordering capacity andsetup cost, and show that the optimal control policy for thissystem has a very simple structure. We also develop efficientalgorithms to compute the optimal control parameters.     

Frames for vector spaces and affine spaces

A finite frame for a finite dimensional Hilbert space is simply a spanning sequence. We show that the linear functionals given by the dual frame vectors do not depend on the inner product, and thus it is possible to extend the frame expansion (and other elements of frame theory) to any finite spanning sequence for a vector space. The corresponding coordinate functionals generalise the dual basis (the case when the vectors are linearly independent), and are characterised by the fact that the associated Gramian matrix is an orthogonal projection. Existing generalisations of the frame expansion to Banach spaces involve an analogue of the frame bounds and frame operator.The potential applications of our results are considerable. Whenever there is a natural spanning set for a vector space, computations can be done directly with it, in an efficient and stable way. We illustrate this with a diverse range of examples, including multivariate spline spaces, generalised barycentric coordinates, and vector spaces over the rationals, such as the cyclotomic fields.     

Ascending bid auctions with behaviorally consistent bidders

Decision makers whose preferences do not satisfy the independence axiom of expected utility theory, when faced with sequential decisions will act in a dynamically inconsistent manner. In order to avoid this inconsistency and maintain nonexpected utility, we suggest the idea of behavioral consistency. We implement this notion by regarding the same decision maker at different decision nodes as different agents, and then taking the Bayesian — Nash equilibrium of this game. This idea is applied to a finite ascending bid auction game. We show the condition for the existence of an equilibrium of this game, and we also characterize the equilibrium in those cases when it exists. In particular, when the utility functionals are both quasi-concave and quasi-convex, then there is an equilibrium in dominant strategies where each bidder continues to bid if and only if the prevailing price is smaller than his value. In the case of quasi-concavity it is shown that, in equilibrium, each bidder has a value such that he continues with positive probability up to it, and withdraws after that.This research was supported by the NSF under Grant No. SES87-08360. We would like to thank Professor Irving H. LaValle for his helpful suggestions.     

A Sequential Least Squares Method for Elliptic Equations in Non-Divergence Form

We develop a new least squares method for solving the second-order elliptic equations in non-divergence form. Two least-squares-type functionals are proposed for solving the equation in two sequential steps. We first obtain a numerical approximation to the gradient in a piecewise irrotational polynomial space. Then together with the numerical gradient, we seek a numerical solution of the primitive variable in the continuous Lagrange finite element space. The variational setting naturally provides an a posteriori error which can be used in an adaptive refinement algorithm. The error estimates under the $L^2$ norm and the energy norm for both two unknowns are derived. By a series of numerical experiments, we verify the convergence rates and show the efficiency of the adaptive algorithm.     

Functional estimation for Lévy measures of semimartingales with Poissonian jumps

We consider semimartingales with jumps that have finite Lévy measures. The purpose of this article is to estimate integral-type functionals of the Lévy measures from discrete observations. We propose two types of estimators: kernel-type and empirical-type estimators, both of which are obtained by direct discretization from asymptotically efficient estimators of the target based on continuous observations. We show the asymptotic efficiency in the asymptotic minimax sense of our estimators as the sample size tends to infinity and the sampling interval tends to zero.     

Uniqueness of unbounded viscosity solutions for impulse control problem

We study here the impulse control problem in infinite as well as finite horizon. We allow the cost functionals and dynamics to be unbounded and hence the value function can possibly be unbounded. We prove that the value function is the unique viscosity solution in a suitable subclass of continuous functions, of the associated quasivariational inequality. Our uniqueness proof for the infinite horizon problem uses stopping time problem and for the finite horizon problem, comparison method. However, we assume proper growth conditions on the cost functionals and the dynamics.     

A Solution Concept for Fuzzy Multiobjective Programming Problems Based on Convex Cones

A solution concept for fuzzy multiobjective programming problems based on ordering cones (convex cones) is proposed in this paper. The notions of ordering cones and partial orderings on a vector space are essentially equivalent. Therefore, the optimality notions in a real vector space can be elicited naturally by invoking a concept similar to that of the Pareto-optimal solution in vector optimization problems. We introduce a corresponding multiobjective programming problem and a weighting problem of the original fuzzy multiobjective programming problem using linear functionals so that the optimal solution of its corresponding weighting problem is also the Pareto-optimal solution of the original fuzzy multiobjective programming problem.     

Sequential density techniques for an approximate Radon-Nikodým theorem

We deal with the problem of approximate representation of linear functionals and show how the sequential density techniques may be used for solution.     

Determining functionals for the microwave heating system

The notion of determining functionals for cocycles is introduced. A theorem on the existence of a finite set of determining functionals for a certain class of cocycles defined on the product of a Hilbert and a metric space is given. The cocycle generated by weak solutions of the one-dimensional microwave heating system is constructed. Under additional assumptions, the existence of a finite set of determining functionals for this cocycle is proved.     

Optimality conditions for vector optimization problems with variable ordering structures

Our main concern in this article are concepts of nondominatedness w.r.t. a variable ordering structure introduced by Yu [P.L. Yu, Cone convexity, cone extreme points, and nondominated solutions in decision problems with multiobjectives, J. Optim. Theory Appl. 14 (1974), pp. 319–377]. Our studies are motivated by some recent applications e.g. in medical image registration. Restricting ourselves to the case when the values of a cone-valued map defining the ordering structure are Bishop–Phelps cones, we obtain for the first time scalarizing functionals for nondominated elements, Fermat rule, Lagrange multiplier rule and duality results for a single- or set-valued vector optimization problem with a variable ordering structure.     

Cones Admitting Strictly Positive Functionals and Scalarization of Some Vector Optimization Problems

This paper is concerned with cones admitting strictly positive functionals and scalarization methods in multiobjective optimization. Assuming that the ordering cone admits strictly positive functionals or possesses a base in normed spaces or is a supernormal cone in a Banach space, we give scalar and scalar proper representations for vector optimization problems with convex and naturally quasiconvex data.     

Order estimates of the norms of derivatives of functions with zero values on linear functionals and their applications

For a given finite set of linear functionals we construct functions vanishing on them and give order estimates of their derivatives. We also give their different applications.     

A unified approach to parallel space decomposition methods

We consider (relaxed) additive and multiplicative iterative space decomposition methods for the minimization of sufficiently smooth functionals without constraints. We develop a general framework which unites existing approaches from both parallel optimization and finite elements. Specifically this work unifies earlier research on the parallel variable distribution method in minimization, space decomposition methods for convex functionals, algebraic Schwarz methods for linear systems and splitting methods for linear least squares. We develop a general convergence theory within this framework, which provides several new results as well as including known convergence results.     

Dimension-Independent Estimates on the Densities of Wiener Functionals via the Log-Sobolev Inequality

Using the log-Sobolev inequality, we shall present in this note some estimates on the density of finite dimensional non-degenerate Wiener functionals which are independent on the dimension. We shall take the Gaussian measure as the reference measure, contrary to the customary choice of Lebesgue measure in the literature. As an application, we show that the limit in probability of a uniformly bounded sequence of non-degenerate Wiener functionals has a density with respect to the Gaussian measure.     

单调Minkowski泛函与Henig真有效性的标量化

没有凸锥的闭性和点性假设,该文考虑由一般凸锥生成的单调Minkowski泛函并研究其性质.由此,在偏序局部凸空间的框架下,通过利用单调连续Minkowski泛函和单调连续半范,该文分别获得了一般集合及锥有界集合的弱有效点的标量化.利用此弱有效性的标量化,该文分别推导出一般集合及锥有界集合的Henig真有效点的标量化.进而,当序锥具备有界基时,该文获得局部凸空间中超有效性的一些标量化结果.最后,该文给出Henig真有效性和超有效性的稠密性结果.这些结果推广并改进了有关的已知结果.