Implementation in a given amount of time. The best solution found is the solution with the highest score found by an There is always at least 1 optimal solution, even in the case that thereĪre no feasible solutions and the optimal solution isn't feasible. Every feasible solution is a possible solution.Īn optimal solution is a solution with the highest score. Sometimes there are no feasible solutions. ![]() The number of feasible solutions tends to be relative to the number of possible solutions. Many of thoseĪ feasible solution is a solution that does not break any (negative) hardĬonstraints. Planning problems tend to have an incredibly large number of possible solutions. A possible solution is any solution, whether or not it breaks any number ofĬonstraints.
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |