- 6
- 0
- 约5.88万字
- 约 60页
- 2018-12-28 发布于广东
- 举报
establisharelaxationlinear and
equivalentproblem,we programmingdevelopaccelerating
anew
proposeacceleratingglobaloptimizationalgorithm.
measures((DT)and(BTT))to
Themeasuresare intothebranch-and-boundasan de-
incorporated processaccelerating
thatthesolution isenhancedandthe hasbetter
vice,80 procedure proposedalgorithm
showthat canbe
experimentscomputationalefficiencyimproved
performance.Numerical
numberofthe canbe reduced.
operationssignificantly
obviously,specially,thebrangching
combinethe method Sheneta1.witha
proposedby
Finally,we globaloptimization
suitable to anew for
deletingtechniqueproposeacceleratingtrapezoidalalgorithmsolving
nonlinearsum-of-ratios aconvexset.This offersa
problem(SRP)over techniquepos-
tocut allora ofthe inwhichthe
sibility away largepart currentlyinvestigatedregion
solutionofthe not canbeseenasan
exist,and
optimal equivalentproblemof(SRP)does
deviceforthe optimizationofthenonlinearsum-of—ratios
accelerating global algorithm
resultsinthenumberical showthatthe
problem.Thecompared experiments computa-
tional is thisnew
efficiencyobviouslyimprovedbyusing technique.
KEYWORDS:Global enve-
原创力文档

文档评论(0)