进退法.docVIP

下载本文档

11
0
约2.79千字
约 4页
2018-03-08 发布于河南
举报
版权申诉

进退法.doc

1、本文档共4页，可阅读全部内容。
2、原创力文档（book118）网站文档一经付费（服务费），不意味着购买了该文档的版权，仅供个人/单位学习、研究之用，不得用于商业用途，未经授权，严禁复制、发行、汇编、翻译或者网络传播等，侵权必究。
3、本站所有内容均由合作方或网友上传，本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺！文档内容仅供研究参考，付费前请自行鉴别。如您付费，意味着您自己接受本站规则且自行承担风险，本站不退款、不进行额外附加服务；查看《如何避免下载的几个坑》。如果您已付费下载过本站文档，您可以点击这里二次下载。
4、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等，请点击“版权申诉”（推荐），也可以打举报电话：400-050-0827(电话支持时间：9:00-18:30)。
5、该文档为VIP文档，如果想要下载，成为VIP会员后，下载免费。
6、成为VIP后，下载本文档将扣除1次下载权益。下载后，不支持退款、换文档。如有疑问请联系我们。
7、成为VIP后，您将拥有八大权益，权益包括：VIP文档下载权益、阅读免打扰、文档格式转换、高级专利检索、专属身份标志、高级客服、多端互通、版权登记。
8、VIP文档为合作方或网友上传，每下载1次，网站将根据用户上传文档的质量评分、类型等，对文档贡献者给予高额补贴、流量扶持。如果你也想贡献VIP文档。上传文档

进退法

Private n As Integer (程序头部) Private X0() As Double Private S() As Double Private A As Double, B As Double Dim kf As Integer Public Sub JinTui(X0() As Double, S() As Double, n As Integer, T0 As Double, A As Double, B As Double) (进退法子程序) Dim A1 As Double, A2 As Double, T As Double Dim f1 As Double, f2 As Double Dim i As Integer Dim X() As Double Dim bestf As Double ReDim X(n) T = T0 A1 = 0 A2 = T f1 = F(X0()) For i = 1 To n X(i) = X0(i) + A2 * S(i) Next i f2 = F(X()) If f2 f1 Then Do T = 2 * T A2 = A2 + T f1 = f2 For i = 1 To n X(i) = X0(i) + A2 * S(i) Next i f2 = F(X()) If f2 f1 Then A1 = A2 - T End If Loop Until f2 f1 Else （学生自编程序段） Do T = -T A1 = A1 + T f2 = f1 For i = 1 To n X(i) = X0(i) + A1 * S(i) Next i f1 = F(X()) If f2 f1 Then A2 = A1 - T T = 2 * T End If Loop Until f2 f1 End If A = A1 B = A2 End Sub Private Sub cmdQdJt_Click() 主程序 Dim T0 As Double Dim X0(2) As Double Dim S(2) As Double X0(1) = 2 X0(2) = 2 S(1) = 0.707 S(2) = 0.707 T0 = 1 n = 2 Call JinTui(X0(), S(), n, T0, A, B) MsgBox A= A , B= B , 进退法 End Sub Public Function F(X() As Double) (目标函数子程序) F = X(1) * X(1) + X(2) * X(2) - 8 * X(1) - 12 * X(2) + 52 End Function 习题3-1 Private n As Integer (程序头部) Private X0() As Double Private S() As Double Private A As Double, B As Double Dim kf As Integer Public Sub JinTui(X0() As Double, S() As Double, n As Integer, T0 As Double, A As Double, B As Double) (进退法子程序) Dim A1 As Double, A2 As Double, T As Double Dim f1 As Double, f2 As Double Dim i As Integer Dim X() As Double Dim bestf As Double ReDim X(n) T = T0 A1 = 0 A2 = T f1 = F(X0()) For i = 1 To n X(i) = X0(i) + A2 * S(i) Next i f2 = F(X()) If f2 f1 Then Do T = 2 * T A2 = A2 + T f1 = f2 For i = 1 To n