Scribd
Upload
27 views7 pages

Ramkrishna Mahato Government Engineering College

This document discusses linear programming problems (LPP) and their components. It defines key terms like decision variables, objective function, constraints, feasible region, and optimal solution. It also provides examples of common LPP applications in areas like transportation, production management, and military operations. Finally, it presents the standard mathematical formulation of an LPP and defines a feasible solution as one where the assigned values for decision variables satisfy all constraints without violating them.

Uploaded by

Rick
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
27 views7 pages

Ramkrishna Mahato Government Engineering College

This document discusses linear programming problems (LPP) and their components. It defines key terms like decision variables, objective function, constraints, feasible region, and optimal solution. It also provides examples of common LPP applications in areas like transportation, production management, and military operations. Finally, it presents the standard mathematical formulation of an LPP and defines a feasible solution as one where the assigned values for decision variables satisfy all constraints without violating them.

Uploaded by

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

Ramkrishna Mahato Government Engineering

College
Topic : Basic LPP and Applications; Various Components of LP Problem
Formulation. Definitions: Feasible Solution

Name : Purnendu Bayen


Roll No:35000120016
Paper Name : Operation
Research
Paper Code : OECCS701A
Basic LPP and Applications
› Personal Assignment Problem
› Transportation Problem
› Proficiency in Operation of Dam
System
› Agricultural Applications
› Military Applications
› Production Management
› Marketing Management
› Manpower Management
Various Components of LP Problem
Formulation
Linear programming (LP) is a mathematical method used to optimize a linear objective function subject to linear equality and inequality
constraints. The components of an LP problem formulation include:

Decision Variables: These are the variables that you are trying to optimize. They represent the quantities you want to determine in order to
achieve the best outcome. Decision variables are typically denoted by symbols like x, y, z, etc.

Objective Function: The objective function defines the goal of the optimization. It is a linear combination of the decision variables that you want
to either maximize or minimize. The goal can be to maximize profits, minimize costs, maximize efficiency, etc.

Constraints: Constraints are the limitations or conditions that the solution must satisfy. They are linear inequalities or equalities that restrict the
values the decision variables can take. Constraints represent real-world limitations such as resource availability, capacity restrictions, demand
requirements, etc.
Linear Relationships: In LP, both the objective function and constraints are linear relationships. This means that each term in the function or
constraint is either a constant or a multiple of a decision variable. The linear nature of the problem makes it computationally tractable.

Feasible Region: The feasible region is the set of all possible combinations of decision variable values that satisfy all the constraints. It
is the region in the solution space where the solution must lie.

Optimal Solution: The optimal solution is the combination of decision variables that maximizes or minimizes the objective function while
satisfying all the constraints. There can be a unique optimal solution or multiple optimal solutions, depending on the problem.

Non-negativity Constraints: In many LP problems, decision variables are constrained to be non-negative. This means that their values cannot be
negative since negative quantities often don't have practical meaning in many contexts.
A standard LP problem can be formulated mathematically as follows:

Maximize (or Minimize): C₁x₁ + C₂x₂ + ... + Cₙxₙ

Subject to:

A₁₁x₁ + A₁₂x₂ + ... + A₁ₙxₙ ≤ B₁

A₂₁x₁ + A₂₂x₂ + ... + A₂ₙxₙ ≤ B₂

...

Aₘ₁x₁ + Aₘ₂x₂ + ... + Aₘₙxₙ ≤ Bₘ

x₁ ≥ 0, x₂ ≥ 0, ..., xₙ ≥ 0

Where:

C₁, C₂, ..., Cₙ are the coefficients of


the objective function.

A₁₁, A₁₂, ..., Aₘₙ are coefficients of


the constraint inequalities.

B₁, B₂, ..., Bₘ are the right-hand sides of the constraint inequalities. x₁,

x₂, ..., xₙ are the decision variables to be determined.

When setting up an LP problem, it's important to carefully define the objective, constraints, and decision variables based on the specific real-world
problem you are trying to solve.
Feasible Solution
In linear programming (LP), a feasible solution refers to a set of values
assigned to the decision variables that satisfy all the constraints of the
problem. This means that when you plug these values into the constraints,
they don't violate any of the constraints.

A feasible solution must adhere to the following conditions:

1. Non-Negativity: The values of the decision variables must be non-


negative. This is because, in most real-world situations, you cannot
have negative quantities of resources, products, etc.

2. Constraint Satisfaction: When you substitute the values of the


decision variables into the constraint equations, the resulting
expressions must satisfy all the inequality and equality constraints
of the problem.
Thank You

You might also like