Scribd
Upload
26 views

Linear Programming Part

Linear programming is a technique developed in the 1940s to optimize a linear objective function subject to linear equality and inequality constraints. It identifies relationships among variables and can be used for product mix or blending problems. A linear programming problem consists of decision variables, an objective function to maximize or minimize, constraints, and input-output coefficients. It allows for optimal resource allocation but assumes parameters are constant and there is a single objective, limiting its real-world applicability. Formulating a linear programming model involves identifying decision variables and constraints, gathering relevant data, and expressing the objective function and constraints mathematically.

Uploaded by

Meryl Bolilan
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
26 views

Linear Programming Part

Linear programming is a technique developed in the 1940s to optimize a linear objective function subject to linear equality and inequality constraints. It identifies relationships among variables and can be used for product mix or blending problems. A linear programming problem consists of decision variables, an objective function to maximize or minimize, constraints, and input-output coefficients. It allows for optimal resource allocation but assumes parameters are constant and there is a single objective, limiting its real-world applicability. Formulating a linear programming model involves identifying decision variables and constraints, gathering relevant data, and expressing the objective function and constraints mathematically.

Uploaded by

Meryl Bolilan
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/ 3

LINEAR PROGRAMMING ( PART 1 )

- Linear Programming identifies the linear relationships among variables in a manufacturing or


production process.
- In the 1940’s, George Dantzig an American mathematical scientist developed linear
programming for an air force project to manage an efficient way to assign soldiers, weapons,
and supplies during World War II. It was originally called "programming in a linear structure" but
later shortened to "linear programming".

2 Common linear programming problems

Product mix problem

- The decision maker has to solve for which product to include and in what quantities should be
included in the production plan that will help achieve profit maximization.

Blending problem

- Deals with finding the best blend of available raw materials or ingredients that will contribute to
cost efficiency.

Structure of a linear programming problem

The standard structure of an linear programming problem consist of the following:

Decision Variables

- Variables whose value s are to be determined


- The main characteristics of a decision variable are controllable, continuous and non-negative

Objective Function

- A mathematical expression of the relationship between the decision variable and a single goals.
Goals are given as total profit, total cost, market share etc.

Profit or Cost Coefficient

- Expressed as the rate at which the value of the objective function is increased based on the
decision variables.

Constraints

- The use of resources has limitations or production has certain requirements, and these consider
constraints.

Input-Output Coefficients

- Express the rate at which a resource is put to use


Capacities

- The capacities or availability of the varying resources are indicated by their highest or lowest
limit

Optimization

- The goals of the objective can be either maximize or minimize

Non-negativity

- Decision Variables are required to be non-negative ( 0 or positive ) values.

Advantages and Limitations of Linear Programming

Advantages

1. Resources are deployed productively and efficiently with the use of linear programming
2. The Approach to decision-making is geared toward objectively. Decision makers improve the
quality of decisions and enhance their ability to come to more sensible conclusions.
3. The optimal use of resources is attained by taking into account the constraints of a production
problem or business scenario
4. Bottlenecks are vital considerations when making a decision

Limitations

1. The decision variables, constrains and objective function are not always linearly related in real
life situations
2. Decision variables do not always result to get an integer value. To round off to the nearest
integer might not give an optimal solution
3. The effects of time and uncertainty are ignored in the linear programming solution
4. Parameters in linear programming are assumed to be constant, which contradicts real business
situations
5. An linear programming is focused on one main objective. On the other hand decisions in real life
are oftentimes characterized by multiple incompatible objectives.

Guidelines on linear programming model formulation

Step1: Identify decision Variables. Gather data on the constraints and explore the applicable objective
function.

Step2: Identify the data/information related to the problem, such as constants and parameters

Step3: Formulate the constraints. Express the constraints in linear equality or inequality based on the
identified decision variables in step 1
Step4: Formulate the objective function. First decide whether the objective is maximization or
minimization. Then, express it in linear mathematical terms using the decision variables, taking into
consideration the problem desired goal ( profit or cost )

You might also like