Bachelor of Computer Applications and 4th semester

Optimization Techniques (BCAC403)

BCA
2023-2024

Study Material
Course Name: Optimization Techniques
Course Code: BCAC403
Module-1
__________________________________________________________________________

Table of Contents

SL No. CONTENTS Page No.

1 1.1 Introduction 2
2 1.2 Advantages of LPP 5

3 1.3 Limitations of Linear programming problem 6

4 1.4 Formation of some common models of Linear 7
Programming Problems
5 1.5 Optimization Problem 8
6 1.6 Basic solution in Linear Programming Problem 13

7 1.7 Feasible solution in Linear Programming 14

Problem
8 1.8 Optimum solution 15
9 1.9 The Fundamental Theorem of Linear 16
Programming
10 1.10 Self-Assessment Questions 17

Department of Mathematics
Brainware University, Kolkata 1
Bachelor of Computer Applications and 4th semester
Optimization Techniques (BCAC403)
BCA
2023-2024

Module 1

1.1 Introduction

Linear Programming (LP) is a mathematical technique for optimization that is widely used in
business and industry. LP is used to determine the optimal way to allocate scarce resources
among competing demands. It is used in many different fields, including economics,
management science, operations research, and engineering.

LP is a mathematical method used to find the best possible solution to a given problem within
certain constraints. The problem is usually formulated as a system of linear inequalities or
equations, and the objective is to maximize or minimize a linear function of the variables
subject to these constraints. In other words, LP is used to find the optimal values of a set of
decision variables that satisfy a set of linear constraints and optimize a linear objective
function.

The general form of an LP problem can be stated as follows:

𝑀𝑎𝑥𝑖𝑚𝑖𝑧𝑎(𝑜𝑟 𝑀𝑖𝑛𝑖𝑚𝑖𝑧𝑒)𝑧 = 𝑐1 𝑥1+ 𝑐2 𝑥2 + 𝑐3 𝑥3 + 𝑐4 𝑥4 + ⋯ + 𝑐𝑛 𝑥𝑛

Subject to
𝑎11 𝑥1 + 𝑎12 𝑥2 + ⋯ + 𝑎1𝑛 𝑥𝑛 ≤ 𝑏1
𝑎21 𝑥1 + 𝑎22 𝑥2 + ⋯ + 𝑎2𝑛 𝑥𝑛 ≤ 𝑏2
𝑎31 𝑥1 + 𝑎32 𝑥2 + ⋯ + 𝑎3𝑛 𝑥𝑛 ≤ 𝑏3
... … … … ……………
𝑎𝑚1 𝑥1 + 𝑎𝑚2 𝑥2 + ⋯ + 𝑎𝑚𝑛 𝑥1 ≤ 𝑏𝑚
𝑥1 , 𝑥2 , … , 𝑥𝑛 ≥ 0

In the above formulation, 𝑥1 , 𝑥2 , … , 𝑥𝑛 are the decision variables, 𝑐1 , 𝑐2 , … , 𝑐𝑛 are the

coefficients of the objective function,
𝑎11 , 𝑎12, 𝑎13,.., 𝑎1𝑛, 𝑎21 , 𝑎22 , … 𝑎2𝑛, 𝑎31 , 𝑎32 , … 𝑎3𝑛 , … 𝑎𝑚1, 𝑎𝑚2 , … , 𝑎𝑚𝑛 are the coefficients of the

Department of Mathematics
Brainware University, Kolkata 2
Bachelor of Computer Applications and 4th semester
Optimization Techniques (BCAC403)
BCA
2023-2024

constraints, and𝑏1 , 𝑏2 , … , 𝑏𝑚 are the constants that represent the right-hand sides of the
constraints.

L.P.P in matrix form:

In matrix form the above problem can be written as
𝑥1
𝑥2
Optimize z=[𝑐1 𝑐2 … 𝑐𝑛 ] [ ⋮ ]=𝐶𝑋
𝑥𝑛

Subject to the constraints,

𝑎11 𝑎12 … 𝑎1𝑛 𝑥1 𝑏1

𝑎21 𝑎22 … 𝑎2𝑛 𝑥2 𝑏2
[… … … … ].[ ⋮ ] ≤ [ ⋮ ]
𝑎𝑛1 𝑎𝑛2 … 𝑎𝑛𝑛 𝑥𝑛 𝑏𝑚
⟹ 𝐴𝑋 = 𝐵
also 𝑋 ≥ 0

Here 𝐶 = [𝑐1 𝑐2 … 𝑐𝑛 ] is row vector which is called Cost Vector.

𝐴 = (𝑎𝑖𝑗 )𝑚𝑥𝑛 is called co-efficient matrix,
x1 𝑏1
x2 𝑏2
X = [ ⋮ ] is called decision vector and 𝐵 = [ ] is called requirement vector.
⋮
xn 𝑏𝑚

The decision variables represent the quantities that the decision maker can control and are the
variables that the LP problem is trying to optimize. The objective function is the linear function
that is to be maximized or minimized, and the constraints represent the limitations or
restrictions that must be satisfied by the decision variables.

