a feasible solution to an lp problem

Definition: A feasible solution to a linear program is a solution that satisfies all constraints Definition: An optimal solution to a linear program is the feasible solution with the largest objective function value (for a maximization 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 

solutions In general, given a canonical form for any linear program, a basic feasible solution is given by setting the variable isolated in constraint j, called the jth 

constraint set, a corner point will be an optimal solution It turns out that solution of an LP problem (if it exists) always lies on a vertex of the constraint set 5 

3 Feasible, with no optimum solution because the objective is unbounded - clause (a) of the fundamental theorem

collectively known as the linear programming problem The solution to meet the linear constraints is called feasible solution, by all feasible solutions of the set is 

problem as less as possible so that a known feasible solution becomes the optimal one A method for solving general inverse LP problem including upper and 

objective function optimal is known as the optimal solution to the L P P There are two ways of solving a linear programming problem: (1) Geometrical