Formulating an Objective Function
Linear Programming is all about finding the optimal values of the decision variables and putting those values in the objective function so as to generate maximum or minimum value. There are many techniques such as Simplex Method, and Graphical Method to solve Linear Programming. However, Graphical Method is usually preferred because of its simplicity. The steps to get the optimal values of the objective function are as follows:
- Generate the constraint equations and the objective function from the problem.
- Plot the constraint equations on the graph.
- Now identify the feasible region where the constraints are satisfied.
- Generate the values of Decision variables that are located at the corners of the feasible region.
- Put all the generated values in the objective function and generate the optimal value.
Objective Function
Objective Function is the objective of the Linear Programming Problem as the name suggests. In linear programming or linear optimization, we use various techniques and methods to find the optimal solution to the linear problem with some constraints. The technique can also include inequality constraints as well. The objective function in Linear Programming is to optimize to find the optimum solution for a given problem.
In this article, we will learn all about the Objective Function including its definition, types, how to formulate an objective function for any given problem, etc. We will also learn various representations of Objective Functions such as Linear Objective Functions or Non-linear objective functions. So, let’s start learning about this fundamental concept in Linear Programming i.e., “Objective Function”.