Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Scribd
Upload
5 views

Group A Presentation On Linear Programming

Uploaded by

Onyekachi Afam
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
5 views

Group A Presentation On Linear Programming

Uploaded by

Onyekachi Afam
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 3

Group Presentation on Linear

Programming
Introduction (Joshua):
Okay, I will start by going through the history of linear programming
Linear programming was used in the World War 2 and that’s where it gained its
popularity since it was used to solve complex distribution challenges which included
transportation, logistics, scheduling and resource allocation.
The resource allocation includes things like:
1. The machinery/materials (tools used in making a process easy)
2. Labour (The work force employed to carry out operations)
3. Capital. In this case I want to define it not as money used in starting up a
business but the money used in running the business
Other resources include time and raw material

With all these resources listed it brings us to the meaning of linear programming:
In a simple form, linear programming can be seen as the mathematical
methods/techniques used in finding the best solution to a problem, like getting the
most profit or spending the least money on resources based on constraints i.e.
limitations or availability of material and cost

Process (Emmanuel):
Before a model can be constructed, there are certain properties of a good model that
must be considered:
1) the relationship between the constraints and variables must be linear
2) the model must have an objective function
3) the model must have definite structural constraints
4) the model must have non-negativity constraints.

These criteria are needed in the processes if creating a good linear programming
model must be achieved.
The processes of linear programming models involve the following steps:
1) Formulation:
The stage of formulation includes:
i) Define the problem and goal: This involved articulating the issues or opportunities,
identifying the key objectives or goals, determining the scope and boundaries of the
problems, and developing a concise problem statement.
ii) Identify the variables: This comprises determining the variables that are to be
manipulated in achieving the desired goal, identifying the variables that are to be used
in measuring the objective function, considering the variables that are to be
constrained, and ensuring the variables are measurable and relevant.
iii) Specify the objective function: This has to do with defining the objective function
to be optimized, determining if the objective function is to be minimized or
maximized, ensuring the objective function is linear and feasible, and considering the
units and scaling of the objective function.
if) Defining constraints: This centers on identifying the limitations and restrictions of
the unknown variables, determining whether the constraints are linear and feasible,
and considering the implications of violating the constraints. It also involves deciding
if the objective function is one suited to equations or equalities.

Techniques (Afedia Glory):


1. Simplex method: This method is a step-by-step approach used to solve linear
programming in which one graduates from a feasible solution to a better possible
solution until the optimal solution is reached. And the optimal solution is reached
where all the variables in the objective functions are all zeros or negative.
2. Graphical method - The graphical method is a visual approach to solving linear
problems using two variables.
We usually use the graphical method for two decision variables
The reason why we don’t use the graphical method for more than two decision
variables is because of the complexity of the visual representation.
Steps To take when solving linear problems using graphical method
1. Formulate the linear programming problem
2. Graph the constraints meaning that we’ll construct the graph and plot the two
constraints
3. Determine the valid side of each constraint
4. Identify the feasible region
5. Determine the value of the decision variables at the fiber point

3. Open server method: Open solver is a tool that is designed to solve models of
linear programming.
It allows you to solve linear and mixed optimization methods in a Google Spreadsheet
without arbitrary dice restrictions

Example (Phire D):


A caterer has the following materials available: 24 bags of tomatoes, 15 bags of
pepper, and 15 bags of curry. A pot of stew requires 4 bags of tomatoes, 1 bags of
pepper and 2 bags of curry. A pot of egg sauce requires 3 bags of tomatoes, 1 bag of
pepper and 3 bags of curry. If a plate of stew sells for #500 and a plate of egg sauce
sells for #700, and 12 plates make 1 pot, how many pots of each should he make to
achieve maximum profit

You might also like