Abdelghani Bellaachia, Algorithms
- 1 -
Greedy Method
˜
Objective:
˜
General approach:
•
Given a set of n inputs.
•
Find a subset, called feasible solution, of the n
inputs subject to some constraints, and
satisfying a given objective function.
•
If the objective function is maximized or
minimized, the feasible solution is optimal.
•
It is a locally optimal method.
˜
Algorithm:
F
Step 1: Choose an input from the input set, based on
some criterion. If no more input exit.
F
Step 2: Check whether the chosen input yields to a
feasible solution. If no, discard the input and
goto step 1.
F
Step 3: Include the input into the solution vector and
update the objective function. Goto step 1.

This
** preview**
has intentionally

**sections.**

*blurred***to view the full version.**

*Sign up*