Home > Operation Research calculators > Graphical method example

1. Graphical method example ( Enter your problem )
  1. Elements of LPP and Definition
  2. Algorithm & Example-1
  3. Maximization Example-2
  4. Maximization Example-3
  5. Minimization Example-4
  6. Minimization Example-5
  7. Mixed constraints Example-6
  8. Mixed constraints Example-7
  9. Multiple optimal solution example
  10. Unbounded solution example
  11. Infeasible solution example
Other related methods
  1. Formulate linear programming model
  2. Graphical method
  3. Simplex method (BigM method)
  4. Two-Phase method
  5. Primal to dual conversion
  6. Dual simplex method
  7. Integer simplex method
  8. Branch and Bound method
  9. 0-1 Integer programming problem
  10. Revised Simplex method

10. Unbounded solution example
(Previous example)
3. Simplex method (BigM method)
(Next method)

11. Infeasible solution example





Infeasible solution
If there is no feasible area (there is no any point that satisfy all constraints of the problem), then this solution is called infeasible solution.
Example
Find solution using graphical method
MAX Z = 6X1 - 4X2
subject to
2X1 + 4X2 <= 4
4X1 + 8X2 >= 16
and X1,X2 >= 0


Solution:
Problem is
MAX `Z``=````6``X_1`` - ``4``X_2`
subject to
```2``X_1`` + ``4``X_2``4`
```4``X_1`` + ``8``X_2``16`
and `X_1,X_2 >= 0; `




Hint to draw constraints

1. To draw constraint `color{red}{2X_1+4X_2<=4} ->(1)`

Treat it as `color{red}{2X_1+4X_2=4}`

When `X_1=0` then `X_2=?`

`=>2(0)+4X_2=4`

`=>4X_2=4`

`=>X_2=(4)/(4)=1`

When `X_2=0` then `X_1=?`

`=>2X_1+4(0)=4`

`=>2X_1=4`

`=>X_1=(4)/(2)=2`

`X_1`02
`X_2`10


Put `X_1=0,X_2=0` (origin) in `color{red}{2X_1+4X_2<=4}`, then `0+0<=4`, which is true,

The half plane containing the origin is the region of the solution set of the inequation `color{red}{2X_1+4X_2<=4}`



2. To draw constraint `color{green}{4X_1+8X_2>=16} ->(2)`

Treat it as `color{green}{4X_1+8X_2=16}`

When `X_1=0` then `X_2=?`

`=>4(0)+8X_2=16`

`=>8X_2=16`

`=>X_2=(16)/(8)=2`

When `X_2=0` then `X_1=?`

`=>4X_1+8(0)=16`

`=>4X_1=16`

`=>X_1=(16)/(4)=4`

`X_1`04
`X_2`20


Put `X_1=0,X_2=0` (origin) in `color{green}{4X_1+8X_2>=16}`, then `0+0>=16`, which is false,

The half plane not containing the origin is the region of the solution set of the inequation `color{green}{4X_1+8X_2>=16}`



Problem has an infeasible solution.

Note: If there is no feasible area (there is no any point that satisfy all constraints of the problem), then this solution is called infeasible solution.






This material is intended as a summary. Use your textbook for detail explanation.
Any bug, improvement, feedback then Submit Here



10. Unbounded solution example
(Previous example)
3. Simplex method (BigM method)
(Next method)





Share this solution or page with your friends.
 
 
Copyright © 2025. All rights reserved. Terms, Privacy
 
 

.