Section 2.1 – Solving Linear Programming Problems - University of Houston

Math 1313 Page 6 of 19 Section 2.1 Example 4: Use the graphical method to solve the following linear programming problem. Maximize R x y= +4 11 subject to: 3 2 4 0 0 x y x y x y + ≤ + ≤ ≥ ≥ Solution: We need to graph the system of inequalities to produce the feasible set. We will start


Loved it? Download it, Share it!!
Share

Preview 2

Image

Preview 3

Image

Preview 4

Image

Preview 5

Image

Preview 6

Image

Thumbnails


Image
Image