Noida Institute of Engineering and Technology, Greater Noida

Linear Programming

Unit: 1

Subject Name and Subject code:

Optimization And Numerical Techniques (BAS0404) Dr. Sarang Sadawarte
Department of
B Tech 4th Sem: DS/AI/AIML/CYS Mathematics

Faculty Name: Dr. Sarang Sadawarte Unit Number 1

1
02/25/2025
 Faculty Introduction
Dr. Sarang Sadawarte
Assistant Professor
Department of Mathematics

Qualifications :
Ph. D
Ph.D. Thesis : SOME NEW VARIANTS OF GRAPH LABELING AND
THEIR APPLICATIONS
International Journal Publications: 7
Book Chapter: 1
Teaching Experience: 5 years

Faculty Name: Dr. Sarang Sadawarte

02/25/2025 2
Unit Number 1
 Evaluation Scheme

SEMESTER-IV
Periods Evaluation Schemes End
Total Credit
Subject Semester
S. No. Subject
Code
L T P CT TA TOTAL PS TE PE

Optimization and Numerical

BAS0404 Techniques 3 1 0 30 20 50 100 150 4
1

2 BASL0401 Technical Communication 2 1 0 30 20 50 50 100 4

3 BCSE0401 Data Structures and Algorithm-II 3 0 0 30 20 50 100 150 3

Theory of Automata and Formal
BCSE0404 Languages 3 0 0 30 20 50 100 150 3
4

5 BCSE0403 Operating Systems 2 0 0 30 20 50 50 100 3

Database Management Systems

BCSE0452 0 0 6 50 100 150 3
6

7 BCSE0451 Data Structures and Algorithm-II Lab 0 0 4 50 50 100 1

8 BCSE0453 Operating Systems Lab 0 0 4 50 50 100 2

9 BASL0451 Technical Communication Lab 0 0 2 25 25 50 1

10 BCSE0459 Mini Project using Open Technology 0 0 2 50 50 0

Environmental Science / Artificial
BNC0402/ Intelligence and Cyber Ethics 2 0 0 30 20 50 50 100 4
11
BNC0401
MOOCs (For B.Tech. Hons. Degree)

TOTAL 1100 24

Faculty Name: Dr. Sarang Sadawarte

02/25/2025 3
Unit Number 1
 SYLLABUS

Faculty Name: Dr. Sarang Sadawarte

02/25/2025 4
Unit Number 1
 Branch Wise Application

 It helps to find minimum error or best solution for a problem. For

example, in regression, error is calculated as: Optimization helps
find a minimum value for the loss function. ... It is also called a
functional approximation problem and is widely used in data
science.

Faculty Name: Dr. Sarang Sadawarte

02/25/2025 5
Unit Number 1
 Course Objective

• Course objective: The objective of this course is to familiarize the

engineers with concept of Linear Programming Problem (LPP), Integer
Programming Problems, Constraint programming, various numerical
techniques for mathematical task such as roots, integration, differential
equations and numerical aptitude. It aims to show case the students
with standard concepts and tools from B. Tech to deal with advanced
level of mathematics and applications that would be essential for their
disciplines. The student will be able to understand:
• The concept of Linear Programming Problem .
• The concept of Integer Programming Problems.
• The concept of Non-Linear Programming Problem .
• The concept of Numerical Techniques.
• The concept of Numerical aptitude.

Faculty Name: Dr. Sarang Sadawarte

02/25/2025 6
Unit Number 1
 COURSE OUTCOMES
CO1: Understand the concepts to formulate and to solve a Linear K1,
Programming Problem. K3
CO2: Understand the concepts of Integer Programming Problem. K1,
K3
CO3: Understand the concepts of Non-Linear Programming Problem. K1,
K3
CO4: Apply the concept of numerical techniques to evaluate the zeroes of K3
the
Equation, concept of interpolation and numerical methods for various
mathematical operations and tasks, such as integration, the solution of linear
system of equations and the solution of differential equation.

CO5: Solve the problems of Time & Work, Pipe & Cistern, Time, Speed & K3
Distance, Boat &Stream, Analogy.
 Program Outcome

Faculty Name: Dr. Sarang Sadawarte

02/25/2025 8
Unit Number 1
 PSO

PSO Program Specific Outcomes(PSOs)

PSO1 The ability to identify, analyze real world problems and design
their ethical solutions using artificial intelligence, robotics,
virtual/augmented reality, data analytics, block chain technology,
and cloud computing
PSO2 The ability to design and develop the hardware sensor devices
and related interfacing software systems for solving complex
engineering problems.
PSO3 The ability to understand inter disciplinary computing techniques
and to apply them in the design of advanced computing.
PSO4 The ability to conduct investigation of complex problem with the
help of technical, managerial, leadership qualities, and modern
engineering tools provided by industry sponsored laboratories.

Faculty Name: Dr. Sarang Sadawarte

02/25/2025 9
Unit Number 1
 CO-PO Mapping(CO1)

*L= Low *M= Medium *H= High

Faculty Name: Dr. Sarang Sadawarte

02/25/2025 10
Unit Number 1
 CO-PSO Mapping(CO1)

CO PSO1 PSO2 PSO3 PSO4

H L M L
CO.1
L M L M
CO.2
M M M M
CO.3
H M M M
CO.4
H M M M
CO.5

*L= Low *M= Medium *H= High

Faculty Name: Dr. Sarang Sadawarte

02/25/2025 11
Unit Number 1
 Program Educational Objectives(PEOs)

PEO-1: To have an excellent scientific and engineering breadth so as to

comprehend, analyze, design and provide sustainable solutions for real-
life problems using state-of-the-art technologies.
PEO-2: To have a successful career in industries, to pursue higher
studies or to support entrepreneurial endeavors and to face the global
challenges.
PEO-3: To have an effective communication skills, professional
attitude, ethical values and a desire to learn specific knowledge in
emerging trends, technologies for research, innovation and product
development and contribution to society.
PEO-4: To have life-long learning for up-skilling and re-skilling for
successful professional career as engineer, scientist, entrepreneur and
bureaucrat for betterment of society.

Faculty Name: Dr. Sarang Sadawarte

02/25/2025 12
Unit Number 1
 End Semester Question Paper Template
