Non-Linear Submitted By:

Programming -Ambar Malik (226)

-Warda Naz (243)

-Madiha Saeed (230)

-Omaima Gillian (239)

-Zahra Zafar (237)

BS ECONOMICS 5th SEMESTER

Submitted To:
-Ma’am Anam Anwar
 Introduction:
– Mathematical Economics is the study of empirical observations using statiscal
methods of estimation and hypothesis testing. It is application of mathematics
to the purely theoretical aspects of economic analysis.
– Non-Linear Programming is that branch of mathematical programming in
which either the objective function or the constraints (at least one), or both
objective and constraints are non-linear.
– In mathematics, nonlinear programming (NLP) is the process of solving
an optimization problem where some of the constraints or the objective
function are nonlinear. It is the sub-field of mathematical optimization that
deals with problems that are not linear.
– A nonlinear system is a system in which the change of the
output is not proportional to the change of the input.
– Nonlinear programming is a process of solving an
optimization problem.
 Economic Applications:
The first application of economics on the theorems is:
UTILITY MAXIMIZATION :
In simple maximization of utility problem we came across the equations:
U=U(X1 + X2) subject to the income constraint P1X1 + P2X2=B
 The constraint appears as an equality, and the choice variables are not
specifically restricted to be non negative. It is know possible to restate the
problem in a more realistic form. Taking the n variable case, we can write it as
a linear program as :
Maximize: U(x1,X2, … , Xn), subject P1X1 + P2X2+ … + PnXn ,<=B
Where X1, X2 , … , Xn >= 0
Where all the prices are taken to be exogenous. In this new formation, the
consumer is allowed the option of spending less than Budget amount B.
UTILITY MAXIMIZATION:

 Moreover, this states that the amount purchased of any commodity cannot
be negative, is explicitly stated in the problem. Since the constraint
function g’(x)=P1 X1 + P2 X2 + … +Pn Xn is linear, the constraint
qualification is satisfied, and the Kuhn tucker maximization conditions are
necessary and sufficient if the other conditions cited in either of the two
sufficiency theorems are met.
 To Apply Kuhn-Tucker theorem, we would want U(x) to be
differentiable and concave and g’(x) to be differentiable and convex. The
latter is automatically satisfied since g’(x) is linear, but the former has to
taken care of by explicitly model specification.
 Checking Arrow-Enthoven theorem, we note that it is only needed to
specify U(x) to be differentiable and quasi-concave _______ a less
stringent requirement, provided that the condition (d) can be duly
satisfied. There are of course, other ways to satisfy the condition (d) so as
to make the Kuhn-Tucker conditions necessary and sufficient.
UTILITY MAXIMIZATION:

 The Quasi-concavity specification is perfectly in line with our earlier

discussion of classical consumer theory. However, in a Two-
Commodity Model with an equality constraint in the U(x) function was
specified to be strictly quasi-concave.
 Utility function U(x) is strictly Quasi-concave:
The purpose of strictness is that the bell shape utility function is in
indifference curve rather than wide zone between (X1 and X2).
 According to classical tradition
Budget constraint unequal that’s why things or goods will be different .
 Utility function U(x) is Non-satiation:
If utility function increase of X1 and X2 then it is non-satiation.
For only then it makes sense to speak of a point of tangency optimal
solution in classical tradition. But when the budget constraint is an
inequality, things will be different. Here we shall not seek a point of
tangency, rather an optimal point.
QUASI-CONCAVITY CURVE:
Explanation of curve:
Non-satiation means never satisfy

Indifference curve:
 Curve is downward sloping convex type rather than round & oval loops.
 Rather than satiation point(equilibrium point) is non-linear due to budget.
 This condition known as Arrow Einthoven Snow Theorem i.e,( d- ii)
 Its show that U(x) is not necessary to increase.

The rationale for this assumption is again to be found in tangency, solution feature of
classical framework. For, although a tangency point like H would indeed represent
the best choice under the circumstances because ascent to peak of utility surface, via
a movement toward point A, in the base plan, is precluded by the budget, tangency
points on the far side of the peak.
Economic Applications:
The Second application of economics on the theorems is:
LEAST COST COMBINATION :
 Let the production function of firm be of the CDPF type:
