Stochastic Nonlinear Complementarity Problem and?Applications to?Traffic Equilibrium under?Uncertainty

The expected residual minimization (ERM) formulation for the stochastic nonlinear complementarity problem (SNCP) is studied in this paper. We show that the involved function is a stochastic R ₀ function if and only if the objective function in the ERM formulation is coercive under a mild assumption. Moreover, we model the traffic equilibrium problem (TEP) under uncertainty as SNCP and show that the objective function in the ERM formulation is a stochastic R ₀ function. Numerical experiments show that the ERM-SNCP model for TEP under uncertainty has various desirable properties. This work was partially supported by a Grant-in-Aid from the Japan Society for the Promotion of Science. The authors thank Professor Guihua Lin for pointing out an error in Proposition 2.1 on an earlier version of this paper. The authors are also grateful to the referees for their insightful comments.     

Execution of active reduction of vibrations by means of kinematic excitations

The major objective of this study is to show how to carry out the process of structural and parametrical synthesis that is understood as a method intended to seek for the structure and parameters of a discrete model of the system with active suppression of vibrations. Active components are implemented as mechanical components with kinematic excitations. The other objective is to analyze how the active subsystem interacts with the overall investigated structure. (© 2010 Wiley-VCH Verlag GmbH & Co. KGaA, Weinheim)     

客户关系动态优化模型与实证研究

提出了客户关系与营销活动的动态交互模型,以长期收益最大化为目标,优化企业的营销活动。模型假设客户关系可离散为几个层级状态,并设客户关系所处状态受营销活动的影响而动态的变化,服从马尔可夫决策过程。客户关系状态所处层级不可直接观测,但其与客户购买水平有概率相关关系。提出模型参数估计的最大似然估计方法。以国内某企业的客户关系管理数据为例,说明了模型变量的定义方法,通过客户交互历史数据估计模型参数,并对客户管理策略进行优化。结果表明,最优策略管理下期望提升客户价值61％～82％。     

Secondary bifurcations and localisation in a three-dimensional buckling model

This paper revisits the effect of secondary bifurcations on the post-buckling response of a simple 3D system of elastically restrained beams, first discussed by Luongo in [19]. Our main objective is to show how to construct a uniform asymptotic expression for the localised buckling patterns experienced by this model. The governing equation is formulated as a fourth-order eigenvalue problem with non-constant coefficients and then a complex WKB technique is employed to yield the localised instability patterns. Numerical simulations supporting the analytical findings are included as well.     

Secondary bifurcations and localisation in a three-dimensional buckling model

This paper revisits the effect of secondary bifurcations on the post-buckling response of a simple 3D system of elastically restrained beams, first discussed by Luongo in [19]. Our main objective is to show how to construct a uniform asymptotic expression for the localised buckling patterns experienced by this model. The governing equation is formulated as a fourth-order eigenvalue problem with non-constant coefficients and then a complex WKB technique is employed to yield the localised instability patterns. Numerical simulations supporting the analytical findings are included as well.Received: October 21, 2003     

Single machine scheduling problems with general position-dependent processing times and past-sequence-dependent delivery times

This paper considers single machine scheduling with past-sequence-dependent (psd) delivery times, in which the processing time of a job depends on its position in a sequence. We provide a unified model for solving single machine scheduling problems with psd delivery times. We first show how this unified model can be useful in solving scheduling problems with due date assignment considerations. We analyze the problem with four different due date assignment methods, the objective function includes costs for earliness, tardiness and due date assignment. We then consider scheduling problems which do not involve due date assignment decisions. The objective function is to minimize makespan, total completion time and total absolute variation in completion times. We show that each of the problems can be reduced to a special case of our unified model and solved in O(n ³) time. In addition, we also show that each of the problems can be solved in O(nlogn) time for the spacial case with job-independent positional function.     

The bi-objective Pollution-Routing Problem

The bi-objective Pollution-Routing Problem is an extension of the Pollution-Routing Problem (PRP) which consists of routing a number of vehicles to serve a set of customers, and determining their speed on each route segment. The two objective functions pertaining to minimization of fuel consumption and driving time are conflicting and are thus considered separately. This paper presents an adaptive large neighborhood search algorithm (ALNS), combined with a speed optimization procedure, to solve the bi-objective PRP. Using the ALNS as the search engine, four a posteriori methods, namely the weighting method, the weighting method with normalization, the epsilon-constraint method and a new hybrid method (HM), are tested using a scalarization of the two objective functions. The HM combines adaptive weighting with the epsilon-constraint method. To evaluate the effectiveness of the algorithm, new sets of instances based on real geographic data are generated, and a library of bi-criteria PRP instances is compiled. Results of extensive computational experiments with the four methods are presented and compared with one another by means of the hypervolume and epsilon indicators. The results show that HM is highly effective in finding good-quality non-dominated solutions on PRP instances with 100 nodes.     

Optimal investment strategy for asset-liability management under the Heston model

