The bother constraints and the objective function ar built from information regarding the problem statement. Linear computer schedule role model structure consists of four components, namely; objectives, constraints, decision variable, parameters (userweb.port.ac.uk, 2011). An objective or goal needs to be specified for the model which could be maximization or minimization objective. The objective function is the mathematical expression which is used to model a problem.
A couple of assumptions are made about linear programming problems;
Certainty: Coefficients used in a model are known and constant.
Divisibility: Decision variables could be broken down into non-integer values.
Additivity : amount of the contributions of each term gives the function value.
Proportionality: Change in variables proportionality affects the contribution of the variable to the value of the function (userweb.port.ac.uk, 2011).
When find out an optimal solution to a linear programming problem, the crusade fundament have one of three results; the problem talent be unsolvable, feasible (and non fertilization) or feasible and binding from which an optimal solution can be determined (highered.mcgraw-hill.com, 2011). Usually, solutions to linear programming problems are shaped by constraints on the problem. When constraints are binding on a model, a feasible region can be identified within which an optimal solution could be established. If the optimal solution is restricted to the feasible region, constraints on the problem can be said to be (binding) more of the essence(predicate) than the objective function. This is generally the case for many linear programming problems. Beyond the feasible...If you want to get a full essay, send it on our website: Ordercustompaper.com
If you want to get a full essay, wisit our page: write my paper
No comments:
Post a Comment