Q = k𝛼 𝐿𝛽 , where 0 < 𝛼, 𝛽 < 1. Also, let Pk > 0 be exogenously determined. Then
the least cost combination problem can be stated as the non-linear program:
Maximize C = Pk K + Pl L subject to K𝛼 𝐿𝛽 ≥ 𝑄0 , Q0 > 0 and K, L >= 0.
 In latter case, each successive unit increment in output will require less than
proportionate increase in the two inputs. Geometrically, the successive isoquants
for unit increments in output will become more tightly spaced as we move away
from the point of origin on any given ray in the KL-Plane.
 Accordingly the projection of such a ray on the production surface will produce a
curve showing increasingly more rapid ascent, so that the surface cannot be
concave.
 Kuhn-Tucker sufficiency theorem becomes in applicable there are IRS.
 LEAST COST COMBINATION :
 Accordingly the projection of such a ray on the production surface will produce a curves
showing increasingly more rapid ascent, so that the surface cannot be concave.
 In view of this, the Kuhn-Tucker sufficiency theorem becomes inapplicable when there are
IRS. In contrast, the Arrow-Enthoven theorem is applicable even then, For a minimation
problem, the latter theorem specifies a quasi-convex objective function and quasi-concave
constant function (s). These specifications are indeed met in the present problem. In addition,
condition (d-i) is satisfied, because for a minimization problem we are supposed to have
Fj(𝑥) > 0 for some choice variable Xj, and we do have
𝜕𝐶 𝜕𝐶
= Pk > 0 and = PK > 0
𝜕𝐾 𝜕𝐿
For all values of K and L
 There exists a non-negative ordered pair (K,L) that satisfies the constraint as a strict
inequality.
 Consequently, with the constraint qualification satisfied, the Kuhn tucker minimum
conditions can be taken as necessary and sufficient according to the Arrow- Ethnoven
theorem.
 Nonlinear Programming via Kuhn-
tucker conditions
Introduction:
In non-linear programming there exists a similar type of first-order
condition, known as the Kuhn-Tucker Conditions .

UNIFIED TREATMENT:
These more general conditions provide a unified treatment of
constraints:
 we allow for inequality constraints
 there may be any number of constraints
 Constraints may be binding or not binding at the solution
-Non-negativity constraints can be included.
-Boundary solutions (some 𝐱𝐢′ s = 0) are permitted;
-Non-negativity and structural constraints are treated in the
same way;
-Dual variables ( also called Lagrange multipliers ) are
shadow values (i.e, marginal values).

THE KUHN-TUCKER CONDITIONS:-

Let f : 𝑹𝒏 → 𝑹 𝒂𝒏𝒅 𝑮 ∶ 𝑹𝒏 → 𝑹𝒎 𝑏𝑒
continuously differentiable functions, and let b ∈ R𝑚 . We want
characterize those vectors 𝐱 ∈ Rn that satisfy
(∗) 𝐱 is a solution of the problem
Maximize f(x) subject to x ≧ 𝟎 and G x ≦ b,
i,.e, subject to 𝑥1 , 𝑥2 ,………….𝑥𝑛 ≧ 𝟎 and to 𝐺 ⅈ 𝑥 ≦ 𝑏𝑖 for i
= 1,……,m.
The Kuhn-Tucker conditions are the first-order conditions that
characterize the vectors 𝑥 that satisfy (∗) ( when appropriate
second-order conditions are satisfied, which we see momentarily):
∃𝜆1 , … … … . 𝜆𝑚 ∈ 𝑅+ 𝑠𝑢𝑐ℎ 𝑡ℎ𝑎𝑡

𝜕𝑓 𝑚 𝜕𝐺 ⅈ
(KT1) For j = 1,……n : ≦ 𝛴ⅈ=1 𝜆𝑖 with equality if 𝑥𝑗 > 0;
𝜕𝑥𝑗 𝜕𝑥𝑗

(KT2) For i = 1,......m : 𝐺 ⅈ (𝐱) ≦ 𝑏𝑖 with equality if 𝜆𝑖 > 0 ,

Where the partial derivatives are evaluated at 𝐱. The scalars 𝜆𝑖 are

called Lagrange multipliers.
ANY
QUESTIONS?