a feasible solution to an lp problem

basic feasible solution put the slack variables on the left hand side How ever, this is not always the case, especially for minimization problems, or problems 

called a feasible solution to the linear programming problem A feasible solution that minimizes the objective function is called an optimal solution A2 BASIS 

simplex method, proceeds by moving from one feasible solution to another, It solves any linear program; it detects redundant constraints in the problem

THEOREM For a feasible linear program in its standard form, the optimum value of the objective over its nonempty feasible region is (a) either unbounded or (b) 

equalities inequalities then we have a linear programming (LP) problem If x ∈ S then x is called a feasible solution If the maximum of f(x) over x ∈ S occurs at x 

Healthy Pet Food problem ▻ A feasible solution satisfies all of the constraints ▻ Feasible set Set containing all of the feasi ble solutions ▻ Optimal solution

1222 Graphical method of solving linear programming problems In Class XI, we have region is called a feasible solution to the problem Thus, we have,

Reciprocally, any feasible solution of the primal provides a lower bound on the optimal value of the dual problem Actually, if one of both problems admits an 

Let us return to the linear programming problem P The fundamental result is that we need only search among the basic feasible solutions for an optimal solution