OR CCE-2

• M2022078- Ritesh Giri

• M2022095- Sunny Mishra
• M2022105-Jenil Shah
• M2022110- Vinay Sharma
• M2022112- Abhishek Singh
• M2022117- Jilesh Solkar

Guided By:-
Navin Bhatt
PROBLEM STATEMENT

Q. EXPLAIN THE CONCEPT OF LINEARITY IN LP?

EXPLAIN WITH EXAMPLE WHAT ARE THE
DIFFERENT TYPES OF CONSTRAINTS IN LP MODEL?
WHAT IS LINEAR PROGRAMMING?
Linear programming (LP, also called linear optimization) is a method to achieve the best outcome (such
as maximum profit or lowest cost) in a mathematical model whose requirements are represented by linear
relationships. Linear programming is a special case of mathematical programming (also known
as mathematical optimization).

More formally, linear programming is a technique for the optimization of a linear objective function,

subject to linear equality and linear inequality constraints. Its feasible region is a convex polytope, which
is a set defined as the intersection of finitely many half spaces, each of which is defined by a linear
inequality. Its objective function is a real-valued affine (linear) function defined on this polyhedron. A
linear programming algorithm finds a point in the polytope where this function has the smallest (or
largest) value if such a point exists.
WHEN TO USE LINEAR PROGRAMMING?
Linear programming can also be used to solve a problem when the goal of the problem is to maximize a
certain value and there is a linear system of inequalities that expresses the constraints of the problem

COMPONENTS OF LINEAR PROGRAMMING:

The normal components of the Linear
Programming are pointed out below:
•Decision Variables
•Constraints
•Data
•Objective Functions
CHARACTERISTICS OF LINEAR PROGRAMMING:

The following are the five characteristics of the linear programming problem:
1. Constraints – The limitations should be expressed in the mathematical form, regarding the resource.
2. Objective Function – In a problem, the objective function should be specified in a quantitative way.
3. Linearity – The relationship between two or more variables in the function should be linear.
4. Finiteness –  There should be finite and infinite input and output numbers. In case, if the function has infinite
factors, the optimal solution is not feasible. 
5. Non-negativity – The variable value should be positive or zero. It should not be a negative value.
CONCEPT ON LINEARITY IN LINEAR PROGRAMMING

Linearity In Linear Programming– The relationship between two or more variables in a function must be
linear. This means that the degree of the variable is equal to one.
 The basic requirements for the linear programming problem is that both goals and constraints must be
expressed as linear equations or inequalities
 If the number of machines in a plant is increased, the production in the plant also proportionately
increases
 The variable values should be positive or zero. It should not be negative value
TYPES OF CONSTRAINTS IN LINEAR PROGRAMMING MODELS-
Possible constraint types include
 Resource Limitations- Resource limitations depict relationships between endogenous resource usage and exogenous
resource endowments. A resource limitation restricts endogenous resource use to be less than or equal to an exogenous
resource endowment. An example of a resource limitation constraint is
3X + 4X ≤ 7
2 2

This constraint requires the sum of resources used in producing X1, which uses 3 resource units per unit, plus those used in
producing X2, which uses 4 resource units per unit, to be no greater than an exogenous resource endowment of 7 units.
Resource usage depends on the values of X1 and X2 determined by the model and thus is an endogenous quantity.
 Minimum Requirements- Minimum requirement constraints require an endogenously determined quantity to be greater
than or equal to an exogenously specified value. A simple illustration is
X + 2X ≥ 4
1 2

In this case the endogenous sum of X1 plus two times X2 is constrained to be greater than or equal to the exogenously
imposed requirement of four. The minimum requirement often specifies that the model must meet exogenous demand
through the endogenous supply of goods. This kind of constraint is present in many different types of programming
models.
 Supply-Demand Balances- The supply-demand balance requires that endogenous supply be balanced with
endogenous demand. In general, supply-demand balances are used to relate endogenous supply and demand to
exogenous supply and demand. The general case is given by
Demand En + Demand Ex ≤ SupplyEn + Supply Ex
Here, the sum of demand over endogenous and exogenous sources (respectively denoted by the subscripts En and Ex)
must be less than or equal to the supply from endogenous and exogenous sources. Manipulating the endogenous
variables to the left hand side and the exogenous items to the right hand side gives
DemandEn - SupplyEn ≤ SupplyEx - DemandEx
Here endogenous demand minus endogenous supply is less than or equal to exogenous supply minus exogenous
demand.
This constraint contains the resource limitation and minimum requirement constraints as special cases.
The resource limitation constraint exhibits zero endogenous supply and exogenous demand. The minimum
requirement constraint exhibits zero endogenous demand and exogenous supply.
THANK YOU