Find the maximum value of the objective function calculator

Do you often find yourself confused by linear programming problems that you can't solve? Maybe it's time to get some help. Well… You're in luck! Solving optimization exercises with the graphical method will be easier with our graphical method calculator for linear programming problems.

The above application is a simplified version of our graphing method calculator available to students who have a membership with us; however, it has all the basic functionality required to graph most linear programming exercises in your school.

This free version, like other available free linear programming calculators, only shows the final result (optimal solution and graph) of the problem. Since many students cannot adequately understand how the graphs were generated, we have developed a version with detailed step-by-step explanations of the solution of the problem.

Advanced Functions of the Graphical Method of Linear Programming Calculator

Our membership aims to help you improve your problem solving skills and perform better in your school. That is why we include a series of online resources, where linear programming is a must. In this application you will find the following:

  • Calculation of the intersections with the axes to graph each constraint.
  • Explanation of the area to shade depending on the type of inequality.
  • Determination of the feasible region.
  • Location of the objective function on the graph, if applicable.
  • Determination of special cases such as unbounded, unbounded or infeasible solutions.
  • Solve exercises with inequalities or equations.
  • You can enter a maximum of 10 restrictions and 2 variables.

You can find complete examples of how the application works in this link.

How to use the Online Graphical Method Calculator

The use of our calculator is very simple and intuitive, however, we will explain its use step by step:

  • Before starting, you must have made the approach of the model to be optimized. Remember that for the graphical method we normally work with 2 decision variables.
  • You must enter the coefficients of the objective function and the constraints. You can enter integer values, fractions and decimals. Likewise, you must also select the sign of the inequalities.
  • To enter the coefficients of the objective function and the constraints, you can use integer values as well as fractions and decimals. You must also select the sign of the inequalities.
  • Click on “Solve / Graph”.
  • If you are in the free version, you will immediately get the final graph and results. In the full version, you will be able to see the step by step from the creation of the graphs to the final result.

Next we will see some images of the operation of the calculator:

Find the maximum value of the objective function calculator
Form to enter the coefficients of the variables
Find the maximum value of the objective function calculator
Sample explanation of graphing
Find the maximum value of the objective function calculator
The generation of the feasible region is shown step by step
Find the maximum value of the objective function calculator
Evaluation of the vertices of the feasible region
Find the maximum value of the objective function calculator
Optimal solution and graph of the linear programming problem

This calculator facilitates your learning of the graphical method and combines well with our simplex method application (two phases) and our Big M Method calculator.

Final Reflection

We know that the best way to learn something is to have the right tools to do it. At PM Calculators we are working to bring you the best tools gathered in one place. If you have any recommendation to improve our calculator, write us to our contact form.

How do you find the maximum value of an objective function?

What you need to to is plug these vertices into the objective function, compare the values, and find the largest one. THAT will be the maximum value for the objective function subject to these constraints.

How do you solve an objective function?

Solving An Objective Function The feasible region of the objective function of a linear programming problem is obtained by forming a graph of the objective function, finding the corner points, and then finding the maximum and minimum values.

What is the value of the objective function?

Objective Function: The objective function in a mathematical optimization problem is the real-valued function whose value is to be either minimized or maximized over the set of feasible alternatives.