the program tacticians-- non-linear planning for the simplex method, seeking fmin (X) = 4* (X1- 5)* (X1- 5) (X2-6) (X2-6) with the minimum of the optimal solution, and if necessary change change the demand function, f Functions can be modified

非线性规划_单纯形
.................\ghmath3.dsp
.................\ghmath3.dsw
.................\ghmath3.ncb
.................\ghmath3.opt
.................\ghmath3.plg
.................\main.cpp
.................\main.dsp
.................\main.dsw
.................\main.ncb
.................\main.opt
.................\main.plg

• We are an exchange download platform that only provides communication channels. The downloaded content comes from the internet. Except for download issues, please Google on your own.
• The downloaded content is provided for members to upload. If it unintentionally infringes on your copyright, please contact us.
• Please use Winrar for decompression tools
• If download fail, Try it againg or Feedback to us.
• If downloaded content did not match the introduction, Feedback to us，Confirm and will be refund.
• Before downloading, you can inquire through the uploaded person information

Nothing．