Department of Mathematics
Brainware University, Kolkata 3
Bachelor of Computer Applications and 4th semester
Optimization Techniques (BCAC403)
BCA
2023-2024

The LP problem is formulated in such a way that the objective function is a linear combination
of the decision variables, and the constraints are linear inequalities or equations. This linear
structure is what makes LP problems solvable using a variety of mathematical techniques.

LP problems can be solved using graphical methods, algebraic methods, or computer

algorithms. The most commonly used method for solving LP problems is the Simplex
algorithm. The Simplex algorithm is an iterative method that starts at a feasible solution and
moves to better solutions until an optimal solution is reached.

The Simplex algorithm works by moving from one vertex to another of the feasible region of
the LP problem. The feasible region is the set of all points in the n-dimensional space that
satisfy the constraints of the problem. The vertices of the feasible region are the extreme points
of the constraints, and the optimal solution is found at one of the vertices.

The Simplex algorithm moves from one vertex to another by examining the objective function
at each vertex and moving to the adjacent vertex that improves the objective function. This
process continues until the optimal solution is reached.

LP problems can also be solved using integer programming techniques. Integer programming
is a variation of LP in which the decision variables are restricted to integer values. This
restriction makes the problem more difficult to solve, but it is necessary in many real-world
applications.

Linear Programming (LP) is a mathematical method used to optimize complex systems with
constraints. It has many practical applications in business and industry. Here are some
examples:

1.Production Planning: Companies often use LP to optimize production plans by determining

the optimal quantities of different products to produce, given production constraints like labor
hours, machine time, and raw material availability. LP can help companies minimize costs
while maximizing profits.

Department of Mathematics
Brainware University, Kolkata 4
 Bachelor of Computer Applications and 4th semester
Optimization Techniques (BCAC403)
BCA
2023-2024

2.Supply Chain Management: LP is also used in supply chain management to optimize

transportation and logistics. Companies use LP to determine the optimal distribution of goods
between different locations, minimizing transportation costs and maximizing efficiency.

3.Resource Allocation: LP can also be used to allocate resources within a company, such as
budget, personnel, and equipment. This helps companies to optimize resource usage and
minimize costs.

4.Investment Management: LP can help investors to optimize their investment portfolios. By

determining the optimal allocation of assets, LP can help investors to maximize returns while
minimizing risk.

5.Marketing: Companies often use LP to optimize their marketing strategies. By determining

the optimal mix of different marketing channels, such as social media, television, and print,
companies can maximize their reach and minimize their marketing costs.

6.Financial Planning: LP can help companies to plan their finances by determining the optimal
mix of debt and equity financing. This helps companies to minimize their financing costs while
maximizing their profitability.

Overall, LP is a powerful tool for businesses and industries to optimize their operations and
minimize costs while maximizing profits.

1.2 Advantages of LPP:

Linear programming (LP) is a mathematical method used to optimize a linear objective

function subject to linear constraints. Here are some advantages of using LP:

1. Flexibility: LP is a versatile tool that can be applied to a wide range of problems in different
fields, such as business, engineering, and economics.

2. Efficient: LP algorithms are highly efficient, and can solve large-scale problems quickly and
accurately.

3. Optimality: LP provides an optimal solution that maximizes or minimizes the objective

function subject to the constraints.

Department of Mathematics
Brainware University, Kolkata 5
 Bachelor of Computer Applications and 4th semester
Optimization Techniques (BCAC403)
BCA
2023-2024

4. Sensitivity analysis: LP allows for the sensitivity analysis of the objective function and
constraints, which provides insight into the impact of changes in the parameters of the problem.

5. Multiple objectives: LP can handle problems with multiple objectives, providing a way to
balance competing goals.

6. Decision making: LP provides a rigorous and objective framework for decision making,
making it easier to compare and evaluate different options.

7. Integration: LP can be integrated with other optimization techniques and simulation models,
providing a powerful tool for problem-solving.

Overall, linear programming is a powerful and versatile optimization tool that has many
advantages over other methods.

1.3 Limitations of Linear programming problem:

Linear programming (LP) is a mathematical method for optimizing a linear objective function,
subject to linear constraints. While LP has been widely used in various fields, there are some
limitations and drawbacks to this method:

1. Linear programming assumes that the relationships between the variables are linear. In reality,
many relationships are not strictly linear, and this can lead to inaccurate results.

2. LP requires that all the decision variables be continuous. It cannot handle discrete or binary
variables, which are common in many real-world applications.

3. LP assumes that the objective function and constraints are known and fixed. However, in many
real-world problems, the objective function or constraints may change over time.

Department of Mathematics
Brainware University, Kolkata 6
 Bachelor of Computer Applications and 4th semester
Optimization Techniques (BCAC403)
BCA
2023-2024

4. LP is a deterministic method, meaning that it assumes that all the input parameters are known
with certainty. However, in many real-world problems, the input parameters are uncertain or
subject to variation.

5. LP assumes that the solution space is convex, meaning that the optimal solution lies at one of
the extreme points of the solution space. However, in some cases, the solution space may be
non-convex, and the optimal solution may lie in the interior of the solution space.

