Classical Optimization Algorithms can be defined as "COA is defined as that algorithm which can be used to identify the best solution from a set of available solutions which is continuous and differentiable. " Although due to the limitations like the requirement of continuous and differentiable functions such algorithm can not be applied for various objectives however due to the iteration time and optimization efficiency the following five COA is used widely including practical and real-life problems : Linear programming : Both Objective and Constraint function is represented by a linear function. View the complete tutorial on Linear Programming Integer programming: Uses linear programs in which at least one variable uses only integer values. View the complete tutorial on Integer Programming Dynamic programming : here both or anyone's objective or constraint function depends on dynamic functions. View the complete tutorial on Dynamic Programming Stochastic programming :...
Aim for Sustainability with Hydrology : Come here for different news and views about water conservation and how informatics can help in the same.