Modeling like CPM searching for the critical path

[Ramine]

Hello,


I have modeled and solved the Shortest-Route problem with Linear
programming, here it is:

http://pages.videotron.com/aminer/lp/linear.htm


If you want do a modeling like CPM searching for the critical path,
you have to change the objective function of the Shortest-Route problem
above from a minimization to a maximization.


And as you have noticed i have also implemented an optimal Dijkstra's
algorithm that is compatible with Delphi and FreePascal, here it is:

https://sites.google.com/site/aminer68/dijkstra-s-algorithm-for-delphi-and-freepascal

In my next post i will show you how to model using mathematical queuing
theory a queue that have an hyper-exponential service so that to model a
database server to be able to mathematically model an Ecommerce website.

Thank you for your time.


Amine Moulay Ramdane.