Optimal solution
|
Feasible solution
|
(i) A feasible solution that either maximizes or
minimizes a given objective function is called an optimal solution.
|
(i) Any subset that satisfies some constrains is
called feasible solution.
|
(ii) All optimal solution is feasible.
|
(ii) All feasible solution is not optimal.
|
(iii) It considers the input in an order, determine
by some selection procedure.
|
(iii) It considers one input at a time.
|
(iv) Finding an optimal solution may be the simplest
part of the problem.
|
(iv) Finding a feasible solution may be the hardest
part of the problem.
|
10 March 2018

Differentiate optimal solution and feasible solution
You May Also Like
- Algorithm Design
What is the use of Dijkstra’s algorithmApr 06, 2018
- Algorithm Design
- Algorithm Design
- Algorithm Design
How does Divide and Conquer method workApr 01, 2018
Newer Article
Write the recursive process of binary search algorithm
Older Article
Write down the difference between greedy method and dynamic programming
Labels:
Algorithm Design
Subscribe to:
Post Comments (Atom)
No comments:
Post a Comment