Documenti di Didattica
Documenti di Professioni
Documenti di Cultura
Lecture 3
Outline
:
Lecture 2 review: LP Formulation Lecture 3: Graphical Solution (2D case)
Lecture 3
Lecture 3
Lecture 3
Lecture 3
Examples
minimize z = 4x1 + 5x2 subject to 3x1 + 2x2 2 2x1 x2 0 x1 and x2 are integers, i.e., x1, x2 {0, 1, 2, }
Lecture 3
Graphical Solution
1. 2. 3. Draw the constraints. Draw the isocost lines of the objective Determine optimal point(s) going in the direction of the gradient of the objective if maximizing (negative gradient if minimizing)
Lecture 3
Lecture 3
Lecture 3
The constraint set is a polyhedral set (intersection of nitely many half-spaces) The intersection of any of two lines (corresponding to two dierent constraints) denes a corner or a vertex In our example, the vertices are A = (0, 0), B = (0, 3), C = (3, 1.5), D = (4, 0), (0, 6), and (6, 0) Some vertices are feasible for the problem, and some are not. In our example, A, B, C, and D are feasible (belong to the constraint set), while (0, 6), and (6, 0) are not feasible (lie outside of the constraint set)
Lecture 3
Reddy Mikks: Objective & Optimal Solution Objective z = 5x1 + 4x2 to be maximized
10
Lecture 3
We can solve graphically problems with 2 decision variables In general, when the number of decision variables is larger than 2, we can use simplex method. The vertices play important role in this case Please check the course web for Homework 1. It is posted, and it is due next Friday, Sep. 4 Also, all GE students, please check the announcement for the enrollment in GE397 to get the correct course credit.
11