Assignment-1

1-
(i)-To maximize revenue, we need to find the optimal mix of products A and B that
maximizes the total revenue while considering the constraints on available resources (flour
and sugar).

Let's denote:

xx as the number of packets of type A

yy as the number of packets of type B

The objective function to maximize revenue is:

Revenue=1000x+900yRevenue=1000x+900y

Subject to the constraints:

Flour constraint: 3x+3y≤213x+3y≤21 (as each packet of A requires 3 kg of flour and each
packet of B requires 3 kg of flour)

Sugar constraint: 3x+4y≤283x+4y≤28 (as each packet of A requires 3 kg of sugar and each
packet of B requires 4 kg of sugar)

We need to solve this linear programming problem.

First, let's find the feasible region by plotting the constraints:

Flour constraint: 3x+3y≤213x+3y≤21

Sugar constraint: 3x+4y≤283x+4y≤28

Now, we need to find the intersection points of these lines to identify the feasible region.
Then we evaluate the objective function at each corner point of the feasible region to find the
optimal solution. Let's solve it step by step.

We'll start by finding the intersection points of the lines formed by the constraints.

Flour constraint: 3x+3y=213x+3y=21

This equation simplifies to: x+y=7x+y=7

When x=0x=0, y=7y=7

Sugar constraint: 3x+4y=283x+4y=28

This equation doesn't have nice integer values for intersection points. We'll leave it as it is.

Now, we have the following intersection points:

Point A: (0, 7)

Point B: (7, 0)

Next, we evaluate the objective function at these points:

At Point A: Revenue=1000(0)+900(7)=6300Revenue=1000(0)+900(7)=6300

At Point B: Revenue=1000(7)+900(0)=7000Revenue=1000(7)+900(0)=7000

Thus, we have found that the optimal solution lies at Point B with x=7x=7 and y=0y=0,
meaning 7 packets of type A and 0 packets of type B.

So, the best product mix to maximize revenue is to produce 7 packets of type A, resulting in a
revenue of Rs. 7000.

(ii)- This problem can be formulated as a linear programming problem to maximize the
reach while staying within the budget constraints.

Let's denote:

x1 as the number of TV advertisements

x2 as the number of newspaper advertisements

x3 as the number of website advertisements

x4 as the number of radio advertisements

The objective function to maximize reach is:

Reach=8000x1+5000x2+3000x3+2000x4Reach=8000x1+5000x2+3000x3+2000x4

Subject to the constraints:

Cost constraint: 4x1+3x2+2x3+1.5x4≤324x1+3x2+2x3+1.5x4≤32 (Budget constraint)

Maximum number of advertisements constraint:

x2≤4x2≤4

x3≤5x3≤5

x4≤4x4≤4

We need to solve this linear programming problem.

Let's find the feasible region by plotting the constraints, and then find the optimal solution.

To find the optimal solution, let's solve the linear programming problem step by step:

Objective function:

Reach=8000x1+5000x2+3000x3+2000x4Reach=8000x1+5000x2+3000x3+2000x4

Constraints:

Cost constraint: 4x1+3x2+2x3+1.5x4≤324x1+3x2+2x3+1.5x4≤32 (Budget constraint)

Maximum number of advertisements constraint:

x1≤3x1≤3

x2≤4x2≤4

x3≤5x3≤5

x4≤4x4≤4

We'll start by considering the maximum number of advertisements allowed for each media:

TV: 3

Newspaper: 4

Websites: 5

Radio: 4

Now, we need to check if the budget constraint allows us to reach the maximum number of
advertisements for each media.

The cost per advertisement and the maximum number of advertisements for each media are
as follows:
 TV: Rs 4 lakhs per ad, maximum 3 ads

Newspaper: Rs 3 lakhs per ad, maximum 4 ads

Websites: Rs 2 lakhs per ad, maximum 5 ads

Radio: Rs 1.5 lakhs per ad, maximum 4 ads

Given the budget constraint, we can calculate the maximum number of advertisements the
company can afford for each media:

TV: 32/4=832/4=8 (but maximum allowed is 3)

Newspaper: 32/3=10.6732/3=10.67 (but maximum allowed is 4)

Websites: 32/2=1632/2=16 (but maximum allowed is 5)

Radio: 32/1.5=21.3332/1.5=21.33 (but maximum allowed is 4)

