Scribd
Upload
14 views2 pages

Linear Programming

Linear Programming

Uploaded by

JairaMaree
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
14 views2 pages

Linear Programming

Linear Programming

Uploaded by

JairaMaree
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/ 2

Linear programming

- A method of dealing with decision problems that can be expressed as can


strained linear model.
- A mathematical technique for finding the best uses of an organization’s
resources.
Graphical Solution Method
- A 2 – dimensional geometric analysis of linear programming problems with 2
decision variables
Linear Programming Problem
- 2 unknown x and y is one which we are to determine the maximum and
minimum value of a linear expression
P = a, x + biy (for maximization)
C = a, x + biy (for maximization)
Called the objective function subject to a number of linear constraints of the
form.
A2x + b2y ≤ c or a2x + b2y ≥ c or a2x + b2y = c

Objective Function
- This is an expression which shows the relationship between the variables in
the problem and the firm’s goal.

[2 Types of Constraints]
1. Structural Constraints
- a limit on the availability of resources it is also referred as “explicit constraints”
2. Non-negativity Constraints
- restricts all the variable to zero and positive solution also referred and implicit
constraint
LINEAR PROGRAMMING MODEL
Maximize = P = 1200x + 1600y -> Objective Function
Subject to : 3x + 2y ≤ 18
2x + 4y ≤ 10
X≤5
X ≥ 0 , y ≥ 0 - Non-negativity Constraint

Optimal Value
- The highest (for maximization problem) or lowest value (for maximization
problem)
Optimal Solution
- Is a combination of decision variable amounts that yield the best possible
value of the objectives function and satisfies all the constraints.

Notes:
(increase) minimization ≥ at least
(decrease) maximization ≤ at most

You might also like