6. LP assumes that the objective function is additive, meaning that the total objective value is the
sum of the objective values of the individual decision variables. However, in some cases, the
objective function may have non-additive or non-linear components, which cannot be modeled
using LP.

7. LP assumes that the constraints are linear and do not interact with each other. However, in some
cases, the constraints may be non-linear or may interact with each other, making it difficult to
use LP to model the problem.

1.4 Formation of some common models of Linear Programming Problems

Some of the common models of L.P.P are discussed here.

(a) Production allocation problem:

Suppose that the quantities of the m available resources to a manufacturer are 𝑏𝑖 (i=1,2,3,…,m).
He produces n commodities 𝐴1 , 𝐴2 , … , 𝐴𝑛 .The production of one unit of the j-th commodity
requires 𝑎𝑖𝑗 units of i-th resource. Let 𝑐𝑗 be the profit on one unit of the j-th commodity. Then
the manufacturer wants to know the best production so that the total profit is maximum.

This problem can be expressed as L.P.P as follows:

If 𝑥1 , 𝑥2 , … , 𝑥𝑛 be the quantities of production of 1st, 2nd ,…,n-th commodities respectively,

then the total profit is given by

𝑧 = 𝑐1 𝑥1 + 𝑐2 𝑥2 + ⋯ + 𝑐𝑛 𝑥𝑛 and the problem is

𝑀𝑎𝑥𝑖𝑚𝑖𝑧𝑒 𝑧 = 𝑐1 𝑥1 + 𝑐2 𝑥2 + ⋯ + 𝑐𝑛 𝑥𝑛

Department of Mathematics
Brainware University, Kolkata 7
Bachelor of Computer Applications and 4th semester
Optimization Techniques (BCAC403)
BCA
2023-2024

Subject to 𝑎11 𝑥1 + 𝑎12 𝑥2 + ⋯ 𝑎1𝑛 𝑥𝑛 ≤ 𝑏1

𝑎21 𝑥1 + 𝑎22 𝑥2 + ⋯ 𝑎2𝑛 𝑥𝑛 ≤ 𝑏2

…………………………………………………..

…………………………………………………..

𝑎𝑚1 𝑥1 + 𝑎𝑚2 𝑥2 + ⋯ 𝑎𝑚𝑛 𝑥𝑛 ≤ 𝑏𝑚

Also, there is a restriction on the variables that they are non-negative, i.e. 𝑥𝑗 ≥ 0, 𝑗 = 1,2, … , 𝑛

1.5 Optimization Problem:

A programming problem is called an optimization problem if the objective function is minimize

or maximize which is a numerical function depending on some variables where the variables
are subject to certain constraints.

Objective function in an LPP:

The numerical function of the decision variables (𝑥1 , 𝑥2 , … , 𝑥𝑛 ) which is to be optimize subject
to certain constraints and non-negativity restrictions is said be an objective function of an L.P.P

Slack variable:

If the constraint of an L.P.P is of ≤ sign, then adding some non-negative variable to the left-
hand side of the constraint, we may convert it an equal to sign. In this case the variable which
is added to the L.H.S of the inequation is called a slack variable.

Surplus variable:

If the constraint of an L.P.P is of ≥ sign, then adding some non-negative variable to the left-
hand side of the constraint, we may convert it an equal to sign. In this case the variable which
is a subtracted to the L.H.S of the inequation is called a surplus variable.

Department of Mathematics
Brainware University, Kolkata 8
Bachelor of Computer Applications and 4th semester
Optimization Techniques (BCAC403)
BCA
2023-2024

Example: A firm can produce three types of cloth, say A, B and C. Three kinds of wool are
required for it, say red, green and blue wool. One-unit length of type A cloth need 2 yards of
red wool and 3 yards of blue wool; one unit length of type B cloth needs 3 yards of red wool,
2 yards of green wool and 2 yards of blue wool; and one unit of type C cloth needs 5 yards of
green wool and 4 yards of blue wool. The firm has only a stock of Rs. 800 yards of red wool,
1000 yards of green wool and 1500 yards blue wool. It is assumed that the income obtained
from one-unit length of type A cloth is Rs. 3.00 of type B cloth is Rs. 5.00 and of type C cloth
is Rs. 4.00. Determine how the firm should use the available materials, so as to maximize the
income from the finished cloth.

Ans.:

Tabular form representation:

Quality of wool Quantities(in yds)of the Total quantity of available

wools required for one wool
yard of the cloth of Type:
A B C
Red 2 3 0 800
Green 0 2 3 1000
Blue 3 2 4 1500
Income per unit length of 3.00 5.00 4.00
cloth( in Rs.)
Quantities(in units) of the 𝒙𝟏 𝒙𝟐 𝒙𝟑
cloth produced.

Solution:

Let to have maximum profit the firm produces 𝑥1 , 𝑥2 , 𝑥3 quatities(in yards) of types A, B, C
cloth respectively. As per condition each yard of cloth A requires 2 yards of red wool and so
for 𝑥1 yards of A cloth, total red wool required 2𝑥1 yards. Similarly 𝑥2 yards of B type cloth
needs 3𝑥2 yards of red wool and C type cloth needs no red wool and so on.

