2. What do you
mean by
Interpolation
?
Interpolation is a technique of
obtaining the most likely estimate
of a certain quantity (dependent
variable) from the given relevant
facts under certain assumptions.
4. List out the
uses of
Interpolation
Prediction of the future or
estimating the future in economic
planning and policy formulation.
It is freely used to compare the
value of median and mode in
continuous series.
5. What are the
methods of
interpolation?
Graphic method
Algebraic method
* Binomial Expansion
method
* Newton’s method
Lagrange’s method
Parabolic curve method
6. What is
Newton’s
forward
method?
Newton's forward difference
formula is a finite difference
identity giving an interpolated value
between tabulated points in terms
of the first value and the powers of
the forward difference .
7. What is
Lagrange’s
method?
The method of Lagrange’s
multipliers is an important
technique applied to determine
the local maxima and minima of a
function of the form f(x, y, z) subject
to equality constraints of the form
g(x, y, z) = k or g(x, y, z) = 0.
8. What is
Binomial
expansion
method?
Binomial method is use to find the
missing value of the entry…
(Corresponding to the argument x).
Here (n) values of …… are known
so that ……… can be consider as a
polynomial up to degree (n-1).
10. What is
Transporta
tion?
The transportation model mainly
deals that how the cost of
transportation can be minimized or
the revenue of transportation can
be maximized by satisfying the
requirement of various destination
within the known constraints of
different sources of supply.
11. What is
feasible
solution?
A feasible solution to a
transportation problem is said to be
a basic solution if it contains no
more than m+ n-1 non-negative
allocations, where m is the number
of rows and n is the number of
columns of the transportation
problem.
13. What is
constraints
?
The linear inequalities or equations
or restrictions on the variables of a
linear programming problem are
called constraints.
15. What do you
mean by
assignment?
Assignment problem is a special
type of linear programming problem
which deals with the allocation of
the various resources to the various
activities on one to one basis.