Home
Class 12
MATHS
If an LPP admits optimal solution at two...

If an LPP admits optimal solution at two consecutive vertices of a joining two points

A

the required optimal solution is at the midpoint of the line joining two points

B

the optimal solution occurs at every point on the line joining these two points

C

the LPP under consideration is not solvable

D

the LPP under consideration must be reconstruted

Text Solution

AI Generated Solution

The correct Answer is:
To solve the problem regarding the Linear Programming Problem (LPP) that admits an optimal solution at two consecutive vertices of a line joining two points, we can follow these steps: ### Step-by-Step Solution: 1. **Understanding the Problem**: - We need to analyze a Linear Programming Problem (LPP) where the optimal solution occurs at two consecutive vertices of the feasible region. **Hint**: Identify what is meant by "consecutive vertices" and how they relate to the feasible region of the LPP. 2. **Graphical Representation**: - Draw the feasible region on a graph, marking the axes (x-axis and y-axis) and the vertices of the feasible region. **Hint**: Visualizing the feasible region can help you understand where the vertices are located and how they connect. 3. **Identifying the Optimal Solution**: - According to the properties of LPP, if an optimal solution exists at two consecutive vertices, it means that the objective function is constant along the line segment joining these two vertices. **Hint**: Recall that the objective function is maximized or minimized at the vertices of the feasible region. 4. **Analyzing the Midpoint**: - Check if the optimal solution occurs at the midpoint of the line segment joining the two vertices. In this case, it does not; the optimal solution occurs along the entire line segment. **Hint**: Remember that the midpoint is just one point, while the optimal solution can be any point along the line segment. 5. **Conclusion**: - Since the optimal solution occurs at every point on the line joining the two vertices, the correct conclusion is that the optimal solution is not just at the vertices but along the entire line segment connecting them. **Hint**: Consider the implications of having multiple optimal solutions and how they affect the interpretation of the LPP. ### Final Answer: The correct option is that the optimal solution occurs at every point on the line joining these two vertices.
Promotional Banner

Topper's Solved these Questions

  • LINEAR PROGRAMMING

    TARGET PUBLICATION|Exercise Evaluation Test|11 Videos
  • LINEAR PROGRAMMING

    TARGET PUBLICATION|Exercise Critical Thinking|28 Videos
  • LINE

    TARGET PUBLICATION|Exercise Evaluation Test|1 Videos
  • MATHEMATICAL LOGIC

    TARGET PUBLICATION|Exercise EVALUATION TEST|14 Videos

Similar Questions

Explore conceptually related problems

If LPP has optimal solution at two point then,

Distance between two consecutive crests is

The difference of two consecutive cubes

Any two consecutive numbers are coprime.

Define Optimal Solution of LPP.

Direction ratio of the line segment joining two points

Find two consecutive numbers whose sum is 73

The distance between two consecutive antinodes is

TARGET PUBLICATION-LINEAR PROGRAMMING-Competitive Thinking
  1. Inequations 3x-yge3 and 4x - y gt 4

    Text Solution

    |

  2. The objective function of LLP defined over the convex set attains its ...

    Text Solution

    |

  3. If an LPP admits optimal solution at two consecutive vertices of a joi...

    Text Solution

    |

  4. The maximum value of P = 3x +4y subject to the constraints x+yle40,2yl...

    Text Solution

    |

  5. If 4x+5yle20,x+yge3,xge0,yge0 maximum 2x + 3y is

    Text Solution

    |

  6. The maximum of z = 5x+2y , subject to the constrainsts x+yle7,x+2yle1...

    Text Solution

    |

  7. The maximum value of 2x+y subject to 3x+5yle26and5x+3yle30,xge0,yge0...

    Text Solution

    |

  8. By graphical method, the solutions of linear programming problem maxim...

    Text Solution

    |

  9. The maximum value of 4x +5y subject to the constraints x+yle20,x+2yle...

    Text Solution

    |

  10. Max value of z equal 3x + 2y subject to x+yle3,xle2,-2x+yle1,xge0,yge...

    Text Solution

    |

  11. The point at which , the maximum value of (3x+2y) subject to the const...

    Text Solution

    |

  12. The point which provides the solution of the linear programming proble...

    Text Solution

    |

  13. The points which provides the solution to the linear programming probl...

    Text Solution

    |

  14. The corner points of the feasible region determined by the system of l...

    Text Solution

    |

  15. The corner points of the feasible region determined by the system of l...

    Text Solution

    |

  16. The minimum value of z=2z(1)+3x-(2) subjected to the constraints 2x(1)...

    Text Solution

    |

  17. The minimum value of the objective function Z=2x+10y for linear const...

    Text Solution

    |

  18. For the following linear programming problem minimize Z=4x+6y subject ...

    Text Solution

    |

  19. The co-ordinates of the point for minimum value z = 7x - 8y subject ...

    Text Solution

    |

  20. Minimise and Maximise Z=5x+10y Subject to x+2yle120,x+yge60,x-2yge0,...

    Text Solution

    |