Duality in lpp Study guides, Class notes & Summaries

set of feasible solutions - correct answer the set of points satisfying all constraints and the nonnegative restrictions, the feasible solution can be empty Fundamental theorem of linear programming - correct answer a. linear programming problems with bounded, nonempty set of feasible solutions always have optimal solutions b. if an LPP has optimal solutions, then at least one of these solutions oc...

In our lecture two, we were able to see how a LPP can be solved using the graphical method. In this lecture we will learn how to a LPP can be solved using the simplex method. Steps • Formulate the problem in the standard way. • Convert the inequalities into equations through the addition of a slack variable if the inequality is of a less than type (≤). • A slack variable represents unused capacity in the constraint. E.g. 4X1+6X2≤180 Labour hours constraint 4X1+6X2 + S1 ...