” 49928语言 辅导、 写作algorith编程、 辅导Java，c++程序49928 Design Optimisation forManufacturingTime Allowed: 120 minutes.Reading time: 10 minutes.Reading time is for Reading only. You are not permitted to write, calculate or mark yourpaper in any way during reading time.Open BookThe Final Exam will have 3-4 questions and the total marks will be 35.Below are some sample questions.Question 1:Use Lagrange Multiplier Method to solve the nonlinear programming problem:Minimise 3x+2ySubject toQuestion 2:In the Simplex Method for solving linear programming problem, when a corner point isfound, how to decide whether it is the optimal solution or not? How to improve thesolution if the corner point is not the optimal solution? Please explain the process andgive reasons why it works.Question 3:2 Formulate the problem as a linear programming problem. Solve this linear programming problem graphically.Question 4:It is required to find the rectangular of the largest area (in the positive quadrant) thatcan be transcribed within a given ellipseand satisfy a prescribed linearconstraint4 3 6 x1 x2 Formulate the problem as a nonlinear programming problem. Solve this nonlinear Programming problem graphically.Question 5:Explain the Main idea of BFGS algorithm for unconstrained nonlinear programmingproblems. Use the following example to compute the search direction in the first step ofBFGS algorithm assuming the starting point is4, 3. x1 x2 Question 6:Explain the main idea of SQP algorithm for constrained nonlinear programming problems.Question 7:Explain the principle, Advantages and limitations of Genetic algorithm for nonlinearoptimisation.Question 8:3Explain the key idea of golden section method for solving one dimensional nonlinearprogramming problem.Question 9:Explain the key idea Of branch and bound algorithm.Question 10:Use FOC and SOC to solve the following unconstrained optimization problemMinimizeQuestion 11:Explain the principle, advantages and limitations of the generic iteration based algorithmfor nonlinear optimisation.Question 12:Explain the principle, advantages and limitations of the Dynamic programming algorithm.Question 13:Explain the principle, Advantages and limitations of the Golden Section method.Question 14:Explain the main idea of ALM algorithm for solving nonlinear programming problems.Question 15:Explain the main idea of Newton method for solving unconstrained nonlinear programmingproblems. If the Objective function is quadratic, what will happen?如有需要，请加QQ：99515681 或邮箱：99515681@qq.com
“
添加老师微信回复‘’官网 辅导‘’获取专业老师帮助，或点击联系老师1对1在线指导。
