Graphical_Solution_Method_for_LP

Graphical_Solution_Method_for_LP -...

Info iconThis preview shows pages 1–12. Sign up to view the full content.

View Full Document Right Arrow Icon
  1 Graphical Solution Method for  Linear Programming Model
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
  2 Linear Programming Model of Catch-Big Problem Max 500,000x1 + 700,000x2 s.t. 20,000 x1 + 30,000 x2 < 190,000 x1 < 6 x1 + x2 < 8 x1, x2 > 0
Background image of page 2
  3 Feasible Solutions and Optimal Solution § Feasible solution : the values of decision variables that satisfy all the constraints § Feasible region : all the feasible solutions § Optimal solution : feasible solution with the largest (or smallest) objective function value for maximization (or minimization)
Background image of page 3

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
  4 1 2 3 4 5 6 § Values for decision variables points in a plane with axes: Picture the Values For Decision Variables 5 4 3 2 1 x 2 x1 0
Background image of page 4
  5 Example 1: LP Formulation § A simplification of the linear programming model: Max 5x1 + 7x2 (in 100,000) s.t. 2x1 + 3x2 < 19 (in 10,000) x1 < 6 x1 + x2 < 8 x1, x2 > 0
Background image of page 5

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
  6 Example 1: Graph Constraints § Graph the region of points satisfying 2x1 + 3x2 < 19 : 8 7 6 5 4 3 2 1 1 2 3 4 5 6 7 8 9 10 x 2 x1
Background image of page 6
  7 Example 1: Graph Constraints § Graph the region of points satisfying x1 < 6 : 8 7 6 5 4 3 2 1 1 2 3 4 5 6 7 8 9 10 x 2 x1
Background image of page 7

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
  8 Example 1: Graph Constraints § Graph the region of points satisfying x1 + x2 < 8 : 8 7 6 5 4 3 2 1 1 2 3 4 5 6 7 8 9 10 x 2 x1
Background image of page 8
  9 Example 1: Graph Constraints § Graph the region of points satisfying all constraints : 8 7 6 5 4 3 2 1 1 2 3 4 5 6 7 8 9 10 x 2 x1
Background image of page 9

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
  10 x2 8 7 6 5 4 3 2 1 0 1 2 3 4 5 6 7 8 9 10 § The region of points that satisfy all constraints : Example 1: Feasible Region x1 Feasible Region
Background image of page 10
  11 Example 1: How Did We Graph Constraints? Constraint 1 : Set x2 = 0, then x1 = 9.5. Set x1 = 0, then x2 = 6.33. Connect (9.5, 0) and (0, 6.33). Using a verification point (0, 0), we see that the “<’’ side is to its left. Constraint 2
Background image of page 11

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Image of page 12
This is the end of the preview. Sign up to access the rest of the document.

Page1 / 32

Graphical_Solution_Method_for_LP -...

This preview shows document pages 1 - 12. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online