Department of Mathematics
Brainware University, Kolkata 9
Bachelor of Computer Applications and 4th semester
Optimization Techniques (BCAC403)
BCA
2023-2024

Thus total quantities (in yards) of red, green and blue wools are:

2𝑥1 + 3𝑥2 + 0. 𝑥3 (red wool)

0. 𝑥1 + 2𝑥2 + 5. 𝑥3 (green wool) and

3𝑥1 + 2𝑥2 + 4. 𝑥3 (blue wool)

Since maximum quantities of available wool are 800 yards of red, 1000 yards of green and
1500 yards of blue, so 𝑥1 , 𝑥2 , 𝑥3 satisfy the following inequalities:

2𝑥1 + 3𝑥2 ≤ 800

2𝑥2 + 5. 𝑥3 ≤ 1000

3𝑥1 + 2𝑥2 + 4. 𝑥3 ≤ 1500

Also the firm cannot produce any negative quantities, so 𝑥1 ≥ 0, 𝑥2 ≥ 0, 𝑥3 ≥ 0

Again total income from these quantities in Rupees is

𝑧 = 3𝑥1 + 5𝑥2 + 4. 𝑥3

Thus the linear programming problem becomes,

Max 𝑧 = 3𝑥1 + 5𝑥2 + 4. 𝑥3

Subject to,

2𝑥1 + 3𝑥2 ≤ 800

2𝑥2 + 5. 𝑥3 ≤ 1000

3𝑥1 + 2𝑥2 + 4. 𝑥3 ≤ 1500

And 𝑥1 ≥ 0, 𝑥2 ≥ 0, 𝑥3 ≥ 0

Example 2:

Department of Mathematics
Brainware University, Kolkata 10
Bachelor of Computer Applications and 4th semester
Optimization Techniques (BCAC403)
BCA
2023-2024

At a cattle breeding firm it is prescribed that the food ration for one animal must contain at
least 12, 20 and 3 units of nutrients A, B and C respectively. Three different kinds of fodder
are available. Each unit weight of these contains the following units of the three nutrients:

Fodder I Fodder II Fodder III

Nutrient A 2 1 5
Nutrient B 1 2 1
Nutrient C 0 1 1

It is given that the cost of each unit of fodder 1, 2 and 3 are Rs. 3, Rs. 2 and Rs. 5 respectively.
Formulate this problem as L.P.P.

Solution:

Let 𝑥1 , 𝑥2 and 𝑥3 amount of fodder 1, 2 and 3 respectively in unit of weight be used for ration
for each animal to satisfy the requirement of minimum nutrients.

Then the total costs in Rs. is

𝑧 = 3𝑥1 + 2𝑥2 + 5𝑥3 and the total amounts of nutrients are 2𝑥1 + 𝑥2 + 5𝑥3 , 𝑥1 + 2𝑥2 + 𝑥3 ,
𝑥2 + 𝑥3

Thus the L.P.P is

𝑀𝑖𝑛𝑖𝑚𝑖𝑧𝑒 𝑧 = 3𝑥1 + 2𝑥2 + 5𝑥3

Subject to

2𝑥1 + 𝑥2 + 5𝑥3 ≥ 12

𝑥1 + 2𝑥2 + 𝑥3 ≥ 20

𝑥2 + 𝑥3 ≥ 3

And 𝑥1 , 𝑥2 , 𝑥3 ≥ 0

Express the following L.P.P in canonical form:

Department of Mathematics
Brainware University, Kolkata 11
Bachelor of Computer Applications and 4th semester
Optimization Techniques (BCAC403)
BCA
2023-2024

1.𝑀𝑎𝑥 𝑧 = 2𝑥1 − 3𝑥2

Subject to 2𝑥1 + 5𝑥2 ≤ 3

𝑥1 − 𝑥2 ≥ 2

𝑥1 , 𝑥2 ≥ 0

Solution: Max z = 2x1 − 3x2

Subject to, 2x1 + 5x2 ≤ 3

−x1 + x2 ≤ −2

x1 , x2 ≥ 0

Express the following L.P.P in standard form:

Minimize z=𝑥1 + 𝑥2 − 𝑥3

Subject to the constraints,

𝑥1 + 𝑥2 − 𝑥3 ≥ 4

2𝑥1 + 𝑥2 − 3𝑥3 ≤ 24

2𝑥1 − 𝑥2 + 𝑥3 ≥ 10

𝑥1 , 𝑥2 , 𝑥3 ≥ 0

Solution:

Introducing the surplus variables 𝑥4 , 𝑥6 ≥ 0 and a slack variable 𝑥5 ≥ 0, the given L.P.P can
be written as,

Minimize z = 𝑥1 + 𝑥2 − 𝑥3 + 0. 𝑥4 + 0. 𝑥5 + 0. 𝑥6

Subject to the constraints,

𝑥1 + 𝑥2 − 𝑥3 − 𝑥4 = 4

2𝑥1 + 𝑥2 − 3𝑥3 + 𝑥5 = 24

Department of Mathematics
Brainware University, Kolkata 12
Bachelor of Computer Applications and 4th semester
Optimization Techniques (BCAC403)
BCA
2023-2024

