Discussion
Which of the following statements is true ?
Answer: D
The true statement is that the simplex method approaches the solution by moving from corner to corner along the edges.
The simplex method starts at a vertex (basic feasible solution) of the feasible region and at each step moves along an edge to an adjacent vertex with a better objective value, stopping when no neighbouring vertex is better.
It is not guaranteed to solve every problem: it can only report infeasibility or unboundedness, and without anti-cycling rules it can cycle. Searching through the interior of the region is what Karmarkar's interior-point algorithm (1984) does, so the second and third statements have the two methods the wrong way round.
Post your comment
Please log in or register to post a comment.
Examination Categories
- SSC Exams
- Banking Exams
- Teaching Exams
- Civil Services Exams
- Railways Exams
- Engineering Recruitment Exams
- Defence Exams
- State Government Exams
- Police Exams
- Insurance Exams
- Nursing Exams
- Other Government Exams
- NRA CET
- PG Entrance Exams
- Campus Placement
- MBA Entrance Exams
- CUET and UG Entrance
- Judiciary Exams
- Regulatory Body Exams
- Software Development