检索结果-南通市图书馆

On the Effects of Risk Pooling in Supply Chain Management:Review and Extensions

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

Acta Mathematicae Applicatae Sinica 2009年第4期25卷 709-722页

作者： Xia Cai dong-lei du Faculty of Business Administration University of New Brunswick P.O. Box 4400 Fredericton NB Canada E3B 5A3

The primary challenge in supply chain management （SCM） is matching supply with uncertain demand. Risk pooling is an efficient and promising strategy to meet this challenge by reducing the underlying demand uncertainty through aggregation. The main focus of this paper is to analyze the effects of risk pooling under different supply chain settings. There are two main contributions. First, we propose a mathematical framework which serves the multi-purpose of （1） unifying existing models on risk pooling in the literature, （2） providing new facets and insights of understanding existing results on risk pooling, and （3） setting up new ground for extending existing models and results. Second; we investigate one interesting effect of risk pooling, namely, the decreasing marginal return （or supermodularity）. We show that there are decreasing marginal returns in risk pooling practices under certain conditions, specifically when the demand is independent and identically distributed （I.I.D.） and normally distributed.

关键词： Lead Time Supply Chain Management Distribution Center Order Quantity Retail Store

The Global Convergence of Self-Scaling BFGS Algorithm with Nonmonotone Line Search for Unconstrained Nonconvex Optimization Problems

维普期刊数据库

同方期刊数据库评论

在线全文

学校读者我要写书评

暂无评论

Acta Mathematica Sinica,English Series 2007年第7期23卷 1233-1240页

作者： Hong Xia YIN dong lei du Chinese Academy of Sciences Research Center on Data Technology and Knowledge Economy Department of Mathematics Graduate University of the Chinese Academy of Sciences Faculty of Administration University of New Brunswick

The self-scaling quasi-Newton method solves an unconstrained optimization problem by scaling the Hessian approximation matrix before it is updated at each iteration to avoid the possible large eigenvalues in the Hessian approximation matrices of the objective function. It has been proved in the literature that this method has the global and superlinear convergence when the objective function is convex （or even uniformly convex）. We propose to solve unconstrained nonconvex optimization problems by a self-scaling BFGS algorithm with nonmonotone linear search. Nonmonotone line search has been recognized in numerical practices as a competitive approach for solving large-scale nonlinear problems. We consider two different nonmonotone line search forms and study the global convergence of these nonmonotone self-scale BFGS algorithms. We prove that, under some weaker condition than that in the literature, both forms of the self-scaling BFGS algorithm are globally convergent for unconstrained nonconvex optimization problems.

关键词： nonmonotone line search self-scaling BFGS method global convergence

Randomized On-Line Scheduling Similar Jobs to Minimize Makespan on Two Identical Processors

维普期刊数据库

同方期刊数据库评论

在线全文

学校读者我要写书评

暂无评论

Acta Mathematicae Applicatae Sinica 2005年第3期21卷 485-488页

作者： dong-lei du Faculty of Administration University of New Brunswick P.O. Box 4400 Fredericton NB E3B 5V4 Canada

In this paper we consider an on-line scheduling problem, where jobs with similar processing times within [1, r] arrive one by one to be scheduled in an on-line setting on two identical parallel processors without preemption. The objective is to nlinimize makespan. We devise a randomized on-line algorithm for this problem along with a lower bound.

关键词： On-line algorithm randomized algorithm scheduling preemption

An Almost Tight Lower Bound for the Scheduling Problem to Meet Two Min-Sum Objectives

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

Journal of the Operations Research Society of China 2013年第1期1卷 159-161页

作者： dong-lei du Da-chuan Xu Faculty of Business Administration University of New BrunswickNew BrunswickCanada E3B 9Y2 Department of Applied Mathematics Beijing University of Technology100 PingleyuanChaoyang DistrictBeijing 100124P.R.China

In this note,we provide an almost tight lower bound for the scheduling problem to meet two min-sum objectives considered by Angel et *** ***.35(1):69–73,2007.

关键词： Bi-criteria Scheduling Approximation algorithm

Pricing Decisions in dual-Channel Closed-Loop Supply Chain Under Retailer’s Risk Aversion and Fairness Concerns

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

Journal of the Operations Research Society of China 2021年第3期9卷 641-657页

作者： Chun-Fa Li Xue-Qing Guo dong-lei du Department of Management Tianjin University of TechnologyTianjin 300384China Faculty of Management University of New BrunswickFrederictonNB E3B 5A3Canada

This paper studies the price decisions in a dual-channel closed-loop supply chain with a risk-averse retailer and a risk-neutral manufacturer by modeling and analyzing three cases:(1)the retailer does not have fairness concerns;(2)the retailer has fairness concerns and the manufacturer considers it;and(3)the retailer has fairness concerns and the manufacturer does not consider *** effects of risk aversion and fairness concerns on the pricing decisions,profits and demand are examined in differing scenarios.

