BCAC403

Group-B
Let X1 be the packets of sweet A made. Let X2 be the number of packets of sweet B made.
Objective is to Maximize 800X1 + 900X2
Constraints are 2X1 + 3X2 ≤ 25 (constraint on flour availability)
5X1 + 3X2 ≤ 28 (constraint on sugar availability)
1 X1, X2 ≥ 0 (non-negativity constraints)
Let the number of jars of liquid product purchased be x and that of cartons of dry product purchased be y so that the
minimum units of chemicals required be fulfilled.
Min Z=3x+2y
s.t, 5𝑥 + 𝑦 ≥ 10
2𝑥 + 2𝑦 ≥ 12
𝑥 + 4𝑦 ≥ 12
𝑥, 𝑦 ≥ 0
2

Let the number of commodities produced be x for Type I and y for Type II per week.
Max Z= 10x+15y
s.t, 100𝑥 + 150𝑦 ≤ 2000
6𝑥 + 10𝑦 ≤ 84
𝑥, 𝑦 ≥ 0
3
Max Z= 2000x+3000y
s.t, 3𝑥 + 2𝑦 ≤ 90
𝑥 + 2𝑦 ≤ 100
4 𝑥, 𝑦 ≥ 0
x=the number of units of product X produced per week.
y= the number of units of product Y produced per week.
𝑀𝑎𝑥 𝑧 = 50𝑥 + 60𝑦
Where
2𝑥 + 𝑦 ≤ 100
𝑥 + 3𝑦 ≤ 120
𝑥 ≥ 0, 𝑦 ≥ 0
5
Let x and y be the amounts of egg and milk respectively.
Min Z=12x+20y
Subject to,
6𝑥 + 8𝑦 ≥ 100
7𝑥 + 12𝑦 ≥ 120
x, y ≥ 0
6
Let total number of Machine A and B are x and y respectively. Then the LP is
Minimize 𝑧 = 1000𝑥 + 1200𝑦
Subject to 4𝑥 + 5𝑦 ≤ 40
𝑥≥3
𝑦≥1
7 1000𝑥 + 1200𝑦 ≤ 15000
Let:
x = the number of units of type A cloth produced
8 y = the number of units of type B cloth produced
 z = the number of units of type C cloth produced
Maximize Z=2x+3y+4z
2x+3y≤8
3x+2y+5z≤10
2y+4z≤15
x,y,z≥0

There are three possible cases.

Let 𝑥1 = 0
The system of equations becomes
𝑥2 + 𝑥3 = 4
5𝑥2 − 2𝑥3 = 3
After solving, solution we have (0,11/7,17/7)

Again let 𝑥2 = 0
The system of equations becomes
𝑥1 + 𝑥3 = 4
2𝑥1 − 2𝑥3 = 3

After solving, solution we have (11/4,0,5/4)

Again let 𝑥3 = 0

The system of equations becomes

𝑥1 + 𝑥2 = 4

2𝑥1 + 5𝑥2 = 3
After solving, solution we have (17/3, -5/3,0)
Therefore, the required basic feasible solution is (0,11/7,17/7); (11/4,0,5/4).
9
There are six possible cases.

Let 𝑥1 = 0 , 𝑥2 = 0
The system of equations becomes
2𝑥3 + 𝑥4 = 3
4𝑥3 + 6𝑥4 = 2
After solving, solution we have (0,0,2,-1)

Let 𝑥1 = 0 , 𝑥3 = 0

6𝑥2 + 𝑥4 = 3

4𝑥2 + 6𝑥4 = 2

After solving, solution we have (0,1/2,0,0)

Let 𝑥1 = 0 , 𝑥4 = 0
10 6𝑥2 + 2𝑥3 = 3
 4𝑥2 + 4𝑥3 = 2
After solving, solution we have (0,1/2,0,0)

Let 𝑥2 = 0 , 𝑥3 = 0
2𝑥1 + 𝑥4 = 3
6𝑥1 + 6𝑥4 = 2
After solving, solution we have (8/3,0,0,-7/3)

Let 𝑥2 = 0 , 𝑥4 = 0
2𝑥1 + 2𝑥3 = 3
6𝑥1 + 4𝑥3 = 2
After solving, solution we have (-2,0,7/2,0)

Let 𝑥3 = 0 , 𝑥4 = 0
2𝑥1 + 6𝑥2 = 3
6𝑥1 + 4𝑥2 = 2
After solving, solution we have (0,1/2,0,0)

All the three basic feasible solution are(0,1/2,0,0)

There are three possible cases.
Let 𝑥1 = 0
The system of equations becomes
𝑥2 − 𝑥3 = 3
3𝑥2 + 𝑥3 = 2
After solving, solution we have (0,5/4, -7/4)

Again let 𝑥2 = 0
The system of equations becomes
3𝑥1 − 𝑥3 = 3
2𝑥1 + 𝑥3 = 2

After solving, solution we have (1,0,0)

Again let 𝑥3 = 0

The system of equations becomes