Printed page: …. Subject Code:
Roll No:
NOIDA INSTITUTE OF ENGINEERING AND TECHNOLOGY ,GREATER NOIDA
(An Autonomous Institute Affiliated to AKTU, Lucknow)
B.Tech/B.Voc./MBA/MCA/M.Tech (Integrated)
(SEM: ….. THEORY EXAMINATION (2020-2021)
Subject ………..
Time: 3 Hours Max.
Marks:100
General Instructions:
• All questions are compulsory. Answers should be brief and to the point.
• This Question paper consists of …………pages & …8………questions.
• It comprises of three Sections, A, B, and C. You are to attempt all the sections.
• Section A -Question No- 1 is objective type questions carrying 1 mark each, Question No- 2 is very
short
answer type carrying 2 mark each. You are expected to answer them as directed.
• Section B - Question No-3 is Long answer type -I questions with external choice carrying 6 marks
each.
You need to attempt any five out of seven questions given.
•Section C - Question No. 4-8 are Long answer type –II (within unit choice) questions carrying 10
marks
each. You need to attempt any one part a or b.
• Students are instructed to cross the blank sheets before handing over the answer sheet to the
invigilator.
•No sheet should be left blank. Any written material after a blank sheet will not be evaluated/checked.

Dr. Lokesh Chaudhary Engg.

02/25/2025 13
Mathematics IV UNIT 3 BAS0402
 End Semester Question Paper Template

SECTION – A CO
1. Attempt all parts- [10×1=10]

1-a. Question- (1)

1-b. Question- (1)

1-c. Question- (1)
1-d. Question- (1)
1-e. Question- (1)
1-f. Question- (1)
1-g. Question- (1)
1-h. Question- (1)
1-i. Question- (1)
1-j. Question- (1)

Dr. Lokesh Chaudhary Engg.

02/25/2025 14
Mathematics IV UNIT 3 BAS0402
 End Semester Question Paper Template

Dr. Lokesh Chaudhary Engg.

02/25/2025 15
Mathematics IV UNIT 3 BAS0402
 End Semester Question Paper Template

Dr. Lokesh Chaudhary Engg.

02/25/2025 16
Mathematics IV UNIT 3 BAS0402
 End Semester Question Paper Template

Dr. Lokesh Chaudhary Engg.

02/25/2025 17
Mathematics IV UNIT 3 BAS0402
 Result Analysis

Name of Faculty Dr. Sarang

Sadawarte
Branch DS/CYS
No. of Students 212/66
No. of Passed students Awaited
Result Percentage Awaited

Faculty Name: Dr. Sarang Sadawarte

02/25/2025 18
Unit Number 1
 Prerequisite (CO1)

 Knowledge of Maths 1 B.Tech.

 Knowledge of Maths 2 B.Tech.

Faculty Name: Dr. Sarang Sadawarte

02/25/2025 19
Unit Number 1
 Brief Introduction about the subject with videos

 Optimization techniques means finding the action that optimizes

(that is, maximizes or minimizes) the value of an objective
function. For example, in a price-output decision-making problem,
we may be interested in determining the output level that maximizes
profits.
 Numerical techniques, such as the finite element method, are used
to discretise these mathematical equations that are usually
represented by partial differential equations representing the
governing physics taking place, and the behaviour of the materials
that make up the electronic or photonic device.

Faculty Name: Dr. Sarang Sadawarte

02/25/2025 20
Unit Number 1
 Unit Content (CO1)

• Introduction
• Mathematical formulation of LP Models.
• Graphical Method.
• Description of simplex method.
• Big-M method.
• Two phase method.
• Alternative optimum solutions.
• Unbounded solutions.
• Degeneracy.
• Duality in LPP.

Faculty Name: Dr. Sarang Sadawarte

02/25/2025 21
Unit Number 1
 Unit Objective(CO 1)
• The objective of this unit is to familiarize the engineers with concept of
Linear Programming Problem (LPP), It aims to show case the students
with standard concepts and tools from B. Tech to deal with advanced
level of optimization techniques and applications that would be essential
for their disciplines.

Faculty Name: Dr. Sarang Sadawarte

02/25/2025 22
Unit Number 1
 Linear programming Problems(LPP) (CO1)

 Definition: Linear programming is considered as an

optimization technique which is used to find the optimum resource
utilization. Or to Find optimal value of objective function i.e.
maximum or minimum
 The term “linear programming” consists of two words such as linear
and programming. The word “linear” defines the relationship
between multiple variables with degree one. The word
“programming” defines the process of selecting the best solution
from various alternatives.
 A model, which is used for optimum allocation of scarce or limited
resources to competing products or activities under such
assumptions as certainty, linearity, fixed technology, and constant
profit per unit, is linear programming.

Faculty Name: Dr. Sarang Sadawarte

02/25/2025 23
Unit Number 1
 Linear programming Problems(LPP) (CO1)

 Basic Definition:
 Slack Variable: In linear programming , a slack variable is referred
to as an additional variable that has been introduced to the
optimization problem to turn a inequality constraint into an equality
constraint. ... As a result a slack variable is always positive since this
is a requirement for variables in the simplex method.
 Surplus Variable: In an optimization problem, a surplus variable or
negative slack variable is a variable that is subtracted to an
inequality constraint to transform it into an equality. Introducing a
surplus variable replaces an inequality constraint with an equality :
constraint and a non-negativity constraint on the surplus variable.
 Degeneracy: Degeneracy in a linear programming problem is said to
occur when a basic feasible solution contains a smaller number of
non-zero variables
Faculty Name: Dr. Sarang Sadawarte
02/25/2025 24
Unit Number 1
 Linear programming Problems(LPP) (CO1)

than the number of independent constraints when values of some basic

variables are zero and the Replacement ratio is same.
 Unbounded: An unbounded solution of a linear programming
problem is a situation where objective function is infinite. A linear
programming problem is said to have unbounded solution if its
solution can be made infinitely large without violating any of its
constraints in the problem.
 Duality: In linear programming, duality implies that each linear
programming problem can be analyzed in two different ways but
would have equivalent solutions. Any LP problem (either
maximization and minimization) can be stated in another equivalent
form based on the same data.
 Optimal solution: The solution which gives the maximum or the
minimum objective function value is the Optimal ...
Faculty Name: Dr. Sarang Sadawarte
02/25/2025 25
Unit Number 1
 Linear programming Problems(LPP) (CO1)

 Feasible solution: A set of values of the variables, which satisfy all

the constraints and all the non-negative restrictions of the variables,
is known as the feasible solution (F.S.) to the L.P.P.
 Feasible Region: A feasible region is an area defined as a set of
coordinates that satisfy a system of inequalities. This region satisfies
all the restrictions imposed by a linear programming scenario.
 LPP Standard Form: The Simplex Method, which is the procedure
we will use for solving linear programs, is easiest to explain for
linear programs that are in a fixed format we will call the standard
form. A linear program in standard form looks like:

Faculty Name: Dr. Sarang Sadawarte

02/25/2025 26
Unit Number 1
 Linear programming Problems(LPP) (CO1)

Example:
max z = 6x1 + 4x2

s.t. 2x1 + 3x2 ≤ 120

2x1 + x2 ≤ 6,

x 1 x2 ≥ 0
 LPP Canonical form: of standard LPP is a set of equations consisting
of the 'objective function' and all the 'equality constraints' (standard
form of LPP) expressed in canonical form. Understanding the
canonical form of LPP is necessary for studying simplex method,
the most popular method of solving LPP.

Faculty Name: Dr. Sarang Sadawarte

02/25/2025 27
Unit Number 1
 Linear programming Problems(LPP) (CO1)

 Process to formulate a Linear Programming problem

i) Identify the decision variables
ii) Write the objective function
iii) Mention the constraints
iv) Explicitly state the non-negativity restriction

Faculty Name: Dr. Sarang Sadawarte

02/25/2025 28
Unit Number 1
 Linear programming Problems(LPP) (CO1)

 ESSENTIALS OF LINEAR PROGRAMMING MODEL:

For a given problem situation, there are certain essential conditions that
need to be solved by using linear programming.
i. Limited resources :limited number of labor. material equipment and
finance.
ii. Objective: Refers to the aim to optimize (maximize the profits or
minimize the costs).
iii. Linearity : Increase in labor input will have a proportionate increase
in output.
iv. Homogeneity: The products, workers' efficiency, and machines are
assumed to be identical. Divisibility :it is assumed that resources and
products can be divided into fractions. (in case the fractions are not
possible, like production of one-third of a computer, a modification
of linear programming called integer programming can be used).
Faculty Name: Dr. Sarang Sadawarte
02/25/2025 29
Unit Number 1
 Linear programming Problems(LPP) (CO1)

 Properties of linear programming model:

