AMPL和MATLAB结合使用示例

以运输问题为例。

M脚本文件transp2.m:

m=80;
n=100;
orig=1:m;
dest=1:n;
supply=round(n*rand(1,m)+1);
demand=round(m*rand(1,n)+1);
if sum(supply)>sum(demand)
    demand(1)=demand(1)+sum(supply)-sum(demand);
else
    supply(1)=supply(1)+sum(demand)-sum(supply);
end
demand=demand*sum(supply)/sum(demand);
supply=[orig(:) supply(:)];
demand=[dest(:) demand(:)];
cost=[orig(:) rand(m,n)];
dlmwrite('orig',orig,' ');
dlmwrite('dest',dest,' ');
dlmwrite('supply',supply,' ');
dlmwrite('demand',demand,' ');
dlmwrite('cost',cost,' ');
!ampl transp2.mod
delete orig
delete dest
delete supply
delete demand
delete cost

AMPL源文件transp2.mod

set ORIG;   # origins
set DEST;   # destinations

param supply {ORIG} >= 0;   # amounts available at origins
param demand {DEST} >= 0;   # amounts required at destinations

   check: sum {i in ORIG} supply[i] = sum {j in DEST} demand[j];

param cost {ORIG,DEST} >= 0;   # shipment costs per unit
var Trans {ORIG,DEST} >= 0;    # units to be shipped

minimize Total_Cost:
   sum {i in ORIG, j in DEST} cost[i,j] * Trans[i,j];

subject to Supply {i in ORIG}:
   sum {j in DEST} Trans[i,j] = supply[i];

subject to Demand {j in DEST}:
   sum {i in ORIG} Trans[i,j] = demand[j];
data;
set ORIG:= include orig;
set DEST:= include dest;
param supply :=include supply;
param demand :=include demand;
param cost : include dest :=
 include cost;
option solver gurobi;
solve;


  • 0
    点赞
  • 4
    收藏
    觉得还不错? 一键收藏
  • 14
    评论
Matlab使用Ipopt可以通过AMPL来调用。AMPL是一种建模语言工具,它允许用户以类似于数学方式编写问题的语法来编写优化问题。在AMPL中制定了问题后,可以使用已编译的Ipopt AMPL求解器可执行文件ipopt来解决问题。通过直接链接代码来连接您的问题需要花费一些时间来编写,但对于大型问题可能更有效。中的示例代码。该代码展示了如何使用AMPL语法在Matlab中调用Ipopt求解器来解决一个非线性优化问题。代码中定义了变量和约束,并指定了目标函数。然后通过使用solve命令来解决问题,并使用display命令来显示解的结果。<span class="em">1</span><span class="em">2</span><span class="em">3</span> #### 引用[.reference_title] - *1* *2* [MATLAB使用IPOPT去解NLP问题的接口:AMPL 工具](https://blog.csdn.net/caokaifa/article/details/125535963)[target="_blank" data-report-click={"spm":"1018.2226.3001.9630","extra":{"utm_source":"vip_chatgpt_common_search_pc_result","utm_medium":"distribute.pc_search_result.none-task-cask-2~all~insert_cask~default-1-null.142^v93^chatsearchT3_2"}}] [.reference_item style="max-width: 50%"] - *3* [利用APOPT、IPOPT等大规模非线性规划求解器,解决数据调和、移动视界估计、实时优化、动态仿真、非线性MPC...](https://blog.csdn.net/weixin_46039719/article/details/131197213)[target="_blank" data-report-click={"spm":"1018.2226.3001.9630","extra":{"utm_source":"vip_chatgpt_common_search_pc_result","utm_medium":"distribute.pc_search_result.none-task-cask-2~all~insert_cask~default-1-null.142^v93^chatsearchT3_2"}}] [.reference_item style="max-width: 50%"] [ .reference_list ]

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论 14
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值