Scribd
Upload
3 views33 pages

Graphical Method

The document outlines key concepts in linear programming, including feasible solutions, feasible regions, infeasible solutions, and unbounded solutions. A feasible solution meets all constraints and is within the feasible region, while an infeasible solution does not meet the constraints. An unbounded solution allows for indefinite increases or decreases in the objective function without leaving the feasible region.

Uploaded by

kamnarajput.du.or
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
3 views33 pages

Graphical Method

The document outlines key concepts in linear programming, including feasible solutions, feasible regions, infeasible solutions, and unbounded solutions. A feasible solution meets all constraints and is within the feasible region, while an infeasible solution does not meet the constraints. An unbounded solution allows for indefinite increases or decreases in the objective function without leaving the feasible region.

Uploaded by

kamnarajput.du.or
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd

Graphical Method

Solution – The set of values of decision variables 𝑥𝑗 = 𝑗 = 1,2, … … . . , 𝑛 that satisfy the constraints of an LP
Problem is said to constitute the solution to that LP Problem.

Feasible Solution- The set of values of decision variables 𝑥𝑗 = 𝑗 = 1,2, … … . . , 𝑛 that satisfy all the constraints
and non-negativity of an LP Problem.
A feasible solution is any point (x,y) that lies inside or on the boundary of the feasible region. It's a combination of
products that the factory can produce using its available resources. A problem can have an infinite number of
feasible solutions, but we are only interested in finding the one that gives the best outcome (the optimal
solution).

Feasible Region- Is the overlapping area of constraints that satisfies all the constraints.

Infeasible Solution- The set of values of decision variables that do not satisfy all the constraints and non-negativity
conditions.
An infeasible solution is any point (x,y) that lies outside the feasible region.

Unbounded Solution- A solution that can indefinitely increase or decrease the value of the objective function.
An unbounded solution occurs when the objective function can be increased (or decreased) indefinitely without
ever leaving the feasible region. This means the feasible region is not a closed shape, but rather an open, infinite
area.

You might also like