Identify and explain the different techniques for identifying candidate solution

Computer Science
Tutor: None Selected Time limit: 1 Day

If you had to choose one of the techniques you identified in the previous question, which would it be and why?

Nov 4th, 2014

A series of Linear Programming constraints on two variables produces a region of possible values for those variables. Solvable two-variable problems will have a feasible region in the shape of a convex simple polygon. In an algorithm that tests feasible points sequentially, each tested point is in turn a candidate solution.

Reference:

http://en.wikipedia.org/wiki/Candidate_solution


Nov 4th, 2014

Studypool's Notebank makes it easy to buy and sell old notes, study guides, reviews, etc.
Click to visit
The Notebank
...
Nov 4th, 2014
...
Nov 4th, 2014
May 25th, 2017
check_circle
Mark as Final Answer
check_circle
Unmark as Final Answer
check_circle
Final Answer

Secure Information

Content will be erased after question is completed.

check_circle
Final Answer