关键词： Risk aversion Fairness concerns dual-channel Closed-loop supply chain

A Note on Submodularity Preserved Involving the Rank Functions

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

Journal of the Operations Research Society of China 2019年第3期7卷 399-407页

作者： Min Li dong-lei du Da-Chuan Xu Zhen-Ning Zhang School of Mathematics and Statistics Shandong Normal UniversityJinan 250358China Faculty of Business Administration University of New BrunswickFrederictonCanada College of Applied Sciences Beijing University of TechnologyBeijing 100124China

In many kinds of games with economic significance,it is very important to study the submodularity of *** this paper,wemainly study the problem of maximizing a concave function over an intersection of two *** obtain that the submod-ularity may not be preserved,but it involves one maximal submodular problem(or minimal supermodular problem)with some ***,we also present examples showing that these conditions can be satisfied.

关键词： Matroid Submodular function Rank function Convexclosure Game

A Primal-dual Algorithm for the Generalized Prize-Collecting Steiner Forest Problem

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

Journal of the Operations Research Society of China 2017年第2期5卷 219-231页

作者： Lu Han Da-Chuan Xu dong-lei du Chen-Chen Wu Department of Information and Operations Research Beijing University of TechnologyBeijing 100124China Faculty of Business Administration University of New BrunswickFrederictonNB E3B 5A3Canada College of Science Tianjin University of TechnologyTianjin 300384China

In this paper,we consider the generalized prize-collecting Steiner forest problem,extending the prize-collecting Steiner forest *** this problem,we are given a connected graph G=(V,E)and a set of vertex sets V={V1,V2,…,Vl}.Every edge in E has a nonnegative cost,and every vertex set in V has a nonnegative penalty *** a given edge set F⊆E,vertex set Vi∈V is said to be connected by edge set F if Vi is in a connected component of the F-spanned *** objective is to find such an edge set F such that the total edge cost in F and the penalty cost of the vertex sets not connected by F is *** main contribution is to give a 3-approximation algorithm for this problem via the primal-dual method.

关键词： Prize-collecting Steiner forest Approximation algorithm Primal-dual

Simultaneous Approximation of Multi-criteria Submodular Function Maximization

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

Journal of the Operations Research Society of China 2014年第3期2卷 271-290页

作者： dong-lei du Yu Li Nai-Hua Xiu Da-Chuan Xu Faculty of Business Administration University of New BrunswickFrederictonNB E3B 9Y2Canada Department of Mathematics School of ScienceBeijing Jiaotong University3 ShangyuancunHaidian DistrictBeijing 100044China Department of Applied Mathematics Beijing University of Technology100 PingleyuanChaoyang DistrictBeijing 100124China

Recently intensive interest has been raised on approximation of the NPhard submodular maximization problem due to their theoretical and practical *** this work,we extend this line of research by focusing on the simultaneous approximation of multiple submodular function *** address the existence and nonexistence results for both deterministic and randomized approximation when the submodular functions are symmetric and asymmetric,respectively,along with algorithmic *** offer complete characterization of the symmetric case and partial results on the asymmetric case.

关键词： Multi-criteria Submodular function maximization Approximation algorithm Existence

Set-Membership Filtering Approach to Dynamic Event-Triggered Fault Estimation for a Class of Nonlinear Time-Varying Complex Networks

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

IEEE/CAA Journal of Automatica Sinica 2024年第3期11卷 638-648页

作者： Xiaoting du lei Zou Maiying Zhong the College of Electrical Engineering and Automation Shandong University of Science and TechnologyQingdao 266590China IEEE the College of Information Science and Technology Donghua UniversityShanghai 201620 the Engineering Research Center of Digitalized Textile and Fashion Technology Ministry of EducationShanghai 201620China

The present study addresses the problem of fault estimation for a specific class of nonlinear time-varying complex networks,utilizing an unknown-input-observer approach within the framework of dynamic event-triggered mechanism(DETM).In order to optimize communication resource utilization,the DETM is employed to determine whether the current measurement data should be transmitted to the estimator or *** guarantee a satisfactory estimation performance for the fault signal,an unknown-input-observer-based estimator is constructed to decouple the estimation error dynamics from the influence of fault *** aim of this paper is to find the suitable estimator parameters under the effects of DETM such that both the state estimates and fault estimates are confined within two sets of closed ellipsoid *** techniques of recursive matrix inequality are applied to derive sufficient conditions for the existence of the desired estimator,ensuring that the specified performance requirements are met under certain ***,the estimator gains are derived by minimizing the ellipsoid domain in the sense of trace and a recursive estimator parameter design algorithm is then ***,a numerical example is conducted to demonstrate the effectiveness of the designed estimator.

关键词： Dynamic event-triggered mechanism(DETM) fault estimation nonlinear time-varying complex networks set-member-ship filtering unknown input observer