https://www.sciencedirect.

com/science/article/pii/S1474667016453565

https://en.wikipedia.org/wiki/Nonlinear_programming

https://www.britannica.com/science/optimization/Nonlinear-programming

The reserves for extracting oil and gas becoming hard and it is becoming expensive to
explore and re ine them for the inal commercial product. Now research community and
the oil and gas industries are making use of different optimization methods to optimise
traditional process industries to increase the pro it and decrease the cost of extraction
and re ining the raw materials to get the inal products. Nonlinear programming is one
of the optimization techniques that can be used for short-term production optimization
in an offshore oil and gas processing plant.

About Non Linear Programming

Nonlinear programming is minimizing or maximizing a nonlinear objective function

subject to bound constraints, linear constraints, or nonlinear constraints, where the
constraints can be inequalities or equalities.

An optimization problem is one of calculation of the extrema (maxima, minima or

stationary points) of an objective function over a set of unknown real variables and
conditional to the satisfaction of a system of equalities and inequalities, collectively
termed constraints. It is the sub- ield of mathematical optimization that deals with
problems that are not linear.

Theory
An optimization problem is nonlinear if the objective function 𝑓(𝑥) or any of
(𝑥) ≤ 0, 𝑖 = 1,2, … . . , 𝑚 , or equality
the inequality constraints 𝑐
constraints 𝑑 (𝑥) = 0, 𝑗 = 1,2, … . , 𝑛 are nonlinear functions of the vector of
variables x.

For example, if 𝑥 contains the components 𝑥 and 𝑥 , then the function

3 +
2𝑥 – 7𝑥 is linear, whereas the functions (𝑥 ) + 2𝑥 and 3𝑥 +
2𝑥 2𝑥 + 𝑥 are nonlinear.
Graphically Solving an example of Non linear programming.

Minimize 𝑧 = 𝑥 + 𝑦

Constraints
(1) 𝑥 + 𝑦 ≥ 8
(2) 𝑥 + 2𝑦 ≥ 10
(3) 2𝑥 + 𝑦 ≥ 10
(4) 𝑥, 𝑦 ≥ 0

Solution:
Step 1:
The objective function is non linear where as the constraints are linear.
Plotting the constraints on the graph.
We Have:

D X
 Here the feasible region is the shaded region ABCD

Step 2:
Since the objective function 𝑧 = 𝑥 + 𝑦 = (𝑟) represent a circle.
So If 𝑟 be the radius of this circle the we have to determine the minimum
value of the 𝑟 so that the circle with center (0,0) and radius ′𝑟′ just
touches the feasible region.

Step 3:
Here one of the side of the convex solution space should be tangent to the
circle. Thus the solution can be obtained by differentiation the equation.

𝑧 =𝑥 +𝑦

𝑛𝑜𝑤 𝑑𝑖𝑓𝑓𝑒𝑟𝑒𝑛𝑡𝑖𝑎𝑡𝑖𝑜𝑛 𝑡ℎ𝑒 𝑎𝑏𝑜𝑣𝑒 𝑒𝑞𝑢𝑎𝑡𝑖𝑜𝑛

2𝑥 𝑑𝑥 + 2𝑦 𝑑𝑦 = 0
=− -------(1)

Now differentiation all the 3 inequalities

(i) 𝑥+𝑦 ≥8

𝑑𝑥 + 𝑑𝑦 = 0
= −1 -------(2)

(ii) 𝑥 + 2𝑦 ≥ 10

𝑑𝑥 + 2 𝑑𝑦 = 0
=− -------(3)

(iii) 2𝑥 + 𝑦 ≥ 10
2 𝑑𝑥 + 𝑑𝑦 = 0
= −2 -------(4)
From equation (1) and (3) we have….
𝑥 1
− =−
𝑦 2
𝑦
𝑥=
2
Now putting this in the one of our inequalities constraint
𝑥 + 2𝑦 = 10
We have…. 𝑥 = 2 𝑎𝑛𝑑 𝑦 = 4
But this valyes of x and y dose not satisfy the constraint inequalities equation.
Se we are considering the other 2 equation (1) and (2)
And we have…

𝑥
− = −1
𝑦
𝑥=𝑦

Now putting this in the one of our inequalities constraint

𝑥+𝑦 ≥8
We have …. 𝑥 = 4 𝑎𝑛𝑑 𝑦 = 4

Now these value of x and y satisfy all the constraints.

So the optimum solution is……

𝑧 =𝑥 +𝑦
=4 + 4
= 32
Now 𝑝𝑢𝑡𝑡𝑖𝑛𝑔 𝑡ℎ𝑖𝑠 𝑖𝑛 𝑡ℎ𝑒 𝑔𝑟𝑎𝑝ℎ 𝑤𝑒 ℎ𝑎𝑣𝑒 … … ..
 This is the op mum point

(4,4)