1. Relationship among decision variables must be linear in
nature.
2. A model must have an objective function.
3. Resource constraints are essential.
4. A model must have a non-negativity constraint.

Faculty Name: Dr. Sarang Sadawarte

02/25/2025 30
Unit Number 1
 Linear programming Problems(LPP) (CO1)

 Formulation of linear programming: Formulation of linear

programming is the representation of problem situation in a
mathematical form. It involves well defined decision variables, with an
objective function and set of constraints.
1. Decision Variables: The decision variables are the variables that will
decide our output. Like the profit function is affected by both sales and
price, now which one of these two is changeable, will be our decision
variable.
2. Objective function: Linear function of the objective, either to
Maximize or minimize, like Maximize Profit, sales, production etc.
and Minimize Cost, Loss, energy, consumption, wastage etc.

Faculty Name: Dr. Sarang Sadawarte

02/25/2025 31
Unit Number 1
 Linear programming Problems(LPP) (CO1)

3. Constraints: The constraints are the restrictions or limitations on

the decision variables. Any kind of limitation or scarcity explained
through a function like Limitations of raw materials, time,
funds, equipment's etc.
4. Non-negativity constraint: For all linear programming problems,
the decision variables should always take non-negative values i.e.
decision variables should be greater than or equal to 0.Negative
values of physical quantities are impossible, like producing
negative number of chairs, tables, etc.,

Faculty Name: Dr. Sarang Sadawarte

02/25/2025 32
Unit Number 1
 Linear programming Problems(LPP) (CO1)

 General linear programming model: A general representation of

LP model is given as follows:
Maximize or Minimize,
Z = c1 x1 + c2 x2 ………………cn xn
Subject to constraints,
a11 x1 + a12 x2 + …………a1n xn ≤ or = or ≥ b1 ……………(i)
a21 x1 + a22 x2 +…………a2n xn ≤ or = or ≥ b2 …………… (ii)
....
....
....
am1 x1 + am2 x2 +………………amn xn ≤ or = ≥ bm …………(iii)
Non-negativity constraint, xi ≥ o (where i = 1,2,3 …..n)

Faculty Name: Dr. Sarang Sadawarte

02/25/2025 33
Unit Number 1
 Problems Based on LPP (CO1)

Example1: Consider a chocolate manufacturing company that produces

only two types of chocolate A and B. Both the chocolates require Milk
and Choco only. To manufacture each unit of A and B, the following
quantities are required:
i. Each unit of A requires 1 unit of Milk and 3 units of Choco
ii. Each unit of B requires 1 unit of Milk and 2 units of Choco
iii. The company kitchen has a total of 5 units of Milk and 12 units of
Choco. On each sale, the company makes a profit of Rs 6 per unit A
sold and Rs 5 per unit B sold.
Now, the company wishes to maximize its profit. How many units of A
and B should it produce respectively?

Faculty Name: Dr. Sarang Sadawarte

02/25/2025 34
Unit Number 1
 Problems Based on LPP (CO1)

Solution: firstly represent the problem in a tabular form as below:

Type MILK CHOCO PROFIT PER UNIT
A 1 3 Rs. 6
B 1 2 Rs. 5
Total 5 12

Let the total number of units produced of

and Let the total number of units produced of
Now, the total profit is represented by Z
The total profit the company makes is given by the total number of units
of A and B produced multiplied by its per-unit profit of Rs 6 and Rs 5
respectively. Max Z = 6x+5y
(which means we have to maximize Z)

Faculty Name: Dr. Sarang Sadawarte

02/25/2025 35
Unit Number 1
 Problems Based on LPP (CO1)

From the table, each unit of A and B requires 1 unit of Milk. The total
amount of Milk available is 5 units.
To represent this mathematically, x+y ≤ 5
Also, each unit of A and B requires 3 units & 2 units of Choco
respectively. The total amount of Choco available is 12 units.
To represent this mathematically, 3x+2y ≤ 12
Also, the values for units of A can only be integers. So we have two
more constraints, x ≥ 0 & y ≥ 0
For the company to make maximum profit, the above inequalities have to
be satisfied.
This is called formulating a real-world problem into a mathematical
model.

Faculty Name: Dr. Sarang Sadawarte

02/25/2025 36
Unit Number 1
 Problems Based on LPP (CO1)

From the table, each unit of A and B requires 1 unit of Milk. The total
amount of Milk available is 5 units.
To represent this mathematically, x+y ≤ 5
Also, each unit of A and B requires 3 units & 2 units of Choco
respectively. The total amount of Choco available is 12 units.
To represent this mathematically, 3x+2y ≤ 12
Also, the values for units of A can only be integers. So we have two
more constraints, x ≥ 0 & y ≥ 0
For the company to make maximum profit, the above inequalities have to
be satisfied.
This is called formulating a real-world problem into a mathematical
model.

Faculty Name: Dr. Sarang Sadawarte

02/25/2025 37
Unit Number 1
 Problems Based on LPP (CO1)

Example2:A company manufactures two types of boxes, corrugated and

ordinary cartons. The boxes undergo two major processes: cutting and
pinning operations. The profits per unit are Rs. 6 and Rs. 4 respectively.
Each corrugated box requires 2 minutes for cutting and 3 minutes for
pinning operation, whereas each carton box requires 2 minutes for cutting
and 1 minute for pinning. The available operating time is 120 minutes and
60 minutes for cutting and pinning machines. The manager has to
determine the optimum quantities to be manufacture the two boxes to
maximize the profits.

Faculty Name: Dr. Sarang Sadawarte

02/25/2025 38
Unit Number 1
 Problems Based on LPP (CO1)

Solution:
Step 1. Decision variables: completely describe the decisions to be
made (in this case, by Manager). Manager must decide how many
corrugated and ordinary cartons should be manufactured each week.
With this in mind, he has to define:
Let be the number of corrugated boxes to be manufactured. be the
number of carton boxes to be manufactured.
Step 2. Objective function is the function of the decision variables
that the decision maker wants to maximize (revenue or profit) or
minimize (costs). Manager can concentrate on maximizing the total
weekly profit (Z).
Here

Faculty Name: Dr. Sarang Sadawarte

02/25/2025 39
Unit Number 1
 Problems Based on LPP (CO1)

Hence Manager’s objective function is: Maximize z = 6x1 + 4x2

Step 3. Constraints show the restrictions on the values of the decision
variables. Without constraints manager could make a large profit by
choosing decision variables to be very large. Here there are two
constraints:
• Available machine-hours for each machine
• Time consumed by each product
• All these characteristics explored above give the following Linear
Programming (LP) problem.
max z = 6x1 + 4x2 (The Objective function)
s.t. 2x1 + 3x2 ≤ 120 (cutting time constraint)
2x1 + x2 ≤ 60, (pinning constraint)
x 1 x2 ≥ 0 (Sign restrictions)

Faculty Name: Dr. Sarang Sadawarte

02/25/2025 40
Unit Number 1
 Daily Quiz (CO1)