ABSTRACT

This paper focuses on an asset-liability management problem for an investor who can invest in a risk-free asset and a risky asset whose price process is governed by the Heston model. The objective of the investor is to find an optimal investment strategy to maximize the expected exponential utility of the surplus process. By using the stochastic control method and variable change techniques, we obtain a closed-form solution of the corresponding Hamilton–Jacobi–Bellman equation. We also develop a verification theorem without the usual Lipschitz assumptions which can ensure that this closed-form solution is indeed the value function and then derive the optimal investment strategy explicitly. Finally, we provide numerical examples to show how the main parameters of the model affect the optimal investment strategy.     

Machine scheduling with resource dependent processing times

We consider machine scheduling on unrelated parallel machines with the objective to minimize the schedule makespan. We assume that, in addition to its machine dependence, the processing time of any job is dependent on the usage of a discrete renewable resource, e.g. workers. A given amount of that resource can be distributed over the jobs in process at any time, and the more of that resource is allocated to a job, the smaller is its processing time. This model generalizes the classical unrelated parallel machine scheduling problem by adding a time-resource tradeoff. It is also a natural variant of a generalized assignment problem studied previously by Shmoys and Tardos. On the basis of an integer linear programming formulation for a relaxation of the problem, we use LP rounding techniques to allocate resources to jobs, and to assign jobs to machines. Combined with Graham’s list scheduling, we show how to derive a 4-approximation algorithm. We also show how to tune our approach to yield a 3.75-approximation algorithm. This is achieved by applying the same rounding technique to a slightly modified linear programming relaxation, and by using a more sophisticated scheduling algorithm that is inspired by the harmonic algorithm for bin packing. We finally derive inapproximability results for two special cases, and discuss tightness of the integer linear programming relaxations.     

The U.S. Navy explores detailing cost reduction via Data Envelopment Analysis

In this paper we show how a variation of Data Envelopment Analysis, the Generalized Symmetric Weight Assignment Technique, is used to assign sailors to jobs for the U.S. Navy. This method differs from others as the assignment is a multi-objective problem where the importance of each objective, called a metric, is determined by the decision-maker and promoted within the assignment problem. We explore how the method performs as the importance of particular metrics increases. Finally, we show that the proposed method leads to substantial cost savings for the U.S. Navy without degrading the resulting assignments’ performance on other metrics.     

Estimating intermediate price transitions in online auctions

This paper discusses a statistical model regarding intermediate price transitions of online auctions. The objective was to characterize the stochastic process by which prices of online auctions evolve and to estimate conditional intermediate price transition probabilities given current price, elapsed auction time, number of competing auctions, and calendar time. Conditions to ensure monotone price transitions in the current price and number of competing auctions are discussed and empirically validated. In particular, we show that over discrete periods, the intermediate price transitions are increasing in the current price, decreasing in the number of ongoing auctions at a diminishing rate, and decreasing over time. These results provide managerial insight into the effect of how online auctions are released and overlap. The proposed model is based on the framework of generalized linear models using a zero‐inflated gamma distribution. Empirical analysis and parameter estimation is based on data from eBay auctions conducted by Dell. Copyright © 2011 John Wiley & Sons, Ltd.     

标准化风险度量与投资决策的双目标优化

标准化风险度量(SRM)作为投资中的一种新的风险度量，其较传统风险度量的优点及在投资项目比较中特有的优良性质已被证明，本文导出SRM在概率意义下的一种重要的等价形式，并以此为基础建立以标准化风险(SR)为目标或约束的投资决策优化方法，该方法的核心是将以SRM为风险度量的优化问题转化为线性规划问题的优化技术，此技术结合利用统计抽样数据，可优化含有大量金融工具的投资组合，本文在考虑交易成本的情形下建立了最小化投资的标准化风险的同时最大化其期望有效回报(EER)的双目标优化模型，最后，具体考虑了上证30指数股票组合的优化以说明所建议的方法及模型的应用并实证它们的可行、合理及优良性，其中统计抽样基于近期历史数据。     

Utility Maximization with Convex Constraints and Partial Information

We consider a market model where stock returns satisfy a stochastic differential equation with an unobservable, stochastic drift process. The investor’s objective is to maximize expected utility of terminal wealth, but investment decisions are based on the knowledge of the stock prices only. The performance of the resulting highly risky strategies can be improved considerably by imposing convex constraints covering e.g. short selling restrictions. Using filtering methods we transform the model to a model with full information. We provide a verification result and show how results on optimization under convex constraints can be used directly for a continuous time Markov chain model for the drift. In special cases we derive representations of the optimal trading strategies, including a stochastic volatility model. Supported by the Austrian Science Fund, FWF grant P17947-N12.     

Sensitivity analysis and model optimization for reaction-diffusion systems

