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

1. Formulate linear programming model
(Previous method)
2. Algorithm & Example-1
(Next example)

1. Elements of LPP and Definition





Elements of a basic LPP

1. Decision Variables :
These are the unknown quantities that are expected to be estimated as an output of the LPP solution.

2. Objective function :
It is a function that contains decision variables without exponents (means only power 1) and It is either maximize or minimize value representing maximize profit, minimize cost etc

3. Constraints :
The restrictions on the total amount of a particular resource required to carry out the activities.

4. Non-negative constraints :
Each decision variables must be positive or zero (`x_i>=0`) irrespective of whether objective function is maximize or minimize.


Definition

1. Feasible solution :
The solution which satisfy constraints and non-negativity conditions is called feasible solution.

2. Infeasible solution :
The solution which do not satisfy constraints and non-negativity conditions is called infeasible solution.

3. Optimal Solution :
The solution where objective function is either maximized or minimized is called optimal solution.

4. Unbounded solution :
The solution of the objective function is either increasing or decreasing infinitely, then solution is called unbounded solution.

5. Feasible region :
The region comprising all feasible solutions is called feasible region.




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



1. Formulate linear programming model
(Previous method)
2. Algorithm & Example-1
(Next example)





Share this solution or page with your friends.


 
Copyright © 2024. All rights reserved. Terms, Privacy
 
 

.