NLPP

21 October 2022 22:12

New Section 1 Page 1

New Section 1 Page 2
01 November 2022 13:47

Problem.
A manufacturing company produces two products: Radios and Tv sets. Sales price relationship for these two products are
given below:

Products Quantity Demanded Unit price

Radio 1500-5
Tv 3800-10

The total cost functions for these two products are given by 200 + 0.1 and 300 + 0.1 respectively. The
production takes place on two assembly lines. Radio sets are assembled on Assembly line 1 and TV sets are assembled on
Assembly line II. Because of the limitations of the assembly line capacities, the daily production is limited to nomore than
80 radio sets and 60 TV sets. The production of both types of products require electronic components. The production of
each of these sets requires five units and six units of electronic equipment components respectively. The electronic
components are supplied by another manufacturer, and the supplyis limited to 600 units per day. The company has 160
employees, the labor supply amounts to 160 man-days. The production of one unit of radio set requires 1 man-day of
labor, whereas 2 man-days of labor are required for a TV set. How many units of radio and TV sets should the company
produce in order to maximize the total profit. Formulate the problem as a non-linear Programming problem.

New Section 1 Page 3

Global & Local Max/Min
06 November 2022 23:05

An optimization problem is a problem, where we maximize/minimize an objective function subject to some given conditions.
If the objective function or the conditions are nonlinear, then we say the optimal problem is a nonlinear programming
problem or nonlinear optimization problem. We know that for LPP, the optimal solution is achieved at some extremal
points of the feasible region. It may not be true for nonlinear programming. For example,
consider the problem:
Maximize z =
subject to 4 + ≤ 8, ≥ 0.

The maximum value of k for which the parabola = k has a common point with the
feasible region is 4. The parabola = 4 touches the region at (1, 4), which is not an
extreme point.

Let f : → . The function f has global minimum at if f( ) ≥ f( ) for all ∈ , and has global maximum at if f( ) ≤
f( ) for all ∈ . We say f( ) has a local minimum at = if there exists r > 0 such that f( ) ≥ f( ) for all ∈ with
∥ - ∥ < r. We say f(x) has a local maximum at = if there exists r > 0 such that f( ) ≤ f( ) for all ∈ with ∥ - ∥ < r.

n = 1. We say f( ) has a local minimum at x = x∗ if there exists r > 0 such that f( ) ≥ f( ) for all −r < x < + r.
We say f(x) has a local maximum at x = x∗ if there exists r > 0 such that f( ) ≤ f( ) for all −r < x < + r.

n = 2. We say f( ) has a local minimum at ( )=( ) if there exists r > 0 such that f( ) ≥ f( ) for all ( )
∈ with − + − < .
We say f(x) has a local maximum at ( )=( ) if there exists r > 0 such that f( ) ≤ f( ) for all ( )∈ with
− + − < .

New Section 1 Page 4

10 November 2022 18:39

Find the natures of the extreme points of the function

The necessary condition for extreme points is

New Section 1 Page 5

NLPP without Constraint (Unconstrained NLPP)

NOTE: How can we determine whether a function f ( ,..., ) of n variables is convex or concave on a subset of ?
We assume that f ( ,..., ) has continuous second-order partial derivatives.

Clairot's theorem:
If and are
both continuous,
then = .

NOTE:
 In quadratic form, Hessian Matrix is always
twice of symmetric matrix.
 The Hessian matrix is a symmetric
matrix containing all the second derivatives of the
multivariate function.

New Section 1 Page 6

Maxima/Minima of NLPP
01 November 2022 16:21

New Section 1 Page 7

03 November 2022 15:48

A Positive definite form

A Positive definite form
A Negative definite form

A Indefinite form
A Positive semi-definite form
A Negative semi-definite form

New Section 1 Page 8

NLPP Unconstraint
11 November 2022 09:18

New Section 1 Page 9

New Section 1 Page 10
New Section 1 Page 11
New Section 1 Page 12