In mathematics and computer science, dynamic programming is a method for solving complex

problems by breaking them down into simpler subproblems. It is applicable to problems

exhibiting the properties of overlapping subproblems which are only slightly smaller[1] and
optimal substructure (described below). When applicable, the method takes far less time than
naïve methods.

In nonlinear programming, the function, expressing given conditions for a system, which one
seeks to minimize subject to given constraints.

One type of variable introduced in a linear program model in order to find an initial basic
feasible solution; an artificial variable is used for equality constraints and for greater-than or
equal inequality constraints.

The public float or simply the "float" of a public company is the number of outstanding shares
in the hands of public investors as opposed to company officers, directors, or controlling-interest
investors.[1] These are the shares that are available for trading. The float is calculated by
subtracting restricted shares from outstanding shares. For example, a company may have ten
million outstanding shares, but only seven million are trading on the stock market. Therefore,
this company's float would be seven million. Stocks with smaller floats tend to be more volatile
than those with larger floats.[2] Large holdings of founding shareholders, corporate cross-holdings
and holdings of the Government in partially privatized companies are usually excluded while
computing the public float.