Linear Programming MCQ Quiz in मल्याळम - Objective Question with Answer for Linear Programming - സൗജന്യ PDF ഡൗൺലോഡ് ചെയ്യുക

Explanation:

There are special cases in Linear programming problems solved by the graphical method.

i) Infinite or Multi–optimum solution: If the slope of the objective function becomes equal to one of the constraints then infinite no. of solution will exist.

ii) No solution or infeasible solution: In some conditions, a constraint may be inconsistent in such a manner that it is not possible to find a common feasible point that satisfies all the constants then there is no solution to such a problem.

iii) Unbounded solution: In some conditions, constraints are inconsistent in such a manner that the greatest value of objective function goes up to infinite. It simply means that a common feasible region is not bounded by the limit on the constraints.

Explanation:

Simplex method:

• The simplex method is the most popular method used for the solution of Linear Programming Problems (LPP).
• The Simplex method is a search procedure that shifts through the set of basic feasible solutions, one at a time until the optimal basic feasible solution is identified.
• It can be used for two or more variables as well (always advisable for more than two variables to avoid lengthy graphical procedure).
• The simplex method is not used to examine all the feasible solutions.
• It deals only with a small and unique set of feasible solutions, the set of vertex points (i.e. extreme points/corner points) of the convex feasible space that contain the optimal solution.
• All the resource values or constraints should be non-negative.
• All the inequalities of the constraint should be converted to equalities with the help of slack or surplus variables.

Explanation:

Simplex method is a step by step procedure in which we proceed in a systematic manner from an initial feasible solution with an improvement in every iteration until we reach optimum solution.

i) All the resource value or constraints should be non negative.

ii) All the inequalities of the constraint should be converted to equalities with the help of slack or surplus variables.

iii) It can be used for two or more variables as well

Explanation:

Simplex Method:

• Simplex Method is a standard technique of solving linear programming problems for an optimized solution, typically involving a function and several constraints expressed as inequalities.
• The inequalities define a polygonal region and the solution is typically at one of the verticles.

Some Special Conditions of the Simplex Method:

1. Unbounded Solution: In the simplex method, if in the pivot column all the entries are negative or zero when choosing to leave the variable then the solution is unbounded.

2. Infeasible Solution: In the simplex method, if artificial variables are present in the basis, then the solution obtained is infeasible.

3. Degenerated Solution: In the simplex method, if some of the values in the constant column are zero, then the solution becomes degenerated.

4. Multiple Solution: In the simplex method, if the non-basic variable in the final simplex table showing the optimal solution to a problem, has a net zero contribution, then the condition of multiple optimal solutions arises.

Concept:

Draw the constraints to find the feasible region:

• To draw the inequalities, first, draw the equation form of the inequalities.
• Now check the region which we have to choose depending on the sign of inequality.
• To check which region we need to choose put (0,0) in both the inequality. and check whether this inequality is satisfying or not.
• If it is satisfying the inequality then take the region containing (0,0) else the opposite side of (0,0).

Calculation:

Given: 

The equations are plotted in the graph

As it is clear from graph that there is no point (x₁, x₂) which can lie in both regions, so there is no solution or infeasible solution.

Explanation:

After equating each constraint to zero (0) we get the equations of lines on cartesian coordinate.

On comparing the inequality with (0,0) and shading the common area we get the feasible region as follows,

Hence we can easily conclude that point (60,0) and (0,100) are outside the feasible region.

Additional Information

Points outside the feasible region do not contribute to the objective function.

Concept:

Convert the inequality constraints into equations and find the common points of the bounded region.

Calculations:

Given, LPP:

Max. Z = -0.1 x₁ + 0.5 x₂

2x₁ + 5x₂ ≤ 80

x₁ + x₂ ≤ 20

x₁, x₂ ≥ 0

Convert the inequality constraints into equations, we have

2x₁ + 5x₂ = 80

x₁ + x₂ = 20

2x₁ + 5x₂ = 80 passes through the point (0, 16) and (40, 0)

x₁ + x₂ = 20 passes through the point (0, 20) and (20, 0).

Now, the co ordinates of the point A = (0, 16), B = (20, 0) and C = 

Here, maximum value occurs at (0, 16)

For given

Max. Z = -0.1 x₁ + 0.5 x₂

2x₁ + 5x₂ ≤ 80

x₁ + x₂ ≤ 20

x₁, x₂ ≥ 0

to get the optimum solution, the values of x₁, x₂ are (0, 16)

Concept:

In an assignment problem of size n × n, number of decision variables is n².

Calculation:

Given:

n = 6

The given problem will have n² = 36 decision variables.

Concept:

In a transportation problem, the number of allocations required without degeneracy can be determined using a specific formula.

A transportation problem with m" id="MathJax-Element-23-Frame" role="presentation" style="position: relative;" tabindex="0">mm $m$ supply centers and n" id="MathJax-Element-24-Frame" role="presentation" style="position: relative;" tabindex="0">nn $n$ demand centers has a non-degenerate solution if the number of allocations (basic variables) is m+n−1" id="MathJax-Element-25-Frame" role="presentation" style="position: relative;" tabindex="0">m+n−1m+n−1 $m + n - 1$ .

Calculation:

Given:

Number of supply centers,

Number of demand centers,

The formula for non-degenerate allocations is,

Applying the formula:

m+n−1=4+5−1=8m+n−1=4+5−1=8" id="MathJax-Element-26-Frame" role="presentation" style="text-align: center; position: relative;" tabindex="0">m+n−1=4+5−1=8

$$m + n - 1 = 4 + 5 - 1 = 8$$

Conclusion:

The number of allocations without degeneracy during an iteration is: 8

The correct answer is:

Concept:

• The corner points of the feasible region are the points for which we need to check the value of the objective function.
• The maximum value of the objective function for these corner points of the feasible region will be the optimal feasible point(s).​

Calculation:

Given: The shaded infeasible region is given to us.

• The corner points of the feasible region are:

C(15, 15), B(5, 5), M(10, 0) and N(60, 0)

• There is no change in corner points occurs due to extra constraints.

• The maximum value of x + 3y will occur at two points C and N.

• Now check whether there is a possibility of multiple solutions. For that join the points C and N. If the points C and N are lying at the same line segment CN so for all the points on that line segment CN, the value of the objective function will be a maximum of 60.
• Since corner points C and N are lying on the same line segment CN so , at every point on the line segment CN, we will get the maximum value of the objective function.

• So, the correct answer is option 4.