Scribd
Upload
4 views

LINEAR PROGRAMMING

Linear Programming is a mathematical technique used to optimize resource allocation under constraints to maximize profits or minimize costs. It involves formulating a model with an objective function, constraints, and a feasible region, and can be solved using graphical or simplex methods. The document outlines key terms, requirements for formulation, and examples of maximizing and minimizing problems.

Uploaded by

Kutosi Patrick Musa
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
4 views

LINEAR PROGRAMMING

Linear Programming is a mathematical technique used to optimize resource allocation under constraints to maximize profits or minimize costs. It involves formulating a model with an objective function, constraints, and a feasible region, and can be solved using graphical or simplex methods. The document outlines key terms, requirements for formulation, and examples of maximizing and minimizing problems.

Uploaded by

Kutosi Patrick Musa
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 5

LINEAR PROGRAMMING

Introduction

This was developed from a wider technique called programming.

Linear Programming is a mathematical tool used to get the best possible solution to a problem
involving limited or scarce resources like time, labor, materials etc.

Scarce resources are referred to as constraints where a manager is required to take decisions to
maximise profits or contribution or minimize cost.

Linear programming can be applied in the following areas;

Capacity allocation
Product mix
Transportation problems
Investment problems

TERMS USED IN LINEAR PROGRAMMING


Contribution; it is the excess of total revenue over total costs
Constraints; these are limited or scarce resources
Feasible region; this is the zone of acceptance i.e the values which are within that region satisfy
the equation
Objective function; this is the mathematical relationship that defines the values of the resources
and their contributions.
Optimal solution; this is the best combination that gives either the highest profit in a
maximizing problem or the lowest cost in a minimizing problem.

1|Page
BASIC REQUIREMENTS FOR FORMULATING A LINEAR PRORAMMING MODEL
 There must be a problem under study which must have an alternative
 There must be an objective to achieve, such an objective may be a maximizing problem
or minimizing problem.
 There must exist resource constraints. Where resources are not scarce you need not to
apply linear programming.
 There must be a mathematical linear relationship. The objective and resource constraints
must be represented in form of a linear equation and linear inequalities
 There is a non-negativity condition in setting resource constraints.

HOW TO SOLVE A LINEAR PROGRAMMING PROBLEM


There are two methods involved;
 Graphical method; this is mostly used only in situations where the variables do not
exceed two.
 Simplex method; this is used where there are two or more variables
CASES IN LINEAR PRORAMMING
There are two main cases i.e;
Maximizing problem
Minimizing problem

Maximizing problem
This is where the decision to be taken is to maximise profits in a situation of scarcity by
determining the appropriate product mix. It uses the less than or equal to symbol (≤) in the
inequalities that are stated for the constraint.
Minimizing problem
This focuses on the cost minimization in determining the appropriate product mix. It uses the
greater than or equal to (≥) symbol.

2|Page
GRAPHICAL METHOD
The following are the steps;
Summarize the information and state the objective function of the problem i.e either
maximize or minimize.
State the inequalities of the constraints
Convert the inequalities into equations
Determine the intercepts of the equation
Graph the equation
Shade the unwanted regions
Determine the feasible region
Substitute the coordinates. The coordinates with the highest value for a maximizing
problem is the optimal solution while the coordinates with the lowest value in a
minimizing problem is the optimal solution.
Example
A firm makes two products X and Y which must be produced through assembling and finishing.
Assembling has 90 hours available while finishing has 72 hours available. Manufacturing
product X requires 3 hours in assembling and 6 hours in finishing. While manufacturing product
Y requires 6 hours in assembling and 3 hours in finishing. If profits are Shs. 8,000 and Shs
10,000 foe X and Y respectively. Determine the best possible combination of products X and Y
that maximise profits.

Solution
Product Assembling Finishing Profit
X 3 6 8,000
Y 6 3 10,000
Available resources 90 Hours 72 Hours

State the objective function


The objective function is to maximise profits
Profit = 8,000x + 10,000y
State the inequalities

3|Page
3x + 6y ≤ 90 ……………… (i)
6x + 3y ≤ 72 ………………. (ii)
Non-negativity
X,Y ≥ 0……………………..(iii)
Convert the inequalities into equations
3x + 6y = 90
6x + 3y = 72
X,Y = 0
Determine the intercepts of equations
i) 3x + 6y = 90
Assume x = 0, then y = 15
Also assume y = 0, then x = 30
Coordinates (0,15) and (30,0)
ii) 6x + 3y = 72

Assume x = 0, then y = 24
Also assume y = 0, then x = 12
Coordinates (0,24) and (12,0)
GRAPH

4|Page
MINIMIZING PROBLEM
Provided there are only two unknowns, minimizing problem can also be dealt with using
graphical method. The general approach of drawing axes remains the same as far as a
maximizing problem but the following differences are observed.
Normally in a minimizing problem, the limited resources are represented by the greater or
equal to symbol so that the feasible region will lie above the graph.
The normal objective is to minimize costs so that the objective function will take the
form of minimize costs. Under this, the optimal point will be found from the cost line furthiest to
the left which still touches the feasible region.
Example
A farm manager wants to employ 12 men and 8 women and the limitations are as follows;
20 men + 40 women ≥ 40
80 men + 60 women ≥ 300
Required:
Using the graphical method, find the number of men and women that minimizes costs.

5|Page

You might also like