We consider a distribution system with one supplier and two retailers. For the two retailers, they face different demand and are both risk averse. We study a single period model which the supplier has ample goods and ...We consider a distribution system with one supplier and two retailers. For the two retailers, they face different demand and are both risk averse. We study a single period model which the supplier has ample goods and the retailers order goods separately. Market search is measured as the fraction of customers who unsatisfied with their ＂local＂ retailer due to stock-out, and search for the goods at the other retailer before leaving the system. We investigate how the retailers game for order quantity in a Conditional Value-at-Risk framework and study how risk averse degree, market search level, holding cost and backorder cost influence the optimal order strategies. Furthermore, we use uniform distribution to illustrate these results and obtain Nash equilibrium of order strategies.展开更多
We consider risk minimization problems for Markov decision processes. From a standpoint of making the risk of random reward variable at each time as small as possible, a risk measure is introduced using conditional va...We consider risk minimization problems for Markov decision processes. From a standpoint of making the risk of random reward variable at each time as small as possible, a risk measure is introduced using conditional value-at-risk for random immediate reward variables in Markov decision processes, under whose risk measure criteria the risk-optimal policies are characterized by the optimality equations for the discounted or average case. As an application, the inventory models are considered.展开更多
The subset sum problem is a combinatorial optimization problem,and its complexity belongs to the nondeterministic polynomial time complete(NP-Complete)class.This problem is widely used in encryption,planning or schedu...The subset sum problem is a combinatorial optimization problem,and its complexity belongs to the nondeterministic polynomial time complete(NP-Complete)class.This problem is widely used in encryption,planning or scheduling,and integer partitions.An accurate search algorithm with polynomial time complexity has not been found,which makes it challenging to be solved on classical computers.To effectively solve this problem,we translate it into the quantum Ising model and solve it with a variational quantum optimization method based on conditional values at risk.The proposed model needs only n qubits to encode 2ndimensional search space,which can effectively save the encoding quantum resources.The model inherits the advantages of variational quantum algorithms and can obtain good performance at shallow circuit depths while being robust to noise,and it is convenient to be deployed in the Noisy Intermediate Scale Quantum era.We investigate the effects of the scalability,the variational ansatz type,the variational depth,and noise on the model.Moreover,we also discuss the performance of the model under different conditional values at risk.Through computer simulation,the scale can reach more than nine qubits.By selecting the noise type,we construct simulators with different QVs and study the performance of the model with them.In addition,we deploy the model on a superconducting quantum computer of the Origin Quantum Technology Company and successfully solve the subset sum problem.This model provides a new perspective for solving the subset sum problem.展开更多
A new stochastic volatility（SV）method to estimate the conditional value at risk（CVaR）is put forward.Firstly,it makes use of SV model to forecast the volatility of return.Secondly,the Markov chain Monte Carlo（MCMC...A new stochastic volatility（SV）method to estimate the conditional value at risk（CVaR）is put forward.Firstly,it makes use of SV model to forecast the volatility of return.Secondly,the Markov chain Monte Carlo（MCMC）simulation and Gibbs sampling have been used to estimate the parameters in the SV model.Thirdly,in this model,CVaR calculation is immediate.In this way,the SV-CVaR model overcomes the drawbacks of the generalized autoregressive conditional heteroscedasticity value at risk（GARCH-VaR）model.Empirical study suggests that this model is better than GARCH-VaR model in this field.展开更多
为推进电网企业代理购电工作,本文提出了一种基于条件风险价值(Conditonl Value at Risk,CVaR)的电网企业代理购电交易策略风险评价和控制模型。分析了电网企业代理购电业务的开展形式和服务,并以江苏省电力市场为例分析了电力交易的多...为推进电网企业代理购电工作,本文提出了一种基于条件风险价值(Conditonl Value at Risk,CVaR)的电网企业代理购电交易策略风险评价和控制模型。分析了电网企业代理购电业务的开展形式和服务,并以江苏省电力市场为例分析了电力交易的多年(年度)、月度、月内市场的价格波动风险,考虑到电力市场价格波动剧烈和明显的尖峰厚尾特征,建立了代理购电业务交易策略CVaR模型,并利用蒙特卡罗模拟法实现求解最优策略。利用数值算例验证了该模型的有效性,结果表明其可以降低CVaR和在险价值(Value at Risk,VaR)两个风险指标,有效降低了风险。展开更多
为进一步提升综合能源系统环境效益,减少新能源出力不确定性所带来的潜在风险,提出了计及条件风险价值(conditional value at risk,CVaR)以及阶梯碳交易的综合能源系统优化调度模型。考虑到系统风电和光伏出力不确定性可能带来的影响,...为进一步提升综合能源系统环境效益,减少新能源出力不确定性所带来的潜在风险,提出了计及条件风险价值(conditional value at risk,CVaR)以及阶梯碳交易的综合能源系统优化调度模型。考虑到系统风电和光伏出力不确定性可能带来的影响,采用条件风险价值量度不确定性带来的潜在风险,并将碳捕获技术、电转气设备以及阶梯式碳交易机制引入系统调度模型,构建了综合考虑系统运行成本和碳交易成本的优化调度目标函数,由于所建立模型为混合整数规划问题,采用CPLEX求解器进行求解,设置4种场景进行验证分析,算例表明所提模型可有效减少二氧化碳排放,在兼顾经济性和环境性的同时引入CVaR,可避免由于忽略风光不确定性所带来的较为乐观的调度结果,使系统最终调度结果更为合理。展开更多
基金Supported by the National Natural Science Foundation of China (70471034, A0324666)
文摘We consider a distribution system with one supplier and two retailers. For the two retailers, they face different demand and are both risk averse. We study a single period model which the supplier has ample goods and the retailers order goods separately. Market search is measured as the fraction of customers who unsatisfied with their ＂local＂ retailer due to stock-out, and search for the goods at the other retailer before leaving the system. We investigate how the retailers game for order quantity in a Conditional Value-at-Risk framework and study how risk averse degree, market search level, holding cost and backorder cost influence the optimal order strategies. Furthermore, we use uniform distribution to illustrate these results and obtain Nash equilibrium of order strategies.
文摘We consider risk minimization problems for Markov decision processes. From a standpoint of making the risk of random reward variable at each time as small as possible, a risk measure is introduced using conditional value-at-risk for random immediate reward variables in Markov decision processes, under whose risk measure criteria the risk-optimal policies are characterized by the optimality equations for the discounted or average case. As an application, the inventory models are considered.
基金supported by the National Key R&D Program of China(Grant No.2019YFA0308700)the Innovation Program for Quantum Science and Technology(Grant No.2021ZD0301500)。
文摘The subset sum problem is a combinatorial optimization problem,and its complexity belongs to the nondeterministic polynomial time complete(NP-Complete)class.This problem is widely used in encryption,planning or scheduling,and integer partitions.An accurate search algorithm with polynomial time complexity has not been found,which makes it challenging to be solved on classical computers.To effectively solve this problem,we translate it into the quantum Ising model and solve it with a variational quantum optimization method based on conditional values at risk.The proposed model needs only n qubits to encode 2ndimensional search space,which can effectively save the encoding quantum resources.The model inherits the advantages of variational quantum algorithms and can obtain good performance at shallow circuit depths while being robust to noise,and it is convenient to be deployed in the Noisy Intermediate Scale Quantum era.We investigate the effects of the scalability,the variational ansatz type,the variational depth,and noise on the model.Moreover,we also discuss the performance of the model under different conditional values at risk.Through computer simulation,the scale can reach more than nine qubits.By selecting the noise type,we construct simulators with different QVs and study the performance of the model with them.In addition,we deploy the model on a superconducting quantum computer of the Origin Quantum Technology Company and successfully solve the subset sum problem.This model provides a new perspective for solving the subset sum problem.
基金Sponsored by the National Natural Science Foundation of China(70571010)
文摘A new stochastic volatility（SV）method to estimate the conditional value at risk（CVaR）is put forward.Firstly,it makes use of SV model to forecast the volatility of return.Secondly,the Markov chain Monte Carlo（MCMC）simulation and Gibbs sampling have been used to estimate the parameters in the SV model.Thirdly,in this model,CVaR calculation is immediate.In this way,the SV-CVaR model overcomes the drawbacks of the generalized autoregressive conditional heteroscedasticity value at risk（GARCH-VaR）model.Empirical study suggests that this model is better than GARCH-VaR model in this field.
文摘为推进电网企业代理购电工作,本文提出了一种基于条件风险价值(Conditonl Value at Risk,CVaR)的电网企业代理购电交易策略风险评价和控制模型。分析了电网企业代理购电业务的开展形式和服务,并以江苏省电力市场为例分析了电力交易的多年(年度)、月度、月内市场的价格波动风险,考虑到电力市场价格波动剧烈和明显的尖峰厚尾特征,建立了代理购电业务交易策略CVaR模型,并利用蒙特卡罗模拟法实现求解最优策略。利用数值算例验证了该模型的有效性,结果表明其可以降低CVaR和在险价值(Value at Risk,VaR)两个风险指标,有效降低了风险。
文摘为进一步提升综合能源系统环境效益,减少新能源出力不确定性所带来的潜在风险,提出了计及条件风险价值(conditional value at risk,CVaR)以及阶梯碳交易的综合能源系统优化调度模型。考虑到系统风电和光伏出力不确定性可能带来的影响,采用条件风险价值量度不确定性带来的潜在风险,并将碳捕获技术、电转气设备以及阶梯式碳交易机制引入系统调度模型,构建了综合考虑系统运行成本和碳交易成本的优化调度目标函数,由于所建立模型为混合整数规划问题,采用CPLEX求解器进行求解,设置4种场景进行验证分析,算例表明所提模型可有效减少二氧化碳排放,在兼顾经济性和环境性的同时引入CVaR,可避免由于忽略风光不确定性所带来的较为乐观的调度结果,使系统最终调度结果更为合理。
