当前位置:网站首页>Mathematical modeling 2004b question (transmission problem)
Mathematical modeling 2004b question (transmission problem)
2022-07-06 09:04:00 【Also far away】
One 、lingo Code
model:
sets:
mach /1..8/: v;
time /1..10/ ;
mt(mach, time): a, x, n, p;
endsets
data:
a =
70, 0, 50, 0, 0, 30, 0, 0, 0, 40,
30, 0, 20, 8, 15, 6, 2, 0, 0, 8,
110, 0, 40, 0, 30, 0, 20, 40, 0, 40,
55, 5, 10, 10, 10, 10, 15, 0, 0, 1,
75, 5, 15, 0, 15, 15, 0, 10, 10, 10,
95, 0, 10, 20, 0, 15, 10, 20, 0, 10,
50, 15, 5, 15, 10, 10, 5, 10, 3, 2,
70, 0, 20, 0, 20, 0, 20, 10, 15, 5;
p =
-505, 0, 124, 168, 210, 252, 312, 330, 363, 489,
-560, 0, 182, 203, 245, 300, 320, 360, 410, 495,
-610, 0, 152, 189, 233, 258, 308, 356, 415, 500,
-500, 150, 170, 200, 255, 302, 325, 380, 435, 800,
-590, 0, 116, 146, 188, 215, 250, 310, 396, 510,
-607, 0, 159, 173, 205, 252, 305, 380, 405, 520,
-500, 120, 180, 251, 260, 306, 315, 335, 348, 548,
-800, 153, 183, 233, 253, 283, 303, 318, 400, 800;
v = 2.2, 1, 3.2, 1.3, 1.8, 2, 1.4, 1.8;
enddata
! xi1 Is the fixed value ;
@for(mt(i,j): x(i, 1) = a(i,1));
@for(mt(i,j): x(i, 2) = a(i,2));
@for(mt(i,j)|j#ge#2 #and# j#le#9: x(i, j+1) <= x(i,j)+15*v(i));
@for(mt(i,j)|j#ge#2 #and# j#le#9: x(i, j+1) >= x(i,j)-15*v(i));
! And for 982.4;
@sum(mt(i, j): x(i,j)) = 982.4;
! xij <= aij;
@for(mt(i, j) : x(i, j) <= a(i, j));
! xij >= 0;
@for(mt(i, j) : x(i, j) >= 0);
! If xij = 0,nij = 0, otherwise nij = 1;
@for(mt(i, j) : n(i, j) = @if(x(i, j)#eq#0, 0, 1));
@for(mt : @bin(n));
! The goal is ;
c = @max(mt(i, j) : p(i, j)*n(i, j));
min = c;
end
Two 、 experimental result
3、 ... and 、 Be careful
lingo Solve local optimal solution by default , You need to set up and solve the global optimal solution as follows
边栏推荐
- An article takes you to understand the working principle of selenium in detail
- pytorch查看张量占用内存大小
- LeetCode:394. String decoding
- LeetCode:387. The first unique character in the string
- Simclr: comparative learning in NLP
- Improved deep embedded clustering with local structure preservation (Idec)
- Leetcode: Jianzhi offer 03 Duplicate numbers in array
- To effectively improve the quality of software products, find a third-party software evaluation organization
- postman之参数化详解
- Philosophical enlightenment from single point to distributed
猜你喜欢
UML diagram memory skills
MYSQL卸载方法与安装方法
Using C language to complete a simple calculator (function pointer array and callback function)
[oc foundation framework] - < copy object copy >
Guangzhou will promote the construction of a child friendly city, and will explore the establishment of a safe area 200 meters around the school
Chapter 1 :Application of Artificial intelligence in Drug Design:Opportunity and Challenges
Digital people anchor 618 sign language with goods, convenient for 27.8 million people with hearing impairment
Pytest parameterization some tips you don't know / pytest you don't know
Pytest之收集用例规则与运行指定用例
IJCAI2022论文合集(持续更新中)
随机推荐
[text generation] recommended in the collection of papers - Stanford researchers introduce time control methods to make long text generation more smooth
[today in history] February 13: the father of transistors was born The 20th anniversary of net; Agile software development manifesto was born
Simclr: comparative learning in NLP
Advance Computer Network Review(1)——FatTree
Pytest之收集用例规则与运行指定用例
Computer graduation design PHP Zhiduo online learning platform
MySQL uninstallation and installation methods
What is the role of automated testing frameworks? Shanghai professional third-party software testing company Amway
vb. Net changes with the window, scales the size of the control and maintains its relative position
SAP ui5 date type sap ui. model. type. Analysis of the parsing format of date
[OC foundation framework] - [set array]
Compétences en mémoire des graphiques UML
Show slave status \ read in G_ Master_ Log_ POS and relay_ Log_ The (size) relationship of POS
Intel Distiller工具包-量化实现3
LeetCode:剑指 Offer 42. 连续子数组的最大和
Pytorch view tensor memory size
LeetCode:498. 对角线遍历
Nacos 的安装与服务的注册
LeetCode:41. 缺失的第一个正数
LeetCode:41. Missing first positive number