1313_section3o3

1313_section3o3 - Section 3.3 – Linear Programming 1...

This preview shows pages 1–2. Sign up to view the full content.

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

View Full Document
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: Section 3.3 – Linear Programming 1 Section 3.3 Graphical Solution of Linear Programming Problems Consider the following figure which is associated with a system of linear inequalities: x y The set S is called a feasible set. Each point in S is a candidate for the solution of the problem and is called a feasible solution. The point(s) in S that optimizes (maximizes or minimizes) the objective function is called the optimal solution. Theorem 1 (in book) Linear Programming If a linear programming problem has a solution, then it must occur at a vertex, or corner point of the feasible set S associated with the problem. Furthermore, if the objective function P is optimized at two adjacent vertices of S, then it is optimized at every point on the line segment joining these vertices, in which case there are infinitely many solutions to the problem. The Method of Corners 1. Graph the feasible set (graph the system of constraints)....
View Full Document

This note was uploaded on 02/21/2012 for the course MATH 1313 taught by Professor Constante during the Spring '08 term at University of Houston.

Page1 / 4

1313_section3o3 - Section 3.3 – Linear Programming 1...

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

View Full Document
Ask a homework question - tutors are online