2𝑥1 − 𝑥2 + 𝑥3 − 𝑥6= 10

𝑥1 , 𝑥2 , 𝑥3 , 𝑥4 , 𝑥5 , 𝑥6 ≥ 0

1.6 Basic solution in Linear Programming Problem:

In linear programming, a basic solution is a feasible solution to a system of linear equations

that satisfies the constraints of the problem and has a unique set of basic variables.

The basic variables are the variables that are non-zero in the basic solution, while the non-basic
variables are set to zero. The number of basic variables is equal to the number of constraints
in the problem.

For example, consider the following linear programming problem:

𝑀𝑎𝑥 𝑧 = 3𝑥1 + 4𝑥2

Subject to the constraints,

2𝑥1 + 𝑥2 ≤ 5

𝑥1 + 2𝑥2 ≤ 4

𝑥1 , 𝑥2 ≥ 0

A basic solution to this problem can be found by selecting two constraints and solving for the
corresponding basic variables. For instance, if we choose the first two constraints, we obtain
the following system of equations:

2𝑥1 + 𝑥2 = 5

𝑥1 + 2𝑥2 = 4

Solving this system of equations, we get 𝑥1 = 2 and 𝑥2 = 1, which gives us a basic solution (2,1)
with basic variables 𝑥1 and 𝑥2 . The non-basic variables are set to zero, so we have 𝑥3 = 𝑥4 =
0.

Note:

Department of Mathematics
Brainware University, Kolkata 13
Bachelor of Computer Applications and 4th semester
Optimization Techniques (BCAC403)
BCA
2023-2024

There can be many basic solutions to a linear programming problem, and the optimal solution
is the basic solution that gives the highest objective function value.

1.7 Feasible solution in Linear Programming Problem

In linear programming, a feasible solution is a solution that satisfies all the constraints of the
problem. In other words, it is a point in the solution space that is consistent with the
requirements of the problem.

For example, suppose you have a linear programming problem to maximize profit subject to
constraints on the availability of resources. A feasible solution to this problem would be any
combination of values for the decision variables that satisfies the constraints of the problem.
If the problem has two decision variables, x and y, and the constraints are x + y ≤ 10, 2x + y
≤ 16, x ≥ 0, and y ≥ 0, then any point that satisfies these constraints is a feasible solution. For
example, (3,7), (4,6), and (5,5) are all feasible solutions.

It's worth noting that a feasible solution may not necessarily be an optimal solution. An optimal
solution is the best solution among all feasible solutions. Linear programming algorithms are
used to find the optimal solution to a problem by iteratively exploring the solution space and
evaluating the objective function at each point.

Non-degenerate basic solution:

If all the basic variables in a basic solution are non-zero, then the basic solution is said to be a
non-degenerate basic solution.

Degenerate basic solution:

If one or more of the basic variables in a basic solution is/are equal to zero, then it is said to be
a degenerate basic solution.

Basic feasible solution:

In a basic solution all the basic variable is non-negative then such type of basic solution is said
to be a basic feasible solution.

Non-degenerate Basic feasible solution:

Department of Mathematics
Brainware University, Kolkata 14
Bachelor of Computer Applications and 4th semester
Optimization Techniques (BCAC403)
BCA
2023-2024

In a basic feasible solution all the basic variables 𝑋𝐵 > 0, then this solution is said to be non-
degenerate Basic feasible solution.

Degenerate Basic feasible solution:

In a basic feasible solution one or more of the basic variable is/are equal to zero, then it is said
to be degenerate basic feasible solution.

1.8 Optimum solution

Optimum solution represents the pinnacle of problem-solving, embodying the ideal balance
between resources, constraints, and objectives. It serves as the cornerstone of optimization
endeavours across a myriad of disciplines, from engineering and economics to operations
research and beyond. In this lecture series, we embark on a journey through the intricacies of
finding and understanding optimal solutions within diverse contexts.

Understanding Optimization Problems:

At the heart of every optimization endeavour lies the intricate interplay of objectives and
constraints. Optimization problems come in various forms, ranging from linear and nonlinear
to discrete and continuous. They necessitate a profound comprehension of objective functions
and constraints, serving as the guiding light towards the attainment of optimal outcomes.
Through illustrative examples spanning different domains, we unravel the essence of
optimization problems and their significance in decision-making processes.

Techniques for Finding Optimum Solutions:

In the quest for optimal solutions, a myriad of techniques and methodologies stand at our
disposal. Analytical methods offer a structured approach, employing mathematical

Department of Mathematics
Brainware University, Kolkata 15
Bachelor of Computer Applications and 4th semester
Optimization Techniques (BCAC403)
BCA
2023-2024

optimization techniques and analytical solutions tailored to specific problem types.

Concurrently, heuristic and metaheuristic methods offer a more flexible yet potent arsenal,
leveraging evolutionary algorithms and heuristic approaches to navigate complex solution
spaces. By juxtaposing their strengths and weaknesses, we unveil the nuanced artistry of
finding optimum solutions amidst uncertainty and complexity.

1.9 The Fundamental Theorem of Linear Programming

