This paper is based on a resource constrained active network project;the constraint of the local resource and the time constraint of the cooperation resource are considered simultaneously.And the respective benefit of...This paper is based on a resource constrained active network project;the constraint of the local resource and the time constraint of the cooperation resource are considered simultaneously.And the respective benefit of the manager and cooperation partners is also considered simultaneously.And a cooperation planning model based on bilevel multi-objective programming is de-signed,according to the due time and total cost.And an extended CNP based on the permitted range for resource and time requests is presented.A larger task set in scheduling cycle is on the permitting for the request of cooperation resource and time while the task manager itself may be permitted biding for tasks.As a result,the optimization space for the cooperation planning is enlarged.So not every bidding task is successfully bid by invitee,and the task manager itself takes on some bidding tasks.Finally,the genetic algorithm is given and the validity and feasibility of the model is proved by a case.展开更多
In this paper, we discuss Markovian decision programming with recursive vector-reward andgive an algorithm to find optimal policies. We prove that: (1) There is a Markovian optimal policy for the nonstationary case; (...In this paper, we discuss Markovian decision programming with recursive vector-reward andgive an algorithm to find optimal policies. We prove that: (1) There is a Markovian optimal policy for the nonstationary case; (2) Thereis a stationary optimal policy for the stationary case.展开更多
This paper deals with the continuous time Markov decision programming (briefly CTMDP) withunbounded reward rate.The economic criterion is the long-run average reward. To the models withcountable state space,and compac...This paper deals with the continuous time Markov decision programming (briefly CTMDP) withunbounded reward rate.The economic criterion is the long-run average reward. To the models withcountable state space,and compact metric action sets,we present a set of sufficient conditions to ensurethe existence of the stationary optimal policies.展开更多
Considering a periodic review system where the online seller allows the customers to pay when the products are delivered to them(referred as cash-on-delivery payment scheme in this paper),the authors investigate the s...Considering a periodic review system where the online seller allows the customers to pay when the products are delivered to them(referred as cash-on-delivery payment scheme in this paper),the authors investigate the seller's joint pricing and inventory control policy with a finite planning horizon.In particular,the authors incorporate the customers' possible order cancellation behavior with the cash-on-delivery scheme.It can be proven that the base-stock list price policy is optimal under mild conditions.The authors also analyze the impact of the customers' forward looking behavior on the optimal policy.展开更多
基金Supported by the National Natural Science Foundation of China under Grant No.70471073the Natural Science Foundation of Jiangsu Education Department of China under Grant No.04KJB520169.
文摘This paper is based on a resource constrained active network project;the constraint of the local resource and the time constraint of the cooperation resource are considered simultaneously.And the respective benefit of the manager and cooperation partners is also considered simultaneously.And a cooperation planning model based on bilevel multi-objective programming is de-signed,according to the due time and total cost.And an extended CNP based on the permitted range for resource and time requests is presented.A larger task set in scheduling cycle is on the permitting for the request of cooperation resource and time while the task manager itself may be permitted biding for tasks.As a result,the optimization space for the cooperation planning is enlarged.So not every bidding task is successfully bid by invitee,and the task manager itself takes on some bidding tasks.Finally,the genetic algorithm is given and the validity and feasibility of the model is proved by a case.
基金The project is supported by National Natural Science Foundation of China
文摘In this paper, we discuss Markovian decision programming with recursive vector-reward andgive an algorithm to find optimal policies. We prove that: (1) There is a Markovian optimal policy for the nonstationary case; (2) Thereis a stationary optimal policy for the stationary case.
基金This paper was prepared with the support of the National Youth Science Foundation
文摘This paper deals with the continuous time Markov decision programming (briefly CTMDP) withunbounded reward rate.The economic criterion is the long-run average reward. To the models withcountable state space,and compact metric action sets,we present a set of sufficient conditions to ensurethe existence of the stationary optimal policies.
基金supported by the National Natural Science Foundation of China under Grant Nos.71201175,71301032,and 71171088Guangdong Natural Science Foundation under Grant Nos.S2011040001069 and S2012040008081Guangdong Educational Bureau Humanity&Social Science Fund under Grant No.2013WYXM0001
文摘Considering a periodic review system where the online seller allows the customers to pay when the products are delivered to them(referred as cash-on-delivery payment scheme in this paper),the authors investigate the seller's joint pricing and inventory control policy with a finite planning horizon.In particular,the authors incorporate the customers' possible order cancellation behavior with the cash-on-delivery scheme.It can be proven that the base-stock list price policy is optimal under mild conditions.The authors also analyze the impact of the customers' forward looking behavior on the optimal policy.
