##### Asked by: Aroma Zavolokov

asked in category: General Last Updated: 22nd January, 2020# How do you find the objective function in linear programming?

**linear function**is called the

**objective function**, of the form f(x,y)=ax+by+c . The solution set of the system of inequalities is the set of possible or feasible solution , which are of the form (x,y) .

Considering this, what is objective function in linear programming?

A two-dimensional **linear programming** problem consists of a **linear objective function**. and a system of **linear** inequalities called constraints. The **objective function** gives the. quantity that is to be maximized (or minimized), and the constraints determine the set of. feasible solutions.

Similarly, what is objective function value? **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. It is possible that there may be more than one optimal solution, indeed, there may be infinitely many.

One may also ask, what is the purpose of optimization?

The **purpose of optimization** is to achieve the “best” design relative to a set of prioritized criteria or constraints. These include maximizing factors such as productivity, strength, reliability, longevity, efficiency, and utilization.

What is an objective function example?

**Example** of **Objective Function** These include: Allocating machinery and labor between different products so that profit is maximized or costs are minimized. Managing the inventory of raw materials and spare parts in a factory.