Notizen
Summary of Chapter 6
Inhalt der Notizen (1)
Seite 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
Informationen
- Beschreibung
- Decision (Chapter 6: Linear programming) Notiz am Summary of Chapter 6, erstellt von jakubburger am 12/04/2013.
- Erstellt von
- jakubburger · Apr 2013
- Aktualisiert
- 15 Apr 2016
- Aufrufe
- 95
- Tags
- Bewertung