Q1. A paper mill produces two grades of paper namely X and Y .
Owing to raw material restrictions, it cannot produce more than 400 tons
of grade X and 300 tons of grade Y in a week. There are
160 production hours in a week. It requires 0.2 and 0.4 hours to produce
a ton of products X and Y, respectively with corresponding profits of
200 rs. And 500 rs. Per ton. Formulate the above as an LPP to maximize
the profit. ​
Q2. A manufacturer produces two types of models A and B.
Each model of the type A requires 4 hrs of grinding and 2 hrs of
polishing; whereas each model of the type B requires 2 hrs of grinding
and 5 hrs of polishing. The manufacturer has 2 grinders and 3 polishers.
Each grinder works 40 hrs in a week and each polisher works 60 hours in
a week. Profit on A model is 3 rs. and on B model is rs. 4. Whatever
is produced in a week is sold in the market. How should the
manufacturer allocate his production capacity to the two types of models
so that he may make the maximum profit in a week. ​
Faculty Name: Dr. Sarang Sadawarte
02/25/2025 41
Unit Number 1
 Recap (CO1)

 We have discussed Basic Definition of the LPP.

 We have discussed about Formulation of the LPP.

Faculty Name: Dr. Sarang Sadawarte

02/25/2025 42
Unit Number 1
 Topic Objective (CO1)

 We use a graphical method of linear programming for solving the

problems by finding out the maximum or lower most point of the
intersection on a graph between the objective function line and the
feasible region.

Faculty Name: Dr. Sarang Sadawarte

02/25/2025 43
Unit Number 1
 Methods for solving LPP (CO1)

A value of (x1,x2) is in the feasible region if it satisfies all the

constraints and sign restrictions. This type of linear programming
can be solve by two methods
1) Graphical method
2) Simplex algorithm method

Faculty Name: Dr. Sarang Sadawarte

02/25/2025 44
Unit Number 1
 Graphical Method for solving LPP (CO1)

Step 1: Convert the inequality constraint as equations and find co-

ordinates of the line.
Step 2: Plot the lines on the graph.
Note:
a. If the constraint is ≥ type, then the solution zone lies away from the
center.
b. If the constraint is ≤ type, then solution zone is towards the center.
Step 3: Obtain the feasible zone.
Step 4: Find the co-ordinates of the objectives function (profit line)
and plot it on the graph representing it with a dotted line.

Faculty Name: Dr. Sarang Sadawarte

02/25/2025 45
Unit Number 1
 Graphical Method for solving LPP (CO1)
Step 5: Locate the solution point.
(Note: If the given problem is maximization, Zmax then locate the
solution point at the far most point of the feasible zone from the
origin and if minimization, Zmin then locate the solution at the
shortest point of the solution zone from the origin).
Step 6: Solution type
i. If the solution point is a single point on the line, take the
corresponding values of and .
ii. If the solution point lies at the intersection of two equations, then
solve for and using the two equations.
iii. If the solution appears as a small line, then a multiple solution
exists.
iv. If the solution has no confined boundary, the solution is said to
be an unbound solution.
•.
Faculty Name: Dr. Sarang Sadawarte
• 02/25/2025
c Unit Number 1
46
 Problems Based on LPP (CO1)

iii) Testing these corner points on P = 7X + 5Y gives Because the point

(30,40) produces the highest profit we conclude that producing 30 tables
and 40 chairs will yield a maximum profit of Rs. 410.
Corner Point profit

(0,0) 0

(50,0) 350

(30,40) 410

(0,80) 400

The maximum value of

Z occurs at
(30,40).Hence the optimal
solution is x1 = 30, x2 = 40
and Zmax = 410

Faculty Name: Dr. Sarang Sadawarte

02/25/2025 47
Unit Number 1
 Problems Based on LPP (CO1)

Example2 : Solve the following LPP by graphical method

Minimize z = 5x1+4x2
Subject to constraints 4x1+ x2 ≥ 40 ;
2x1+3x2 ≥ 90
and x1, x2 > 0
Solution: Since both the decision variables x1 and x2 are non-negative,
the solution lies in the first quadrant of the plane.
Consider the equations 4x1+ x2 = 40 and 2 x1+3 x2 = 90
4x1+x2 = 40 is a line passing through the points (0,40) and (10,0).
Any point lying on or above the line 4x1+x2= 40 satisfies the constraint
4x1+ x2 ≥ 40.

Faculty Name: Dr. Sarang Sadawarte

02/25/2025 48
Unit Number 1
 Problems Based on LPP (CO1)

2x1+3x2 = 90 is a line passing through the points (0,30) and (45,0).

Any point lying on or above the line 2 x1+3x2= 90 satisfies the constraint
2x1+3x2 ≥ 90.
Draw the graph using the given constraints.

Faculty Name: Dr. Sarang Sadawarte

02/25/2025 49
Unit Number 1
 Problems Based on LPP (CO1)

The feasible region is ABC (since the problem is of minimization type we

are moving towards the origin.
Corner Points
A(45,0) 225
B(3,28) 127
C(0,40) 160

The minimum value of Z occurs at B(3,28) Hence the optimal solution is

and .

Faculty Name: Dr. Sarang Sadawarte

02/25/2025 50
Unit Number 1
 Problems Based on LPP (CO1)

Example3 : Solve the following LPP by graphical method

Maximize z = 6x1 + 4x2

Subject to constraints 2x1 + 3x2 ≤ 120

2x1 + x2 ≤ 6,
x 1 x2 ≥ 0
Solution: Objective function line (Profit Line) Equate
the objective function for any specific profit value Z,
Consider a Z-value of 60, i.e.,
6x1 + 4x2 = 60
If x1 =0, x2 = 15 and x2 = 0 then x1 = 10
Therefore, the co-ordinates for the objective function line
are (0,15), (10,0) as indicated objective function line. The
objective function line contains all possible combinations
of02/25/2025 Faculty Name: Dr. Sarang Sadawarte
51
Unit Number 1
 Problems Based on LPP (CO1)

values of x1 and x2 .
Therefore, we conclude that to maximize profit, 15 numbers of
corrugated boxes and 30 numbers of carton boxes should be produced to
get a maximum profit. Substituting x1 = 15 and x2 = 30 in objective
function, we get Zmax = 6x1 + 4x2 = 6(15) + 4(30)
Maximum profit : Rs. 210.00

Faculty Name: Dr. Sarang Sadawarte

02/25/2025 52
Unit Number 1
 Daily Quiz (CO1)

Q1) Find the maximum value of Z = 20x1 + 10x2 by using graphical

method:
Subject to constraints
x1 + 2x2 ≤ 40
3x1+ x2 ≤ 30
4x1+ 3x2 ≤ 60
x1, x2 ≥ 0

Faculty Name: Dr. Sarang Sadawarte

02/25/2025 53
Unit Number 1
 Recap (CO1)

 We have discussed about the LPP

 We have discussed about the graphical method of LPP
 We have discussed slack or surplus variables.

Faculty Name: Dr. Sarang Sadawarte

02/25/2025 54
Unit Number 1
 Topic Objective (CO1)

 Simplex method, standard technique in linear programming for

solving an optimization problem, typically one involving a function
and several constraints expressed as inequalities. The inequalities
define a polygonal region, and the solution is typically at one of the
vertices.

Faculty Name: Dr. Sarang Sadawarte

02/25/2025 55
Unit Number 1
 Simplex Method(CO1)

 In practice, most problems contain more than two variables and are
consequently too large to be tackled by conventional means.
Therefore, an algebraic technique is used to solve large problems
using Simplex Method. This method is carried out through iterative
process systematically step by step, and finally the maximum or
minimum values of the objective function are attained.

 The simplex method solves the linear programming problem in

iterations to improve the value of the objective function. The simplex
approach not only yields the optimal solution but also other valuable
information to perform economic and 'what if' analysis.

Faculty Name: Dr. Sarang Sadawarte

02/25/2025 56
Unit Number 1
 Simplex Method(CO1)

 Additional variables used in solving lpp: Three types of additional

