Ho-Lee利率模型下带有零息票债券的投资-消费模型

在随机利率环境下研究一类带有零息票债券的投资-消费问题,其中假设无风险利率是服从Ho-Lee利率模型的随机过程,且金融市场由一种无风险资产、一种风险资产和一种零息票债券所构成。投资人希望选择一种最优投资-消费策略来最大化其有限时间段内终端财富和累积消费的期望效用。文章应用动态规划原理和变量替换方法得到了幂效用和对数效用下最优投资-消费策略的显示解。算例分析演示了最优投资-消费策略随市场参数的变化而变化的动态行为,并给出了一些经济学涵义。     

Clickstream Data and Inventory Management: Model and Empirical Analysis

We consider firms that feature their products on the Internet but take orders offline. Click and order data are disjoint on such non‐transactional websites, and their matching is error‐prone. Yet, their time separation may allow the firm to react and improve its tactical planning. We introduce a dynamic decision support model that augments the classic inventory planning model with additional clickstream state variables. Using a novel data set of matched online clickstream and offline purchasing data, we identify statistically significant clickstream variables and empirically investigate the value of clickstream tracking on non‐transactional websites to improve inventory management. We show that the noisy clickstream data is statistically significant to predict the propensity, amount, and timing of offline orders. A counterfactual analysis shows that using the demand information extracted from the clickstream data can reduce the inventory holding and backordering cost by 3% to 5% in our data set.     

Sequence Independent Lifting in Mixed Integer Programming

We investigate lifting, i.e., the process of taking a valid inequality for a polyhedron and extending it to a valid inequality in a higher dimensional space. Lifting is usually applied sequentially, that is, variables in a set are lifted one after the other. This may be computationally unattractive since it involves the solution of an optimization problem to compute a lifting coefficient for each variable. To relieve this computational burden, we study sequence independent lifting, which only involves the solution of one optimization problem. We show that if a certain lifting function is superadditive, then the lifting coefficients are independent of the lifting sequence. We introduce the idea of valid superadditive lifting functions to obtain good aproximations to maximum lifting. We apply these results to strengthen Balas' lifting theorem for cover inequalities and to produce lifted flow cover inequalities for a single node flow problem.     

Supply chain configuration for diffusion of new products: An integrated optimization approach

We develop an integrated/hybrid optimization model for configuring new products’ supply chains while explicitly considering the impact of demand dynamics during new products’ diffusion. The hybrid model simultaneously determines optimal production/sales plan and supply chain configuration. The production and sales plan provides decisions on the optimal timing to launch a new product, as well as the production and sales quantity in each planning period. The supply chain configuration provides optimal selection of options and safety stock level kept at each supply chain function. Extensive computational experiments on randomly generated testbed problems indicate that the hybrid modeling and solution approach significantly outperforms non-hybrid alternative modeling and solution approaches under various diffusion and supply chain topologies. We provide insights on optimal production/sales plan and supply chain configuration for new products during their diffusion process. Also, managerial implications relevant to effectiveness of the hybrid approach are discussed.     

On Inverse Problems of Optimum Perfect Matching

As far as we know, for most polynomially solvable network optimization problems, their inverse problems under l ₁ or l norm have been studied, except the inverse maximum-weight matching problem in non-bipartite networks. In this paper we discuss the inverse problem of maximum-weight perfect matching in a non-bipartite network under l ₁ and l norms. It has been proved that the inverse maximum-weight perfect matching under l norm can be formulated as a maximum-mean alternating cycle problem of an undirected network, and can be solved in polynomial time by a binary search algorithm and in strongly polynomial time by an ascending algorithm, and under l ₁ norm it can be solved by the ellipsoid method. Therefore, inverse problems of maximum-weight perfect matching under l ₁ and l norms are solvable in polynomial time.     

一类两层规划问题模糊满意解的遗传算法

在现有两层规划问题求解方法的基础上,提出用浮点数编码的遗传算法求解该问题模糊满意解的新方法．这种方法每次提供给决策者一组近似最优解,通过决策者的比较、评价和选择,在交互过程中得到各决策者都满意的解．该方法不仅可以给决策者提供更多的决策环境信息,而且可以适应决策者偏好的变化,使得决策过程更合理,更符合人的认识过程．     

Vendor Selection with Bundling: A Comment*

In a recent article by Rosenthal, Zydiak, and Chaudhry (1995), a mixed integer linear programming model was introduced to solve the vendor selection problem for the case in which the vendor can sell items individually or as part of a bundle. Each vendor offered only one type of bundle, and the buyer could purchase at most one bundle per vendor. The model employed n(m+ 1) binary variables, where n is the number of vendors and m is the number of products they sell. The existing model can lead to a purchasing paradox: it may force the buyer to pay more to receive less. We suggest a reformulation of the same problem that (i) eliminates this paradox and reveals a more cost-effective purchasing strategy; (ii) uses only n integer variables and significantly reduces the computational workload; and (iii) permits the buyer to purchase more than one bundle per vendor.     

An integrated approach for water resources decision making under interactive and compound uncertainties

In recent years, the issue of water allocation among competing users has been of great concern for many countries due to increasing water demand from population growth and economic development. In water management systems, the inherent uncertainties and their potential interactions pose a significant challenge for water managers to identify optimal water-allocation schemes in a complex and uncertain environment. This paper thus proposes a methodology that incorporates optimization techniques and statistical experimental designs within a general framework to address the issues of uncertainty and risk as well as their correlations in a systematic manner. A water resources management problem is used to demonstrate the applicability of the proposed methodology. The results indicate that interval solutions can be generated for the objective function and decision variables, and a number of decision alternatives can be obtained under different policy scenarios. The solutions with different risk levels of constraint violation can help quantify the relationship between the economic objective and the system risk, which is meaningful for supporting risk management. The experimental data obtained from the Taguchi's orthogonal array design are useful for identifying the significant factors affecting the means of total net benefits. Then the findings from the mixed-level factorial experiment can help reveal the latent interactions between those significant factors at different levels and their effects on the modeling response.     

A hybrid genetic algorithm/mathematical programming approach to the multi-family flowshop scheduling problem with lot streaming

This paper presents a hybrid genetic algorithm/mathematical programming heuristic for the n-job, m-machine flowshop problems with lot streaming. The number of sublots for each job and the size of sublots are directly addressed by the heuristic and setups may be sequence-dependent. A new aspect of the problem, the interleaving of sublots from different jobs in the processing sequence, is developed and addressed. Computational results from 12 randomly generated test sets of 24 problems each are presented.     

Duality of the improved algebraic method (DIAM)

In this note we present a variant of the improved algebraic method (IAM) using a duality analysis to solve linear programming (LP) problems where more insights to the method are presented. When the coordinates of all vertices are computed, any feasible point can be expressed as a linear combination of the vertices. The objective function is expressed as a weighted sum of its evaluation at the feasible vertices and the optimal point is associated with the highest/lowest coefficient of the weighted sum.