搜索资源列表
interior-point-method-
- 程序为内点法,用来求解具有不等式约束条件的目标函数极值,用C开发的程序。-Program for the interior point method for solving the objective function extremum with inequality constraints, a program developed by C.
matlab
- 设计并解决一个线性规划问题,要求: 1)问题应具有一定的实际背景,最好与自己的专业相关; 2)目标函数至少包含6个以上的变元; 3)包含等式约束和不等式约束两种约束条件; 4)写出求解问题的Matlab程序; 5)对求解的结果进行必要的解释和分析说明。(Design and solve a linear programming problem, requiring: 1) the problem should have a certain practical background,
constrained optimization
- 主要解决在自变量满足约束条件的情况下的目标函数最小化问题,其中约束条件既可以是等式约束也可以是不等式约束。(It mainly solves the problem of minimizing the objective function under the condition that the independent variables satisfy the constraint conditions. The constraint condition can be either an eq
1601871
- 求解线性规划问题,即在一组线性不等式或等式组的约束条件下()