利用Matlab解决数学问题(国外英语资料).doc

利用Matlab解决数学问题 Matlab to solve mathematical problems One, linear programming Matlab solution for linear programming Simplex method is one of the most common and effective algorithms for solving linear programming problems. The simplex method is the first one In 1947, George Dantzig proposed that, for nearly 60 years, a number of variant forms have been developed, but the same basic idea remains. As a result of the conclusion: if the linear programming problem has finite and optimal solutions, then there must be some optimal solution which is the pole of the feasible region. Based on this, the basic idea of simplex method is to find a pole of the feasible region first, and to judge whether it is optimal by a certain rule. If not, then switch to another pole adjacent to it and make the target function better. So we go down until we find some optimal solution. In this case, were not going to go into the simplex method, and the interested reader can look at other linear programming books. Here we introduce the Matlab solution of linear programming. The standard type of linear programming in Matlab5.3 is The basic function is linprog (c, A, b), and its return value is the value of the vector. There are other forms of function calls (you can see all of the function call forms in the Matlab window running help linprog), such as: [x, fval] = linprog (c, A, b, Aeq, beq, LB, UB, X0, OPTIONS) Here fval returns the values of the target function, Aeq and beq correspond to the equation constraints, the LB and UB are the lower and upper bound of the variable, the initial value, and the OPTIONS are the control parameters. Example 2 solves the following linear programming problem The solution (I) writes M files C = [2; 3; -5]; A is equal to minus 2, 5, minus 1. B = - 10; Aeq = [1, 1, 1]; Beq = 7. X = linprog (-c, a, b, aeq, beq, zeros (3, 1)) Value = c * x (ii) the M file memory disk, named example1.m. (iii) you can ask for the result of running example1 in the Matlab window. Examp