The iterative-improvement technique involves finding a solution to an optimizationproblem by generating a sequence of feasible solutions withimproving values of the problem’s objective function. Each subsequent solutionin such a sequence typically involves a small, localized change in theprevious feasible solution. When no such change improves the value of the objective function, the algorithm returns the last feasible solution as optimaland stops.
đang được dịch, vui lòng đợi..
