Hi Gurus ,


Sorry for not coming any later than this. I have a basic routing problem to code in Lingo . Is there anybody who can help to write an Objective function for this problem , or code that in LINGO ?.. atleast your advice will be highly helpful for me.

Products : A,B,C

Profit per product : $10 , $15 , $13

Operations : O1,O2,O3,O4

Time for Operations : 2min , 3 min , 4 min , 3min

Resource : R1, R2 , R3

Capacity of resource : 100 min , 120 min, 110 min

Routing : Product A : O2 --> O3 ----> O4

Product B : O1 ---> O2 ----> O4

Product C : O3 --->O4

Resources used for Operation :

R1( O1,O2)
R2(O1,O2,O3,O4)
R3(O1,O2,O3,O4)


May be we should consider the Period factor into this problem , like the same resource cannot be simultaneiusly used to produce two different products.

Output should may give us the maximum no of products it can produce and maximize the profits .


Thanks a lot for your help ..

Try these. They are freebies for excel.

http://ite.pubs.informs.org/Vol2No2/EcksteinRiedmueller/jensen/

:thanx: but you know..these are add ins , i need to know how to form the objective function for this....to solve it.