






max f( x_{1}, x_{2}, ..., x_{n} ); subject to: g_{1}( x_{1}, x_{2}, ..., x_{n} ) = c_{1} // Equality constraints g_{2}( x_{1}, x_{2}, ..., x_{n} ) = c_{2} ... g_{u}( x_{1}, x_{2}, ..., x_{n} ) = c_{u} h_{1}( x_{1}, x_{2}, ..., x_{n} ) ≤ d_{1} // Inequality constraints h_{2}( x_{1}, x_{2}, ..., x_{n} ) ≤ d_{2} ... h_{v}( x_{1}, x_{2}, ..., x_{n} ) ≤ d_{v} 









that we will learn to solve later (when we talk about the branch and bound technique).