简介：Forill-posedbilevelprogrammingproblem,theoptimisticsolutionisalwaysthebestdecisionfortheupperlevelbutitisnotalwaysthebestchoiceforbothlevelsiftheauthorsconsiderthemodel'ssatisfactorydegreeinapplication.Toacquireamoresatisfyingsolutionthantheoptimisticonetorealizethetwolevels'mostprofits,thispaperconsidersbothlevels'satisfactorydegreeandconstructsaminimizationproblemofthetwoobjectivefunctionsbyweightedsummation.Then,usingthedualitygapofthelowerlevelasthepenaltyfunction,theauthorstransferthesetwolevelsproblemtoasingleoneandproposeacorrespondingalgorithm.Finally,theauthorsgiveanexampletoshowamoresatisfyingsolutionthantheoptimisticsolutioncanbeachievedbythisalgorithm.