Scribd
Upload
9 views

Maths CDF Points

Uploaded by

abiranmeenaabiranmeena
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
9 views

Maths CDF Points

Uploaded by

abiranmeenaabiranmeena
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 1

+2 CBSE MATHEMATICS CDF MATERIAL

14. LINEAR PROGRAMM0NG


function is called
1. An Optimisation problem: Aproblem which secks to maximise or minimise a
an optimisation problem.
2. Alinear programming problem (maximisation/minimisatíon) ofa linear
Alincar progrannming problem dcals with the optimisation that
function oftwo variables (say xand y) known as objective function subject to the conditions
constraints).
the variables are non-negative and satisty a set of lincar inequalities (called linear
3. Objective function: Linear function Z = ax + by where, a, bare constants, which has to be
maximised or minimized is called linear objective function.
4. Decision variables: In the objective function Z = ax + by, x and y are called decision varibles.
5 Constraints: The linear inequalities or equations or restrictions on the variables ofa linear
programming problemare called constraints.The conditions x > 0,y >0 are called
non - negative restrictions.
6. Feasible region : The common region determined by all the constraints including the
non-negitive constraints x >0,y>0 ofa linear programming problemis called the feasible
region (or solution region) for the problem.
1. Infeasible region: The region other than feasible region is called an infeasible region.
8 Feasible solution : The Points within and on the boundary ofthe feasible region for an LPP
represents feasible solutions.
9 Infeasible solution: Any point outside the feasible region is called an infeasible solution.
10. Optimal (feasible) solution:Any point in the feasible region that givesthe optimal value
(maximum or minimum) ofthe objective function is called an optimal solution.
11. The following theorems are fundamental in solving linear programming problems
Theorem (1) :Let Rbe the feasible region (convex polygon) for alinear programming problem
and let Z =a+by be the objective function. when Zhas an optimal value(maximumor
minimum),where the variables xand yare subject to costaints described bylinear inequalities,
this optimal value must occur at convex point (vertex) ofthe feasible region.
Theorem (2):-Let Rbe the feasible region for alinear programming problem and Z= a+by
be the obiective function. IfR is bounded then the objective function Zhas both amaximum and
a minimum value onR and each ofthese occurs at a corner point (vertex) ofR.
If the feasable region in unbounded then amaximum or minimum may not exist. However ifit
exists it must occur at a corner point ofR
12. Corner point: Cornerpoint offeasible region is apoint in theregion which is the intersection of
two boundary lines.
13. Bounded feasible region:Afeasible region ofa system of linear inequalities is said to be
bounded ifit can be enclosed within a circle.
14. Unbounded feasible region :Unbounded feasible region means that the feasible region does
extend idenfinitely in any direction.
15. General features oflinear programming problems
i) The feasible region is always aconvex region.
i) The maximum (or mimimum) solution ofthe objective function occurs at the vertex ( corner) of
the feasible region.
ii) Iftwo corner points produce the same maximum(or minimum) value of the objective func
tion, then every point on the line segment joiningthese points will also give the same maximum(
or minimum) value.

NARAYANA GROUP
Page No. (31]|

You might also like