variables are used in simplex method such as,
(a) Slack variables (S1, S2, S3..…Sn): Slack variables refer to the
amount of unused resources like raw materials, labour and money.
(b) Surplus variables (-S1, -S2, -S3..…-Sn): Surplus variable is the
amount of resources by which the left hand side of the equation
exceeds the minimum limit.
(c) Artificial Variables (a1, a2, a3.. …an): Artificial variables
are temporary slack variables which are used for purposes
of calculation, and are removed later.
 The above variables are used to convert the inequalities
into equality equations, as given in the Given Table
below.

Faculty Name: Dr. Sarang Sadawarte

02/25/2025 57
Unit Number 1
 Simplex Method(CO1)

Tyes of Additional variables

Faculty Name: Dr. Sarang Sadawarte

02/25/2025 58
Unit Number 1
 Simplex Method(CO1)

 Procedure of simplex Method:

Step 1: Formulate the LP problem.
Step 2: Introduce slack /auxiliary variables.
a. if constraint type is ≤ introduce + S
b. if constraint type is ≥introduce – S + a and if constraint type is
= introduce a
Step 3: Find the initial basic solution.
Step 4: Establish a simplex table and enter all variable coefficients.
If the objective function is maximization, enter the opposite sign
co-efficient and if minimization, enter without changing the sign.
Step 5:Take the most negative coefficient in the objective function,
Zj to identify the key column (the corresponding variable is the
entering variable of the next iteration table).

Faculty Name: Dr. Sarang Sadawarte

02/25/2025 59
Unit Number 1
 Simplex Method(CO1)

Step 6: Find the ratio between the solution value and the coefficient of
the key column. Enter the values in the minimum ratio column.
Step 7: Take the minimum positive value available in the minimum ratio
column to identify the key row. (The corresponding variable is the
leaving variable of the table).
Step 8: The intersection element of the key column and key row is the
pivotal element.
Step 9: Construct the next iteration table by eliminating the leavin
variable and introducing the entering variable.
Step 10: Convert the pivotal element as 1 in the next iteration table and
compute the other elements in that row accordingly. This is the pivotal
equation row (not key row).

Faculty Name: Dr. Sarang Sadawarte

02/25/2025 60
Unit Number 1
 Simplex Method(CO1)

Step 11: Other elements in the key column must be made zero. For
simplicity, form the equations as follows: Change the sign of the key
column element, multiply with pivotal equation element and add the
corresponding variable.
Step 12: Check the values of objective function. If there are negative
values, the solution is not an optimal one; go to step 5. Else, if all the
values are positive, optimality is reached. Non-negativity for objective
function value is not considered. Write down the values of x1, x2,
……..xi and calculate the objective function for maximization or
minimization.
Note:
i. If there are no x1 ,x2 variables in the final iteration table, the
values of x1 and x2 are zero.
ii. Neglect the sign for objective function value in the final iteration table.
Faculty Name: Dr. Sarang Sadawarte
02/25/2025 61
Unit Number 1
 Problem based on Simplex Method(CO1)

Example: Previous the packaging product mix problem is solved using

simplex method.
Maximize Z = 6x1 + 4x2
Subject to constraints,
2x1+3x2≤120 (Cutting machine) .....................(i)
2x1+ x2≤ 60 (Pinning machine) ......................(ii)
where x1, x2 ≥ 0
Considering the constraint for cutting machine,
2x1+ 3x2 ≤ 120
To convert this inequality constraint into an equation, introduce a slack
variable, S3 which represents the unused resources. Introducing the
slack variable, we have the equation
2x1+ 3x2 + S3 = 120
Similarly for pinning machine, the equation is
2x1+ x2 + S4 = 60
Faculty Name: Dr. Sarang Sadawarte
02/25/2025 62
Unit Number 1
 Problem based on Simplex Method(CO1)

If variables x1and x2 are equated to zero,

i.e., x1 = 0 and x2 = 0,
then S3 = 120 and S4 = 60
This is the basic solution of the system, and variables S3 and S4 are known
as Basic Variables, SB while x1 and x2 known as Non-Basic Variables.
Rewriting the constraints with slack variables gives us,
Z max = 6x1 + 4x2 + 0S3 + 0S4
Subject to constraints,
2x1 + 3x2 + S3 = 120 ....................(i)
2x1 + x2 + S4 = 60 ....................(ii)
where x1, x2 ≥ 0
Which can shown in following simplex table form

Faculty Name: Dr. Sarang Sadawarte

02/25/2025 63
Unit Number 1
 Problem based on Simplex Method(CO1)

Iteration Basic Solution Minimum Equation

Number Variable Value Ratio
0 120 2 3 1 0 60
60 2 1 0 1 30
0 -6 -4 0 0

If the objective of the given problem is a maximization one, enter the co-
efficient of the objective function Zj with opposite sign as shown in
table. Take the most negative coefficient of the objective function and
that is the key column Kc. In this case, it is -6.

Faculty Name: Dr. Sarang Sadawarte

02/25/2025 64
Unit Number 1
 Problem based on Simplex Method(CO1)

Find the ratio between the solution value and the key column
coefficient and enter it in the minimum ratio column.
The intersecting coefficients of the key column and key row are called
the pivotal element i.e. 2.
The variable corresponding to the key column is the entering element of
the next iteration table and the corresponding variable of the key row is
the leaving element of the next iteration table (In other words, x1 replaces
S4 in the next iteration table. Given indicates the key column, key row and
the pivotal element.)

Faculty Name: Dr. Sarang Sadawarte

02/25/2025 65
Unit Number 1
 Problem based on Simplex Method(CO1)

In the next iteration, enter the basic variables by eliminating the

leaving variable (i.e., key row) and introducing the entering variable
(i.e., key column).
Make the pivotal element as 1 and enter the values of other elements in
that row accordingly. In this case, convert the pivotal element value 2 as 1
in the next iteration table.
For this, divide the pivotal element by 2. Similarly divide the other
elements in that row by 2. The equation is S4 /2.
This row is called as Pivotal Equation Row Pe.
The other co-efficients of the key column in iteration Table 1 must be
made as zero in the iteration Table 2.
For this, a solver, Q, is formed for easy calculation.

Faculty Name: Dr. Sarang Sadawarte

02/25/2025 66
Unit Number 1
 Problem based on Simplex Method(CO1)

Solver, Q = SB + (–Kc * Pe)

The equations for the variables in the iteration number 1 of table 8 are,
For S3 Q = SB + (– Kc * Pe)
= S3 + (–2x Pe)
= S3 – 2Pe …………………………(i) For – Z
, Q = SB + (– Kc * Pe)
= – Z + ((– 6) * Pe)
= – Z + 6Pe
…………………………(ii)
Using the equations (i) and (ii) the values of S3 and –Z for the values of
Table 1 are found as shown in Table 5.4

Faculty Name: Dr. Sarang Sadawarte

02/25/2025 67
Unit Number 1
 Problem based on Simplex Method(CO1)

Using these equations, enter the values of basic variables SB and

objective function Z. If all the values in the objective function are non-
negative, the solution is optimal.
Here, we have one negative value – 1. Repeat the steps to find the key
row and pivotal equation values for the iteration 2 and check for
optimality.
We get New Table as below: Faculty Name: Dr. Sarang Sadawarte
02/25/2025 68
Unit Number 1
 Problem based on Simplex Method(CO1)

The solution is, x1 = 15 corrugated boxes are to be produced and x 2 = 30

carton boxes are to be produced to yield a Profit, Zmax = Rs. 210.00