Since the budget constraint limits the number of advertisements, the company will advertise
the maximum allowed number of ads for each media to maximize reach:

TV: 3 advertisements

Newspaper: 4 advertisements

Websites: 5 advertisements

Radio: 4 advertisements

So, the company decides to advertise 3 times on TV, 4 times in newspapers, 5 times on
websites, and 4 times on the radio to maximize reach while staying within the budget.
Ques -3

1.

Max Z=3x1+2x2

s.t 2x1+x2<=4,x1-x2<=2,x1,x2>=0

 2x1+x2+s1=4
 x1−x2+s2=2x1−x2+s2=2

 x1,x2,s1,s2≥0x1,x2,s1,s2≥0

The optimal solution is x1=2x1=2, x2=0x2=0, with the objective function value Z=6Z=6.

2.

Min z=X1-2x2+2x3

s.t 3x1-x2+5x3<=6,-2x1+4x2<=12,-4x1+3x2+8x3<=10,x1,x2,x3>=0

 3x1−x2+5x3+s1=6
 −2x1+4x2+s2=12−2x1+4x2+s2=12
 −4x1+3x2+8x3+s3=10−4x1+3x2+8x3+s3=10
 x1,x2,x3,s1,s2,s3≥0x1,x2,x3,s1,s2,s3≥0
Iteration 1:

Since there are negative coefficients in the row for the objective function, we proceed with the
simplex method.

Iteration 2:

Iteration 3:

The optimal solution is x1=0x1=0, x2=2.214x2=2.214, x3=0x3=0, with the objective function value
Z=26.857Z=26.857.

Ques 4>

Max z=6x1+4x2

s.t 2x1+3x2<=30,x1+x2>=3,3x1+2x@<=24,x1,x2>=0

 2x1+3x2+s1=30
 x1+x2−s2=3x1+x2−s2=3
 3x1+2x2+s3=243x1+2x2+s3=24
introduce artificial variables for each constraint to form an initial basic feasible solution.
We'll use a large positive number MM for the artificial variables.

The problem becomes:

Subject to:

1. 2x1+3x2+s1=302x1+3x2+s1=30
2. x1+x2−s2+a1=3x1+x2−s2+a1=3
3. 3x1+2x2+s3=243x1+2x2+s3=24
4. x1,x2,s1,s2,s3,a1≥0x1,x2,s1,s2,s3,a1≥0

Before proceeding with the iterations, let's adjust the equation for x2x2 in constraint 2:

x1+x2−s2+a1=3x1+x2−s2+a1=3

It should be:

x1+x2+a1−s2=3x1+x2+a1−s2=3

Iteration 0:

Iteration 1:
Iteration 2:

The optimal solution is x1=3x1=3, x2=24x2=24, with the objective function value Z=−48Z=−48.

Ques 5>

Min z=x1+x2

s.t 2x1+x2>=4,x1+7x2>=7,x1,x2>=0

 2x1+x2+s1=4
 x1+7x2+s2=7x1+7x2+s2=7
 x1,x2,s1,s2,a1,a2≥0x1,x2,s1,s2,a1,a2≥0

The initial tableau for the two-phase method will be:

Iteration 0:

Iteration 1:

The solution is optimal. We have x1=7x1=7, x2=3x2=3, and the minimum value of Z=−1Z=−1.
Ques 6>

1.Min z=5x1+7x2

s.t 2x1+x2>=10,3x1+7x2>=20,x1,x2>=0

To convert the given primal linear programming problem into its dual form, we'll follow
these steps:

Given the primal problem:Minimize Z = 5x_1 + 7x_2

Subject to:

1. 2x_1 + x_2 >=10

2. 3x_1 + 7x_2>=20

3. x_1, x_2>= 0

Now, let's convert it into dual form:Maximize W = 10y_1 + 20y_2

Subject to:

1. 2y_1 + 3y_2 <= 5

2. y_1 + 7y_2 <= 7

3. y_1, y_2 >= 0

The objective function coefficients in the primal problem become the right-hand side
constants in the dual problem, and vice versa. The direction of the inequalities also
changesSo, the dual problem is:Maximize W = 10y_1 + 20y_2

Subject to:

1. 2y_1 + 3y_2 >=5

2.y_1 + 7y_2 >= 7

3. y_1, y_2 >= 0

This is the dual form of the given primal linear programming problem.