摘要
Forill-posedbilevelprogrammingproblem,theoptimisticsolutionisalwaysthebestdecisionfortheupperlevelbutitisnotalwaysthebestchoiceforbothlevelsiftheauthorsconsiderthemodel'ssatisfactorydegreeinapplication.Toacquireamoresatisfyingsolutionthantheoptimisticonetorealizethetwolevels'mostprofits,thispaperconsidersbothlevels'satisfactorydegreeandconstructsaminimizationproblemofthetwoobjectivefunctionsbyweightedsummation.Then,usingthedualitygapofthelowerlevelasthepenaltyfunction,theauthorstransferthesetwolevelsproblemtoasingleoneandproposeacorrespondingalgorithm.Finally,theauthorsgiveanexampletoshowamoresatisfyingsolutionthantheoptimisticsolutioncanbeachievedbythisalgorithm.
出版日期
2013年06月16日(中国Betway体育网页登陆平台首次上网日期,不代表论文的发表时间)