You must have Credits on your Balance to download this sample
Logic & Programming
Pages 3 (753 words)
Introduction Linear programming is a mathematical process of optimization by which one minimizes or maximizes a given function known as the objective function, subject to a finite number of linear constraints, which may be in the form of equations or inequalities (Karloff, 2008).
The applications of linear programming span providing solutions to problems involving economics, computer science, and practically any other industry that requires a production schedule or an actual scheduling process. Moreover, the optimizing feature of linear programming makes it a necessity for people in the management circle to be familiar with. Simplex algorithm A linear programming model is typically solved using a simplex algorithm, or sometimes also referred to as the linear solver (Powell & Baker, 2010). The simplex algorithm involves a series of steps which employs the use of slack and basic variables to change the inequality constraints to equations so that the derived system of equations may be solved to find a feasible solution area. The extreme points of this feasible solution area are then tested by plugging them in to the objective function in order to find out which gives the optimal solution (Singiresu, 2009). Linear Programming Models There are a number of models that may be used to generate the solution to a linear programming model. ...
Not exactly what you need?