3𝑥1 + 𝑥2 = 3

2𝑥1 + 3𝑥2 = 2
After solving, solution we have (1,0,0)
Therefore, the required basic solution is (0,5/4, -7/4), (1,0,0)
11
There are three possible cases.
Let 𝑥1 = 0
The system of equations becomes
𝑥2 + 𝑥3 = 8
12 2𝑥2 = 18
After solving, solution we have (0,9, -1)

Again let 𝑥2 = 0
The system of equations becomes
𝑥1 + 𝑥3 = 8
3𝑥1 = 18

After solving, solution we have (6,0,2)

Again let 𝑥3 = 0

The system of equations becomes

𝑥1 + 𝑥2 = 8

3𝑥1 + 2𝑥2 = 18
After solving, solution we have (2,6,0)
Therefore, the required basic solution is (0,9, -1), (6,0,2), (2,6,0)
BFS are (6,0,2), (2,6,0)
There is no degenerate solution.
 Group-C
Let x1 and x2 be the number of proud produce A and B respectively by manufacturer
Max z  6 x1  5 x2
Sub. to
x1  x2  5
3 x1  2 x2  12
1 x1, x2  0
 x1 = number of units of product A to produce
 x2 = number of units of product B to produce
Maximize Z=6x1+5x2
Subject to
x1+x2≤5
3x1+2x2≤12
2 Using Graphical methods, the maximum value of z occurs at x1=2,x2=3 and Max Z=27
Let x1 and x2 be the number of chairs and tables.
Max z  20 x1  30 x2
Sub. to
3 x1  3 x2  36
5 x1  2 x2  50
2 x1  6 x2  60
3 x1, x2  0
Let x1 and x2 be the number of chairs and tables.
Max z  20 x1  30 x2
Sub. to
3 x1  3 x2  36
5 x1  2 x2  50
2 x1  6 x2  60
x1, x2  0
Using the graphical methods, we have
4 Maximum value of z occurs at x1=3,x2=9 and Max Z=330
Let the number of type I and type II machines purchased be x and y.
Max z = 70x+110y
Subject to,
20𝑥 + 30𝑦 ≤ 220
2000𝑥 + 1500𝑦 ≤ 20000
5 𝑥 ≥ 2, 𝑦 ≥ 5
Let x = Number of 27-inch T.V sets to be produced per month.
And y = Number of 20-inch T.V sets to be produced per month.

Also let z = total profit per month.

Max z =120x+80y
Subject to, 𝑥 ≤ 40
𝑦 ≤ 10
20𝑥 + 10𝑦 ≤ 500
6 And 𝑥, 𝑦 ≥ 0
 x1 = number of units of product A to produce
7 x2 = number of units of product B to produce
 𝑀𝑎𝑥 𝑧 = 2𝑥 + 3𝑦
Subject to, 2𝑥 + 3𝑦 ≤ 300
𝑥 + 𝑦 ≤ 300
𝑥 + 3𝑦 ≤ 240
𝑥, 𝑦 ≥ 0
 x = number of sheep to buy
 y = number of goats to buy
Maximize Z=10x+15y
x+y≤50
80x+100y≤4400
8 x,y≥0
 x = number of units of product A produced
 y = number of units of product B produced
Maximize Z=5x+4y
2x+y≤100
x+3y≤90
x≥0,y≥0

9
 x = number of chairs produced
 y = number of tables produced
Maximize Z=20x+30y
5x+8y≤400
2x+4y≤160
x≥0,y≥0

10
Linear Programming (LP) is a powerful mathematical technique for optimizing a linear objective function
subject to linear equality and inequality constraints. However, it has its limitations, which are important to
consider:
11
Linearity: Linear Programming deals with linear relationships between variables. If the relationships are
non-linear, LP may not provide accurate solutions.

Continuity: LP assumes that decision variables can take any real value within a given range. It may not be
suitable for problems where variables must be integers (Integer Linear Programming) or where variables
can only take on specific values (Mixed Integer Linear Programming).

Additivity: LP assumes that the contribution of each decision variable to the objective function
is additive. This may not hold true for all real-world problems.

Certainty: LP assumes that all parameters in the problem (coefficients, constants) are known
with certainty. In reality, parameters may be uncertain or subject to variability, which can affect
the validity of LP solutions.

Single Objective: LP typically deals with optimizing a single objective function. Many real-world problems
involve multiple conflicting objectives, requiring techniques such as Multi-Objective Optimization.

Complexity: While LP can handle problems with a large number of variables and constraints, it may become
computationally expensive for very large-scale problems. Additionally, as the problem complexity increases,
finding an optimal solution may become more difficult.

Assumptions: LP relies on certain assumptions such as proportionality, additivity, and certainty, which may
not always hold in practice. Violation of these assumptions can lead to suboptimal or unrealistic solutions.

Sensitivity Analysis: LP solutions are sensitive to changes in problem parameters. While sensitivity analysis
can provide insights into the robustness of solutions, it may not always capture the full complexity of real-
world scenarios.