Faculty Name: Dr. Sarang Sadawarte

02/25/2025 69
Unit Number 1
 Daily Quiz(CO1)

Q. 1. Using Simplex method, to solve the LPP

Maximize Z= 3x1+2 x2+ 5x3,
Subject to x1+ x2+ x3≤9,
2x1+ 3x2+ 5x3≤30,
2x1-x2-x3≤8,
x1, x2, x3≥0

Faculty Name: Dr. Sarang Sadawarte

02/25/2025 70
Unit Number 1
 Weekly Assignment(CO1)

Q. 1 Explain (i) No feasible solution (ii) Unbounded solution

Give one example in each case of LPP.
Q.2 Find the maximum value of Z = 6x1 + 4x2 by using graphical
method: Subject to constraints -2x1 + x2 ≤ 2
x1 - x 2 ≤ 2
3x1+ 2x2 ≤ 9
x1, x2 ≥ 0
Q 3. A manufacturer makes two products A and B using two machines P
and Q. Product A requires 2 hours on machine P and 6 hours on
machine Q. Product B requires 5 hours on machine P and no time on
machine Q. There are 16 hours of time per day available on machine
P and 30 hours on Q. Profit margin from A and B is Rs. 2 and Rs. 10
per unit respectively. What should be the daily production mix to
optimize profit? Solve by using Simplex method.
Faculty Name: Dr. Sarang Sadawarte
02/25/2025 71
Unit Number 1
 Recap (CO1)

 We have discussed about the LPP

 We have discussed about the graphical method of LPP
 We have discussed slack or surplus variables.
 We have discussed Simplex method of solving LP problems.

Faculty Name: Dr. Sarang Sadawarte

02/25/2025 72
Unit Number 1
 Topic Objective (CO1)

 In linear programming, duality implies that each linear programming

problem can be analyzed in two different ways but would have
equivalent solutions. Any LP problem (either maximization and
minimization) can be stated in another equivalent form based on the
same data.

Faculty Name: Dr. Sarang Sadawarte

02/25/2025 73
Unit Number 1
 Duality Theory(CO1)

 Every LP problem (called the ‘Primal’) has associated with another

problem called the ‘Dual’.
 The ‘Dual’ problem is an LP defined directly and systematically from
the original (or Primal) LP model.
 The optimal solution of one problem yields the optimal solution
to the other.
 Duality ease the calculations for the problems, whose number of
variables is large.

Faculty Name: Dr. Sarang Sadawarte

02/25/2025 74
Unit Number 1
 Duality Theory(CO1)

 Rules for converting Primal to Dual:

If the Primal is to maximize, the dual is to minimize.
If the Primal is to minimize, the dual is to maximize.
For every constraint in the primal, there is a dual variable.
For every variable in the primal, there is a constraint in the dual.

Faculty Name: Dr. Sarang Sadawarte

02/25/2025 75
Unit Number 1
 Duality Problem(CO1)

Primal LP :Max Associated Dual LP :

z = c1x1 + c2x2 + ... + cnxn Min. z = b1y1 + b2y2 + ... + bmym
subject to: subject to:
a11x1 + a12x2 + ... + a1nxn ≤ b1 a11y1 + a21y2 + ... + aAym ≥ c1
a21x1 + a22x2 + ... + a2nxn ≤ b2 a12y1 + a22y2 + ... + aBym ≥ c2
: :
aAx1 + aBx2 + ... + amnxn ≤ b a1ny1 + a2ny2 + ... + amnym ≥ cn
x1 ≥ 0, x2 ≥ 0,…….xj ≥ 0,……., y1 ≥ 0, y2 ≥ 0,…….yj ≥ 0,……., ym ≥ 0.
xn ≥ 0.

Faculty Name: Dr. Sarang Sadawarte

02/25/2025 76
Unit Number 1
 Duality Problem(CO1)

Primal
Min.. Z = 10x1+15x2
Subject to constraints:
5x1+ 7x2 > 80
6x1 + 11x2 > 100
x1, x2 > 0
Solution:
Dual
Max.. Z’ = 80y1+100y2
Subject to constraints:
5y1 +6y2 < 10
7y1+ 11y2 < 15
y02/25/2025
1,y2 > 0
Faculty Name: Dr. Sarang Sadawarte
Unit Number 1
77
 Daily Quiz(CO1)

Q1. use the duality to solve the following LPP:

Min.. Z = 12x1+25x2
Subject to constraints:
4x1+ 7x2 > 80
6x1 + 10x2 > 100
x1, x2 > 0

Faculty Name: Dr. Sarang Sadawarte

02/25/2025 78
Unit Number 1
 Recap (CO1)

 We have discussed about the LPP

 We have discussed about the graphical method of LPP
 We have discussed slack or surplus variables.
 We have discussed Simplex method of solving LP problems.
 We have discussed Duality.

Faculty Name: Dr. Sarang Sadawarte

02/25/2025 79
Unit Number 1
 Topic Objective (CO1)

 These variables are fictitious and cannot have any physical meaning.
The artificial variable technique is a device to get the starting basic
feasible solution, so that simplex procedure may be adopted as usual
until the optimal solution is obtained. To solve such LPP there are two
methods.

Faculty Name: Dr. Sarang Sadawarte

02/25/2025 80
Unit Number 1
 Artificial Variables (CO1)

Artificial Variables Technique :

 LPP in which constraints may also have >, and = signs after ensuring that
all bi ≥ 0 are considered in this section. In such cases basis matrix cannot
be obtained as an identify matrix in the stAing simplex table, therefore we
introduce a new type of variable called the artificial variable.
 These variables are fictitious and cannot have any physical meaning. The
artificial variable technique is a device to get the starting basic feasible
solution, so that simplex procedure may be adopted as usual until the
optimal solution is obtained.
 To solve such LPP there are two methods.
(i) The Big M Method or Method of Penalties.
(ii) The Two-phase Simplex Method.

Faculty Name: Dr. Sarang Sadawarte

02/25/2025 81
Unit Number 1
 The Big M Method(CO1)

The Big M Method :The following steps are involved in solving an

LPP using the Big M method.
Step 1 Express the problem in the standard form.
Step 2 Add non-negative artificial variables to the left side of each of
the equations corresponding to constraints of the type >, or = However,
addition of these artificial variable causes violation of the
corresponding constraints. Therefore, we would like to get rid of these
variables and would not allow them to appear in the final solution. This
is achieved by assigning a very large penalty (-M for maximization and
+ M for minimization) in the objective function.

Faculty Name: Dr. Sarang Sadawarte

02/25/2025 82
Unit Number 1
 The Big M Method(CO1)

Step 3 Solve the modified LPP by simplex method, until anyone of the
three cases may arise.
1. If no artificial variable appears in the basis and the optimality
conditions are satisfied, then the current solution is an optimal basic
feasible solution.
2. If at least one artificial variable in the basis at zero level and the
optimality condition is satisfied then the current solution is an optimal
basic feasible solution (though degenerated solution).
3. If at least one artificial variable appears in the basis at positive level
and the optimality condition is satisfied, then the original
problem has no feasible solution. The solution satisfies the constraints
but does not optimise the objective function, since it contains a very
large penalty M and is called pseudo optimal solution.

Faculty Name: Dr. Sarang Sadawarte

02/25/2025 83
Unit Number 1
 The Big M Method(CO1)

Note: While applying simplex method, whenever an artificial variable

happens to leave the basis, we drop that artificial variable and omit all
the entries corresponding to its column from the simplex table.
Example 1 Use penalty method to Maximize
Subject to