If there is a solution to a linear programming problem, then it will occur at an extreme point,
or on a line segment between two corner points.

A linear program satisfies exactly one of the following:

i) The LP is infeasible (i.e. has no feasible solution).

ii) The LP has an optimal solution.

iii) The LP is unbounded (i.e. (for a maximization problem) for any bound L, there exists a

feasible solution x to the LP with c · x > L)

The following fact has been added by Chvatal:

iv) If there is a feasible solution then there is a basic feasible solution and if there is an optimal

solution then there is a basic feasible solution which is optimal.

Department of Mathematics
Brainware University, Kolkata 16
Bachelor of Computer Applications and 4th semester
Optimization Techniques (BCAC403)
BCA
2023-2024

1.10 Self-Assessment Questions

Group –A

(Multiple Choice Type Question)

Module-I

Define the time that Operations Research came into existence.

1
a. in the year 1940 b. in the business context

c. during World War I d. during World War II

Select from below:

2 Operations Research achieved recognition as a subject of academic study in the year

a.1949 b.1950

c.1953 d.1957

3 Memorize “Operations Research is”

a. Applied decision theory b. a scientific approach to problems solving

for executive management

c. the science of use d. all of the these

4 Identify “Operations Research approach is”

a. intuitive b. objective

c. multi-disciplinary d. all of the above

5 Observe “A model in Operations Research is”

a. an approximation b. an idealization

c. an essence of reality d. all of the above

6 Locate “A physical model is an example of “

Department of Mathematics
Brainware University, Kolkata 17
Bachelor of Computer Applications and 4th semester
Optimization Techniques (BCAC403)
BCA
2023-2024

a. Iconic model b. Analogue model

c. Verbal model d. Symbolic model

7 Decisions variables in an OR model identified are

a. controllable b. uncontrollable

a. Parameters d. constants

8 Examine-The scientific method in Operations Research consists of

a. Judgement phase b. research phase

c. action phase d. all of these

9 Identify the following situation where Operations Research techniques are not applicable.

a. Resources available are unlimited b. Objective can be defined for maximization

or minimization

b. Sufficient input data is available for d. Scientific methods, techniques and tools
formulating the problem may be applied

10 Select the appropriate one. An optimization model in OR

a. provides decision within its limited context b. Mathematically provides the best decision

c. helps in evaluating various alternatives d. all of these

constantly.

11 Select which one is not correct.

a. a model should be simple and coherent b. a model should not take much time in its
construction for any problem

c. A model representing the typical budget of d. a model which has the probability of
business accounts is called “account model” measuring observations is called “qualitative
model”

12 Select which one is not correct.

Department of Mathematics
Brainware University, Kolkata 18
Bachelor of Computer Applications and 4th semester
Optimization Techniques (BCAC403)
BCA
2023-2024

a. Models are only an attempt in understanding b. Iconic models are pictorial representation
operations and should never be considered as of real system
absolute in any case.

c. Heuristic model are particular cases of Iconic d. Analogue models are most abstract than
models iconic ones.

Linear programming problem (LPP) must have an----

13 Select the correct answer.

a. Objective(goal)that we aim to maximize or b. Constraints(restrictions)that we need to

minimize specify

c. Decision variables(activities)that we need to d. All of these.

determine

14 Identify which of the following is not associated with an LPP.

a. Proportionality b. Uncertainty

c. Additivity d. Divisibility

15 Select the correct one-A constraint in an LPP restricts

a. value of objective function b. value of a decision variable

c. use of available resource d. uncertainity of optimum value

16 A constraint in an LPP is identified as

a. an equation with'= sign b. inequality with '≥' sign

c. inequality with '≤' sign d. any or all of these

Non-negativity condition is an important component of LPP, because--------------Select the

17 correct option.

a. variables are inter-related in terms of limited b. value of variables make sense and
resources correspond to real world problems

Department of Mathematics
Brainware University, Kolkata 19
Bachelor of Computer Applications and 4th semester
Optimization Techniques (BCAC403)
BCA
2023-2024

c. value of variables should remain under the d.none of these

control of decision-maker

18 Minimization of objective function in LPP defined as

a. least value chosen among the allowable b. greatest value chosen among the allowable
decision decisions

a. Both least value chosen among the allowable d.none of these

decision and greatest value chosen among the
allowable decisions
19 Select from the following which one is not correct about LPP.

a. all constraínts must be linear relationships b. Objective function must be linear

c. All the constraints and decision variables d. All decision variables must be non-
must be of either '≤ ‘or ′ ≥’ type negative

20 Define “The general linear programming problem is in standard form”, if

a. the constraints are strict equations b. the constraints are inequalities of ‘≤’type

c. the constraints are inequalities of ‘≥’type d. the decision variables are unrestricted in
sign

21 Locate the wrong one.

a. slack variables are used to convert the b. surplus variables are used to convert the
inequalities of the type '≤' into equations inequalities of the type '≥’ into equations

c. all LPP with all its constraints are of the type d. an LPP with all its constraints are of the
‘≥ ′ is said to be in standard form type '≤ ′ is said to be in canonical form

22 A feasible solution to an LPP defined as

