Wikipedia defines optimization as a problem where you maximize or minimize a real function by systematically choosing input values from an allowed set and computing the value of the function. That means when we talk about optimization we are always interested in finding the best solution. So, let say that one has some functional form(e.g in the form of f(x)) and he is trying to find the best solution for this functional form. Now, what does best mean? One could either say he is interested in minimizing this functional form or maximizing this functional form.

Generally, an optimization problem has three components.

**minimize f(x), ****w.r.t x, ****subject to a < x < b **

**where, f(x) : Objective function ****x : Decision variable ****a < x < b : Constraint **

Depending on the number of decision variables optimization may be categorized into two parts,

**Uni-variate optimization problems:**Uni-variate optimization may be defined as a non-linear optimization with no constraint and there is only one decision variable in this optimization that we are trying to find a value for.

**min f(x)****w.r.t x****x ∈ R****Multivariate optimization problems:**In multivariate optimization problem there must be more than one decision variable in this optimization that we are trying to find a value for.

#### min f(x

_{1}, x_{2}, x_{3}…..x_{n})

**What’s a multivariate optimization problem?**

In a multivariate optimization problem, there are multiple variables that act as decision variables in the optimization problem.

#### z = f(x_{1}, x_{2}, x_{3}…..x_{n})

So, when you look at these types of problems a general function z could be some non-linear function of decision variables x_{1}, x_{2}, x_{3} to x_{n}. So, there are n variables that one could manipulate or choose to optimize this function z. Notice that one could explain univariate optimization using pictures in two dimensions that is because in the x-direction we had the decision variable value and in the y-direction, we had the value of the function. However, if it is multivariate optimization then we have to use pictures in three dimensions and if the decision variables are more than 2 then it is difficult to visualize.

**Types of Multivariate Optimization: **

Depending on the constraints multivariate optimization may be categorized into three parts,

- Unconstrained multivariate optimization
- Multivariate optimization with equality constarint
- Multivariate optimization with inequality constarint

**Unconstrained multivariate optimization:**As the name suggests multivariate optimization with no constraints is known as unconstrained multivariate optimization.

**Example**:##### min x

_{1}+ 2x_{2}– x_{1}x_{2}+ 2x_{2}^{2}**Multivariate optimization with equality constarint:**In mathematics, equality is a relationship between two quantities or, more generally two mathematical expressions, asserting that the quantities have the same value, or that the expressions represent the same mathematical object. So if there is given an objective function with more than one decision variable and having an equality constarint then this is known as so.

**Example**:##### min 2x

_{1}^{2}+ 4x_{2}^{2}

st

3x_{1}+ 2x_{2}= 12Here x

_{1}and x_{2}are two decision variable with equality constraint 3x_{1}+ 2x_{2}= 12**Multivariate optimization with inequality constarint:**In mathematics, an inequality is a relation which makes a non-equal comparison between two numbers or other mathematical expressions. It is used most often to compare two numbers on the number line by their size. There are several different notations used to represent different kinds of inequalities. Among them**<, >, ≤, ≥**are the popular notation to represent different kinds of inequalities. So if there is given an objective function with more than one decision variable and having an inequality constarint then this is known as so.

**Example**:##### min 2x

_{1}^{2}+ 4x_{2}^{2}

st

3x_{1}+ 2x_{2}≤ 12Here x

_{1}and x_{2}are two decision variable with inequality constraint 3x_{1}+ 2x_{2}≤ 12

Attention reader! Don’t stop learning now. Get hold of all the important CS Theory concepts for SDE interviews with the CS Theory Course at a student-friendly price and become industry ready.

## Recommended Posts:

- Uni-variate Optimization vs Multivariate Optimization
- Multivariate Optimization - Gradient and Hessian
- Multivariate Optimization - KKT Conditions
- Unconstrained Multivariate Optimization
- Multivariate Optimization with Equality Constraint
- Univariate, Bivariate and Multivariate data and its analysis
- Optimization for Data Science
- Uni-variate Optimization - Data Science
- Difference Between Computer Science and Data Science
- Data Science Project Scope and Its Elements
- Difference Between Data Science and Data Mining
- Difference Between Big Data and Data Science
- Difference Between Data Science and Data Analytics
- Difference Between Data Science and Data Visualization
- Difference Between Data Science and Data Engineering
- Local and Global Optimum in Uni-variate Optimization
- Optimization techniques for Gradient Descent
- ADAM (Adaptive Moment Estimation) Optimization | ML
- Introduction to Ant Colony Optimization
- Hyperparameters Optimization methods - ML

If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to contribute@geeksforgeeks.org. See your article appearing on the GeeksforGeeks main page and help other Geeks.

Please Improve this article if you find anything incorrect by clicking on the "Improve Article" button below.