CO2 Session 9
CO2 Session 9
Session - 9
Optimization Problems in Fog and Edge Computing
• A tuple (v1, …, vn) that satisfies (1) and (2) is called a solution of the
problem. Thus, the goal is to find the solution with highest f value. At
least, this is the case for maximization problems (as defined above).
For a minimization problem, the goal is to find the solution with
lowest f value, which is equivalent to finding the solution that
maximizes the objective function f ′ = − f . In case of minimization
problems, the objective function is often called cost function because
it represents some – real or fictive – cost that needs to be minimized.