The LPP is a class of mathematical programming where the functions representing the objectives and the constraints are linear. Optimisation refers to the maximisation or minimisation of the objective functions.
The following are the characteristics of this form.
• All decision variables are non-negative.
• All constraints are of = type.
• The objective function is of the maximisation type.
Chat with our AI personalities
It is a linear model.
It could be any value
There is not enough information to say much. To start with, the correlation may not be significant. Furthermore, a linear relationship may not be an appropriate model. If you assume that a linear model is appropriate and if you assume that there is evidence to indicate that the correlation is significant (by this time you might as well assume anything you want!) then you could say that the dependent variable increases by 1.67 for every unit change in the independent variable - within the range of the independent variable.
Linear functions are used to model situations that show a constant rate of change between 2 variables. For example, the relation between feet and inches is always 12 inches/foot. so a linear function would be y = 12 x where y is the number of inches and x is the number of feet. y = 24 x models the number of hours in any given number of days {x}. Business applications abound. If a cell phone company charges a start-up fee of $50 and then $.05 for every minute used, the function is y = .05 x + 50.
The differnce between a verbal model and a algebraic model is that a verbal model is an equation written in words and a algebraic model is solving the equation from the verbal model.