This paper presents a computational framework for the optimization and sensitivity analysis of a process whose state depends upon several parameter functions. Assuming that the process is described by a system of quasilinear, parabolic, partial differential equations, we show how determining the problem parameters so as to improve an associated objective functional is directly related to knowing the state function sensitivities. An expression for the gradient of the objective functional in terms of the solutions of an adjoint system enables one to bypass the calculation of state function sensitivities. These concepts are illustrated for a simple model of cooperative processes in chemical kinetics. Since sensitivity analysis and model optimization are important tools for investigating parameter dependence and validating mathematical models, research developments in such diverse fields as optimal design theory, chemical kinetics, and parameter identification are important motivations for this paper.This author would like to gratefully acknowledge Dr. M. Delle Donne, EGG, for several helpful discussions.This author was partially supported by NSF Grant No. CMS-80-05677.     

Structural results for partially observed control models

A general partially observed control model with discrete time parameter is investigated. Our main interest concerns monotonicity results and bounds for the value functions and for optimal policies. In particular, we show how the value functions depend on the observation kernels and we present conditions for a lower bound of an optimal policy. Our approach is based on two multivariate stochastic orderings: theTP ₂ ordering and the Blackwell ordering.Dedicated to Prof. Dr. K. Hinderer on the occassion of his 60^th birthday     

Multiobjective stochastic programming for feed formulation

The minimum cost linear programming model used traditionally for feed formulation does not take account of variability of nutrients in feed ingredients. Therefore, it may be that the nutrient requirements of the animal are not adequately met. In this paper, we show how a multiobjective stochastic model that permits confronting the cost of the ration with the probabilities of meeting the nutrient requirements of the animal can enhance the process of animal diet formulation. The model presented here does not require any a priori information from the decision maker, eliciting his preferences through an interactive process. This is the main advantage in relation to other models found in the literature for treating the problem of nutrient variability, which introduce stochastic constraints in the single objective minimum cost model requiring fixing the level of probability desired for each one of the nutrients in advance.     

Three steps multiobjective decision process for software release planning

This paper deals with how to determine which features should be included in the software to be developed. Metaheuristic techniques have been applied to this problem and can help software developers when they face contradictory goals. We show how the knowledge and experience of human experts can be enriched by these techniques, with the idea of obtaining a better requirements selection than that produced by expert judgment alone. This objective is achieved by embedding metaheuristics techniques into a requirements management tool that takes advantage of them during the execution of the development stages of any software development project. © 2015 Wiley Periodicals, Inc. Complexity 21: 250–262, 2016     

Geometry of interpolation sets in derivative free optimization

We consider derivative free methods based on sampling approaches for nonlinear optimization problems where derivatives of the objective function are not available and cannot be directly approximated. We show how the bounds on the error between an interpolating polynomial and the true function can be used in the convergence theory of derivative free sampling methods. These bounds involve a constant that reflects the quality of the interpolation set. The main task of such a derivative free algorithm is to maintain an interpolation sampling set so that this constant remains small, and at least uniformly bounded. This constant is often described through the basis of Lagrange polynomials associated with the interpolation set. We provide an alternative, more intuitive, definition for this concept and show how this constant is related to the condition number of a certain matrix. This relation enables us to provide a range of algorithms whilst maintaining the interpolation set so that this condition number or the geometry constant remain uniformly bounded. We also derive bounds on the error between the model and the function and between their derivatives, directly in terms of this condition number and of this geometry constant.     

Estimating the parameters of a fatigue model using Benders’ decomposition

This paper shows how Benders decomposition can be used for estimating the parameters of a fatigue model. The objective function of such model depends on five parameters of different nature. This makes the parameter estimation problem of the fatigue model suitable for the Benders decomposition, which allows us to use well-behaved and robust parameter estimation methods for the different subproblems. To build the Benders cuts, explicit formulas for the sensitivities (partial derivatives) are obtained. This permits building the classical iterative method, in which upper and lower bounds of the optimal value of the objective function are obtained until convergence. Two alternative objective functions to be optimized are the likelihood and the sum of squares error functions, which relate to the maximum likelihood and the minimum error principles, respectively. The method is illustrated by its application to a real-world problem.     

Processing-plus-wait due dates in single-machine scheduling

We study the problem of schedulingn jobs on a single machine. Each job is assigned a processing-plus-wait due date, which is an affine-linear function of its processing time. The objective is to minimize the symmetric earliness and tardiness costs. We analyze a combined decision model which includes computing both the optimal job sequence and optimal due date parameters. For the quadratic objective function, we propose a heuristic solution based on a bicriterion approach. Additionally, we provide computational results to compare this model with two simpler models. For the maximum objective function, we show that it is efficiently solved by the shortest processing time sequence.Part of this research was undertaken during a visit of the first author at the University of Manitobe, Canada in 1991. This visit was supported in part by the Natural Sciences and Engineering Research Council of Canada under Grant OPG0036424. The numerical results were obtained with the assistance of T. P. Lindenthal. The authors are thankful for his help.