omlecenglish.pptVIP

Chapter 5 Linear Programming Linear Programming, a. k. a. Linear Optimization, is referred to as the case when both the objective function and constraints are linear functions of the variables. As shown in Chapter 1, the feasible region of the linear programming problem is an enclosed convex polygon or polytope. The optimal solution is often located at one or more vertex points. The mathematical model of the linear programming problem is also comprised by the objective function, variables, and the constraints. The constraints usually consist of a series of equalities or inequalities, as well