工程优化作业01.docxVIP

《工程优化设计》第一次作业阅读《Engineering Optimization Theory and Practice》Chapter one。回答P45页中部分Review questions 1.1,1.2和1.3。解：1.1 Match the following terms and descriptions:(a) Free feasible point gj (X) = 0(b) Free infeasible point Somegj (X) = 0 and other gj (X) 0(c) Bound feasible point Some gj (X) = 0 and other gj (X) ≥ 0(d) Bound infeasible point Some gj (X)0 and other gj (X) 0(e) Active constraints All gj (X) 01.2 Answer true or false:(a) Optimization problems are also known as mathematical programming problems. (T)(b) The number of equality constraints can be larger than the number of design variables. (F)(c) Preassigned parameters are part of design data in a design optimization problem. (T)(d) Side constraints are not related to the functionality of the system. (T)(e) A bound design point can be infeasible.(T)(f) It is necessary that some gj (X) = 0 at the optimum point. (F)(g) An optimal control problem can be solved using dynamic programming techniques. (T)(h) An integer programming problem is same as a discrete programming problem. (F)Define the following terms:Mathematical programming problem（数学规划问题）：在给定约束条件下求目标函数最大或最小，常用于线性规划、非线性规划的问题。Trajectory optimization problem（动态规划问题）：研究的是最优策略基于将问题分解成若干个较小的子问题的优化问题。Behavior constraint（二次规划问题）：目标函数是二次函数，而且集合A必须是由线性等式函数和线性不等式函数来确定的。Quadratic programming problem（行为约束）：在系统的性能上或者动作执行过程中的约束称之为行为约束又叫功能约束。Posynomial（正项式）：有正变向量的函数称为正项式。Geometric programming problem（几何规划问题）：几何规划的目标函数和约束条件均由广义多项式构成，这是一类特殊的非线性规划，利用其对偶原理，可以把高度非线性问题的求解转化为具有线性约束的优化问题求解，使计算大为简化。优化问题建模题目：1.1；设分别表示肥料A、B、C和D的生产量（吨）分别为变量，，则最大利润maxP为：maxP：S.T:程序如下：f=[250;400;250;450]A=[0.05 0.05 0.1 0.15;0.1 0.15 0.2 0.5;0.05 0.1 0.1 0.15;-1 0 0 0;0 0 0 -1]b=[1000;2000;1500;-5000;-4000][x,feval]=linprog(f,[],[],