a. must satisfy all of the problem’s constraints b. must be a corner point of the feasible
simultaneously region

Department of Mathematics
Brainware University, Kolkata 20
Bachelor of Computer Applications and 4th semester
Optimization Techniques (BCAC403)
BCA
2023-2024

c. need not satisfy all of the constraints, only d. must optimize the value of the objective
some of them function

Given a system of m simultaneous linear equations in n unknowns (m<n), select the number of
23 basic variables.

a. m b. n

C .n-m d. n+m

Group – B

(Short Answer Type Questions)

Answer any five from the following:

1. A shop can make two types of sweets (A and B). They use two resources – flour and sugar.
To Make one packet of A, they need 2 kg of flour and 5 kg of sugar. To make one packet of
B, they need 3 kg of flour and 3 kg of sugar. They have 25 kg of flour and 28 kg of sugar.
These sweets are sold at Rs 800 and 900 per packet respectively. Find the best product mix.
Deduce LPP. 3
2. Mr. X requires at least 10,12 and 12 units of chemicals A, B, C for his garden. One jar of
liquid product contains 5,2 and 1 unit of A, B, C respectively. A dry product contains 1,2 and
4 units of A, B, C per carton. If the liquid product sells for Rs. 3 per jar and the dry product
sells for Rs. 2 per carton, illustrate a relevant LP problem to minimize the cost and to meet
the requirement. 3
3. A manufacturer produces two types of commodities. Production cost of one of each type of
commodities are Rs.100 and Rs. 150 respectively and times needed are 6 hours and 10 hours
respectively. He can work 12 hours per day and his capital is Rs. 2000. The profit of each type
of commodities are Rs.10 and Rs.15 respectively. Deduce the correct objective function for
this problem. 3
4. One unit of product A requires 3 kg. of resources R1 and 1 kg. of resource R2. One unit of
product B requires 2 kg. of resources R1 and 2 kg. of resource R2. The profits per unit by 3

Department of Mathematics
Brainware University, Kolkata 21
Bachelor of Computer Applications and 4th semester
Optimization Techniques (BCAC403)
BCA
2023-2024

selling product A and B are Rs. 2000 and Rs. 3000 respectively. The manufacturer requires
90 kg. of resource R1 and 100 kg. of resource R2. Illustrate a relevant LP problem.

5. A manufacturing company produces two types of products, X and Y. Each unit of X requires
2 hours of labor and 1 hour of machine time, while each unit of Y requires 1 hour of labor and
3 hours of machine time. The company has 100 hours of labor and 120 hours of machine time
available per week. Product X yields a profit of $50 per unit, and product Y yields a profit of
$60 per unit. Deduce the LPP to maximize its weekly profit? 3
6. Egg contains 6 unit of vitamin -A per gram and 7 unit of vitamin-B per gram and costs 12
paisa per gram. Milk contains 8 unit of vitamin-A per gram and 12 units of vitamin-B per
gram and costs 20 paisa per gram. The daily minimum requirements for vitamin-A and
vitamin-B are 100 unit and 120 unit. Rewrite the most suitable objective function for this
problem after formulating an LP problem. 3
7. A manufacturer has two types of machine to choose from. He must have at least three A type
of machine and one B type of machine. The cost of the machine is Rs. 1000.00 and Rs. 1200
for the type A and B respectively. The floor area taken by the two type of machines are 4𝑚2
and 5𝑚2 respectively. The total cost must not exceed Rs. 15000 and the total available floor
space is 40𝑚2 . Illustrate a LP problem to minimize the cost. 3
8. A firm can produce three types of cloths say A, B and C. Three kinds of wools are required
for it, say red wool, green wool and blue wool. One
length of type A cloth needs 2 yards of red wool and 3 yards of green wool; One-unit length
of type B cloth needs 3 yards of red wool, 2 yards of green wool and 2 yards of blue wool
and one unit of type C cloth need 5 yards of green wool and 4 yards of blue wool. The firm
has only a stock of 8 yards of red wool, 10 yards of green wool and 15 yards of blue wool.
It is assumed that the income from the cloths are Rs 2.00, Rs. 3.00 and Rs. 4.00 respectively.
Illustrate a LPP to maximize the profit. 3
9. Evaluate all the basic feasible solution of the system of equations
x1  x2  x3  4
2 x1  5 x2  2 x3  3 3
10. Evaluate only two basic feasible solution of the system of equations
2 x1  6 x2  2 x3  x4  3
6 x1  4 x2  4 x3  6 x4  2 3

Department of Mathematics
Brainware University, Kolkata 22
Bachelor of Computer Applications and 4th semester
Optimization Techniques (BCAC403)
BCA
2023-2024

11. Evaluate all the basic solutions of the following equations.

3x1  x2  x3  3
2 x1  3x2  x3  2 3
12. Define basic feasible solution. Express all the basic solution, BFS and degenerate solution of
the system of equation:
x1+ x2+ x3= 8
3x1+ 2x2 = 18
3

Group – C

(Long Answer Type Questions)

Answer any six from the following:

