Chapter 2 Problem Solving
Found 3 free book(s)
Duality in Linear Programming 4
web.mit.eduProblem (2) is called the dual of Problem (1). Since Problem (2) has a name, it is helpful to have a generic name for the original linear program. Problem (1) has come to be called the primal. In solving any linear program by the simplex method, we also determine the shadow prices associated with the constraints.
Problem Solving Strategies IDEAL I Identify the problem
media.lanecc.eduProblem Solving Strategies • IDEAL I Identify the problem D Define and represent the problem E Explore possible strategies or solutions A Act on a selected strategy or solution L Look back and evaluate • Trial and error: A strategy that involve attempting different solutions and eliminating those that do not work.
5 CONSTRAINT SATISFACTION PROBLEMS
aima.cs.berkeley.edurather than problem-specific heuristics to enable the solution of large problems (Sections 5.2– 5.3). Perhaps most importantly, the standard representation of the goal test reveals the struc-ture of the problem itself (Section 5.4). This leads to methods for problem decomposition