Solution: Converting inequalities to equalities

By introducing surplus variables, slack variables and artificial
variables, the standard form of LPP becomes
Maximize

Faculty Name: Dr. Sarang Sadawarte

02/25/2025 84
Unit Number 1
 Problem based on Big M Method(CO1)

Subject to

,
where,
is a slack variable,
is a surplus variable
is an artificial variable.
Initial basic feasible solution
,

Faculty Name: Dr. Sarang Sadawarte

02/25/2025 85
Unit Number 1
 Problem based on Big M Method(CO1)
Iteration 1:

Calculating values for index row ()

=
=
=
=
=

Faculty Name: Dr. Sarang Sadawarte

02/25/2025 86
Unit Number 1
 Problem based on Big M Method(CO1)
As M is a large positive number, the coefficient of M in the row would
decide the incoming basic variable.
As , becomes a basic variable in the next iteration.
Key column column.
Minimum (6/4, 2/3) = 2/3
Key row row Pivot element = 3.
departs and enters.
Note: The iteration just completed, artificial variable A1 was
eliminated from the basis. The new solution is shown in the following
table.
Iteration 2:

Faculty Name: Dr. Sarang Sadawarte

02/25/2025 87
Unit Number 1
 Problem based on Big M Method(CO1)

As M is a large positive number, the coefficient of M in the row would decide the
incoming basic variable.
As , becomes a basic variable in the next iteration.
Key column column.
Minimum (10/3/4/3) = 5/4{ because -1/3 is neg so we can not calculate the min
ratio}
Key row row Pivot element = 4/3.
departs and enters.
Iteration 3:
Faculty Name: Dr. Sarang Sadawarte
02/25/2025 88
Unit Number 1
 Problem based on Big M Method(CO1)

1 5 0 0
Basic variable Solution values b(=)
B
0 5/4 0 3/4 1 5/2
3/4 1 1/4 0 3/2
5/4

Result:
The optimal solution is
Max

Faculty Name: Dr. Sarang Sadawarte

02/25/2025 89
Unit Number 1
 TWO PHASE METHOD(CO1)

 Artificial variable can be eliminated from the simplex table as and

when they become zero i.e, non–basic. This process of eliminating
artificial variable is performed in PHASE I of the solution.
 PHASE II is then used for getting optimal solution. Here the
solution of the linear programming problem is completed in two
phases, this method is known as TWO PHASE SIMPLEX
METHOD.
 Hence, the two–phase method deals with removal of artificial
variable in the first phase and work for optimal solution in the
second phase. If at the end of the first stage, there still remains
artificial variable in the basic at a positive value, it means there is no
feasible solution for the problem given. In that case, it is not

Faculty Name: Dr. Sarang Sadawarte

02/25/2025 90
Unit Number 1
 Problem based on Two Phase Method(CO1)

Example: By using two phase method find whether the following

problem has a feasible solution or not?
Maximize Z = 4a + 5b
s.t. 2a + 4b ≤ 8
1a + 3b ≥ 9
and both a and b are ≥ 0.
Simplex version is: Max. Z = 4a + 5b + 0 + 0 – MA
s.t.
2a + 4b + + 0 + 0A = 8
1a + 3b + 0 + 1A = 9 and
a, b, , , A all are ≥ 0

Faculty Name: Dr. Sarang Sadawarte

02/25/2025 91
Unit Number 1
 Problem based on Two Phase Method(CO1)

Phase I
Maximize Z = 0a + 0b + + 0 – 1A s.t.
2a + 4b + + 0 + 0A = 8
1a + 3b + + 1A = 9
and a, b, and A all ≥ 0.
Table: I. a = 0, b = 0, , A = 9 and Z = – Rs 9

Problem Profit Rs. Capacity 0 0 0 0 -1 Replacement

units Ratio
Variable
0 8 2 4 1 0 0 8/4=2
9 1 3 0 1 9/3=3
Net 1 3 0 -1 0
Evaluation

Faculty Name: Dr. Sarang Sadawarte

02/25/2025 92
Unit Number 1
 Problem based on Two Phase Method(CO1)

Table: II. a = 0, b = 2, , A = 3 and Z = – Rs 3

Problem Profit Rs. Capacity 0 0 0 0 -1 Replacement

units Ratio
Variable
0 2 1 0.25 0 0 4
3 0 1 8
Net 0 0
Evaluation

Faculty Name: Dr. Sarang Sadawarte

02/25/2025 93
Unit Number 1
 Problem based on Two Phase Method(CO1)

Table: III. a = 4, b = 0, , A =1 and Z = – Rs 1

Problem Profit Rs. Capacity 0 0 0 0 -1 Replacement

units Ratio
Variable
0 4 2 0.5 0 0
1 1
Net 0
Evaluation
As the artificial variable still remains as the basic variable and has a
positive value, the given problem has no feasible solution.

Faculty Name: Dr. Sarang Sadawarte

02/25/2025 94
Unit Number 1
 Problem based on Two Phase Method(CO1)

If we examine the same by graphical means, we can see that the

problem has no feasible region.

Faculty Name: Dr. Sarang Sadawarte

02/25/2025 95
Unit Number 1
 Daily Quiz(CO1)

Q1.Solve by Big M Method

Maximize Z = 4x + 3y
s.t.
2x + 3y ≤ 6
3x + 1y ≥ 3
Both x and y all ≥ 0.
Q2. Solve by Two phase method:
Maximize Z = 5x + 2y
s.t.
3x + 4y ≤ 3
1x + 3y ≥ 5
Both x and y all ≥ 0.

Faculty Name: Dr. Sarang Sadawarte

02/25/2025 96
Unit Number 1
 Weekly Assignment(CO1)

Q1.Solve by Big M Method

Maximize Z = x + 3y
s.t.
2x + 6y ≤ 8
3x + 4y ≥ 5
Both x and y all ≥ 0.
Q2. Solve by Two phase method:
Maximize Z = 14x + 12y
s.t.
7x + 6y ≤ 13
3x + 5y ≥ 15
Both x and y all ≥ 0.

Faculty Name: Dr. Sarang Sadawarte

02/25/2025 97
Unit Number 1
 Weekly Assignment(CO1)

Q3.Solve by Big M Method

Maximize Z = 10x + 13y
s.t.
2x + y ≤ 8
x + 4y ≥ 7
Both x and y all ≥ 0.
Q4. Solve by Two phase method:
Maximize Z = 9x + 8y
s.t.
x+y≤4
4x + 5y ≥ 5
Both x and y all ≥ 0.

Faculty Name: Dr. Sarang Sadawarte

02/25/2025 98
Unit Number 1
 Weekly Assignment(CO1)

Q5.write a short note on

a. Slack Variable
b. Surplus Variable
c. Degenercy
d. Unbounded

Faculty Name: Dr. Sarang Sadawarte

02/25/2025 99
Unit Number 1
 Faculty video links, youtube & nptel video links and online
courses details

 Suggested Youtube/other Video Links For LPP

1. https://youtu.be/M8POtpPtQZc
2. https://youtu.be/8IRrgDoV8Eo
3. https://youtu.be/YrsbJG8XqU0
4. https://www.youtube.com/watch?v=qKvPmRlDgT4
5. https://www.youtube.com/watch?v=PSOW3_gX2OU
6. https://youtu.be/a2QgdDk4Xjw
7. https://youtu.be/XEA1pOtyrfo
8. https://youtu.be/qxls3cYg8to
9. https://youtu.be/DUFcNysR-w8
10. https://youtu.be/OUduOnhO94k
11. https://youtu.be/_uRKG9tkrew
12. https://youtu.be/7w30ueP5ayI
Faculty Name: Dr. Sarang Sadawarte
13. https://youtu.be/gmDwUCvOJQ8
02/25/2025
Unit Number 1
100
 MCQ(CO1)
