Back to Browse

Greedy Method

749 views
Apr 17, 2019
8:23

The most straight forward method for problem solving. Given with n input, we have to find out a subset that satisfies a constraint. The subset that satisfies the constraint is known as Feasible solution to the problem. The Feasible solution that Maximizes or Minimizes the Objective Function is known as the Optimal Solution. One can select(Based on selection criteria) an input and check for the Feasibility for optimal. If yes it is included in the Solution otherwise rejected.

Download

0 formats

No download links available.

Greedy Method | NatokHD