Notes
Summary of Chapter 6
Content of the notes (1)
Page 1
1 To formulate a problem as a linear programming problem:
define the decision variables (x, y, z, etc.)
state the objective (maximise or minimise, together with an algebraic expression)
write the constraints as inequalities.
2 A two-variable linear programming problem can be illustrated graphically.
3 The optimal point in a feasible region can be found using the objective line method or the vertex testing method.
4 Some solutions need integer values
New Page
Information
- Description
- Decision (Chapter 6: Linear programming) Note on Summary of Chapter 6, created by jakubburger on 12/04/2013.
- Created by
- jakubburger
- Views
- 95
- Tags
- Rating