1. A small manufacturer making two products A and B. Two resources R1 and R2 are
required to make these products. Each unit of product A requires 1 unit of R1 and 3
units of R2. Each unit of product B requires 1 unit of R1 and 2 units of R2. The
manufacturer has 5 units of R1 and 12 units of R2 available. The manufacturer also
makes a profit of Rs. 6 per unit of product A when sold and Rs. 5 per unit of product B
when sold.
Define a mathematical formulation to this linear programming problem for maximizes
the profit. 5
2. A small manufacturer making two products A and B. Two resources R1 and R2 are 5
required to make these products. Each unit of product A requires 1 unit of R1 and 3
units of R2. Each unit of product B requires 1 unit of R1 and 2 units of R2. The
manufacturer has 5 units of R1 and 12 units of R2 available. The manufacturer also
makes a profit of Rs. 6 per unit of product A when sold and Rs. 5 per unit of product B
when sold.
Observe by graphical method to tell the solution this problem.

Department of Mathematics
Brainware University, Kolkata 23
Bachelor of Computer Applications and 4th semester
Optimization Techniques (BCAC403)
BCA
2023-2024

3. A firm makes two types of furniture – chairs and tables. The profit for each product as 5
calculated by the accounting department is Rs. 20 per chair and Rs.30 per table. Both
products are to be processed on three machines M1, M2, M3. The time required in
hours by each product and total time available in hours per week on each machine is
as follows:
Machine Chair Table Available
Time(hrs)
M1 3 3 36
M2 5 2 50
M3 2 6 60

Identify a mathematical formulation to this linear programming problem to maximize

the profit.

4. A firm makes two types of furniture – chairs and tables. The profit for each product as 5
calculated by the accounting department is Rs. 20 per chair and Rs.30 per table. Both
products are to be processed on three machines M1, M2, M3. The time required in
hours by each product and total time available in hours per week on each machine is
as follows:
Machine Chair Table Available Time(hrs)
M1 3 3 36
M2 5 2 50
M3 2 6 60
Solve by graphical method to describe this problem.
5. A person has two types of machines and he must have at least 2 first type of machine 5
and 5 second type of machine. The cost of each first type machine is Rs. 2000 and it
requires 20 𝑚2 space whereas the cost of each second type machine is Rs. 1500 and it
requires 30 𝑚2 space. His capital is Rs. 20000 and the available space is 220 𝑚2 . Profit
from each first type machine is Rs. 70 and Rs.110 from the second type. Describe the
above problem as a linear programming problem.
6. A Television Company has to decide on the number of 27- and 20- inch sets to be 5
produced at one of its factories. Market research indicates that at most 40 of 27- inch
sets and 10 of the 20-inch sets can be sold per month. The maximum number of work-
hours available is 500 per month. A 27-inch set requires 20 work-hour and a 20-inch set
requires 10 work-hour. Each 27 inch set produces a profit of $120 and each 20-inch set
produces a profit of $80. A wholesaler has agreed to purchase all the television sets

Department of Mathematics
Brainware University, Kolkata 24
Bachelor of Computer Applications and 4th semester
Optimization Techniques (BCAC403)
BCA
2023-2024

produced if the numbers do not exceed the maxima indicated by the market research.
Identify an LPP in terms of maximizing total profit per month.

7. A factory engaged in manufacturing two products A and B which involve lathe 5

work, grinding and assembling. The cutting, grinding and assembling times required
for one unit of A are 2, 1 and 1 hours respectively and those for one unit of B are 3,1
and 3 hours respectively. The profit on each unit of A and B are Rs. 2.00 and Rs.3.00
respectively.
Assuming that 300 hours of lathe time, 300 hours of grinding time and 240 hours of
assembling time are available, Describe this as an LPP in terms of maximizing the profit
on the times manufactured.
8. A farmer buys sheep and goats at Rs. 80 per sheep and Rs. 100 per goat, and sells them 5
at a profit of Rs.10 per sheep and Rs. 15 per goat. The farmer has an accommodation for
not more than 50 animals and cannot afford to pay more than Rs. 4400. He wishes to
buy these two kinds of animals in order to have the maximum profit. Create an LPP for
this problem.
9. A company produces two types of products, A and B. Each unit of product A requires 2 5
units of raw material X and 1 unit of raw material Y. Each unit of product B requires 1
unit of raw material X and 3 units of raw material Y. The company has 100 units of raw
material X and 90 units of raw material Y available. Product A sells for $5 per unit and
product B sells for $4 per unit. Evaluate the number of units of each product that should
the company be produced to maximize revenue?

Department of Mathematics
Brainware University, Kolkata 25
Bachelor of Computer Applications and 4th semester
Optimization Techniques (BCAC403)
BCA
2023-2024

10. A manufacturing company produces two types of furniture, chairs, and tables. Each 5
chair requires 5 units of wood and 2 units of steel, while each table requires 8 units of
wood and 4 units of steel. The company has 400 units of wood and 160 units of steel
available. If the profit per chair is $20 and the profit per table is $30, Evaluate the number
of chairs and tables that should the company be produced to maximize profit?

11. Express the limitations of Linear Programming. 5

Department of Mathematics
Brainware University, Kolkata 26