Malloju Dinesh
Followers: 0 Following: 0
Feeds
提问
maximise weights of sticks that can fit in a tube so that sum of lenghts is less than L
1) We define a knaptube problem as follows: Given n sticks of length l1, l2, …, ln, weight w1, w2, …, wn, and a tube of total ...
2 years 前 | 0 个回答 | 0
0
个回答提问
algorithm for minimisation of time given profit is maximised
i am confused here as to how can the profit be maximised and time be minimised at the same time.. now if the profit is maximi...
3 years 前 | 1 个回答 | 0
1
个回答提问
unable to optimise the following using linprog
I am trying to implement equation 9(in the image attached below) in linprog .. the v vector has (w,r): w is the weights vector w...
3 years 前 | 1 个回答 | 0