1. Non-negativity condition is an important component of LP model
because
a. Variables value should remain under the control of decision maker
b. Value of variables make sense and correspond to real world problems
c. Variables are interrelated in terms of limited resources
d. None of the above
2. An objective function is maximized when it is a ‐‐‐‐‐‐‐‐‐‐‐ function
a. Passive b. Profit
c. Cost d. None of the above
3. In LPP the condition to be satisfied is
a. Constraints have to be linear
b. Objective function has to be linear
c. both a and b
d. none of the above
Faculty Name: Dr. Sarang Sadawarte
02/25/2025 101
Unit Number 1
 MCQ(CO1)
4. Slack variable
a. Is the difference between the left and right sides of a constraint?
b. Is the amount by which the left side of a is ≤ constraint is smaller
than the right side.
c. Is the amount by which the left side of a is ≤ constraint is larger than
the right side.
d. Exists for each variable in a linear programming problem.
5. In simplex method , which variables is added in the case of ‘=’ ?
e. Slack Variable
f. Surplus Variable
g. Artificial Variable
h. None of the above

Faculty Name: Dr. Sarang Sadawarte

02/25/2025 102
Unit Number 1
 Glossary(CO1)

Q1. For the following:

i. Min
ii. Max.
Pick the correct option from glossary:
a. Big M Method
b. Slack Variable
c. Surplus Variable
d. Two Phase Method

Faculty Name: Dr. Sarang Sadawarte

02/25/2025 103
Unit Number 1
 Glossary(CO1)

Q 2. For the following:

i. U
ii. Artificial Variable
iii. Slack Variable
iv. Degency
Pick the correct option from glossary:
a. Inequality is
b. Minimum ratio is same
c. Minimum ratio can not be calulated
d. Inequality is

Faculty Name: Dr. Sarang Sadawarte

02/25/2025 104
Unit Number 1
 Question Paper

Question paper pattern:

Faculty Name: Dr. Sarang

AIML Sadawarte
Unit-3
02/25/2025 105
Unit Number 1
 Question Paper

Question paper pattern:

Faculty Name: Dr. Sarang

AIML Sadawarte
Unit-3
02/25/2025 106
Unit Number 1
 End Semester Question Paper

Faculty Name:Dr. Sarang Sadawarte Unit

02/25/2025 107
II
 End Semester Question Paper

Faculty Name:Dr. Sarang Sadawarte Unit

02/25/2025 108
II
 End Semester Question Paper

Faculty Name:Dr. Sarang Sadawarte Unit

02/25/2025 109
II
 End Semester Question Paper

Faculty Name:Dr. Sarang Sadawarte Unit

02/25/2025 110
II
 End Semester Question Paper

Faculty Name:Dr. Sarang Sadawarte Unit

02/25/2025 111
II
 Expected Questions for University Exam

1) Solve the following LP problem by Simplex Method

Max z = 10x1 + 6x2
Subject to x 1 + x 2 ≤ 2
2x 1 + x2 ≤ 4
3x 1 + 8x 2 ≤ 12
and x1 , x2 ≥ 0
2) Solve the following LP problem by Simplex Method
Maximize Z = 3x 1 + 2x 2
Subject to 4x 1 + 3x 2 ≤ 12
4x 1 + x 2 ≤ 8
4x1-x2≤8
and x1 , x2 ≥ 0
Faculty Name: Dr. Sarang Sadawarte
02/25/2025 112
Unit Number 1
 Expected Questions for University Exam

3) Solve the following LP problem by Simplex Method

Max z = 3x 1 + 2x 2 + 5x3
Subject to x 1 + 2x 2 + x3 ≤ 430
3x 1 + 2x3 ≤ 260
x 1 + 4x 2 ≤ 420
and x1 , x2 , x3 ≥ 0
4) Solve the following LP problem by Simplex Method
Maximize Z = 3x 1 + 2x 2
Subject to x 1 + x 2 ≤ 4
x1-x2≤2
and x1 , x2 ≥ 0

Faculty Name: Dr. Sarang Sadawarte

02/25/2025 113
Unit Number 1
 Expected Questions for University Exam

5) Solve the following LP problem by Simplex Method

Maximize Z = x 1 + x 2 + 3x3
Subject to 3x 1 + 2x 2 + x3 ≤ 3
2x 1 + x 2 + 2x3 ≤ 2
and x1 , x2 , x3 ≥ 0
6) Solve the following LP problem by Big M Method
Maximize Z = 10x + 13y
s.t.
2x + y ≤ 8
x + 4y ≥ 7
Both x and y all ≥ 0.
7) Solve the following LP problem by Big M Method
Maximize Z = 9x + 8y
Faculty Name: Dr. Sarang Sadawarte
02/25/2025 114
s.t. Unit Number 1
 Expected Questions for University Exam

2x +6 y ≤ 4
4x + 5y ≥ 5
Both x and y all ≥ 0.
8) Solve by Two phase method:
Maximize Z = 12x + 10y
s.t.
2x + 3y ≤ 8
5x + 4y ≥ 7
Both x and y all ≥ 0.
9). Solve by Two phase method:
Maximize Z = 7x + 5y
s.t.

Faculty Name: Dr. Sarang Sadawarte

02/25/2025 115
Unit Number 1
 Expected Questions for University Exam

6x + y ≤ 2
4x + y ≥ 3
Both x and y all ≥ 0.
10) write a short note on
a. Slack Variable
b. Surplus Variable
c. Degency
d. Unbounded
e. Fesible Solution
f. Duality

Faculty Name: Dr. Sarang Sadawarte

02/25/2025 116
Unit Number 1
 Recap of unit 1

 We have discussed about the LPP

 We have discussed about the graphical method of LPP
 We have discussed slack or surplus variables.
 We have discussed Simplex method of solving LP problems.
 We have discussed Big-M method.
 We have discussed Two phase method.
 We have discussed Alternative optimum solutions.
 We have discussed Unbounded solutions.
 We have discussed Degeneracy.
 We have discussed Duality.

Faculty Name: Dr. Sarang Sadawarte

02/25/2025 117
Unit Number 1
 References

Text Books
1.Operation Research : Theory and Application by J.K Sharma.
2. Operation Research by Kanti Swarup, Man Mohan and P.K Gupta.
3. Operations Research: An Introduction, Global Edition
by Hamdy A. Taha Hamdy
4. Introduction to Operations Research by Hillier Lieberman
5. Rao S.S,”Optimization – Theory and applications”, Wiley Easter
Ltd., 1979.
6. Introduction to Linear Optimization by Dimitris Bertsimas & John
N. Tsitsiklis, Athena Scientific 1997

Faculty Name: Dr. Sarang Sadawarte

02/25/2025 118
Unit Number 1
 References

Reference Books
1.An introduction to Optimization by Edwin P K Chong, Stainslaw
Zak.
2. Operations Research Hillier F S and Lieberman G J, Holden Day
Inc., San Francisco.
3. Introduction to Linear and Non Linear Programming, David
G.Luerbeggan, Addison Wesley Publishing Co. 1973.
 Thank You

Faculty Name: Dr. Sarang Sadawarte

02/25/2025 120
Unit Number 1