[Coin-discuss] Help on modelling please

[ali malihi]

Dear Sir,

I need your help for mathematical modelling of the following problem.

Your recommendation regarding the software suitable for solving this kind of problems and related documents and papers will be highly appriciated.

Best regards,

Ali Malihi

ali_malihi at yahoo.com

PROBLEM:

Given m metal pipes with lengths L1,L2,.....Lm, find n lengths D1,D2,..... Dn ordred by customer amoung them 

minimize ( C + W + PL )

C = total number of cuts

W = total number of weldings 

PL = pipe loss

L = L1+L2+.....+Lm

D = D1+D2+.....+Dn 

P = number of parts allowed within Di

subject to:

1) D <= L

2) Di (i=1,...,n) are allowed to be composed of MAXIMUM two parts (P=2)

in another word, only one welding point is allowed within the length of a Di.

NOTE: Because of constraint (2), it is almost not possible to obtain the n ordered pipes all the time, so determine the maximum k number possible, where k<=n and cost function minimized.

 


__________________________________________________
Do You Yahoo!?
Tired of spam?  Yahoo! Mail has the best spam protection around 
http://mail.yahoo.com 
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://list.coin-or.org/pipermail/coin-discuss/attachments/20050524/8021e609/attachment.html>