Question

The simplex method is used for solving ________________________problems.

• A. octagonal programming
• B. Cartesian correlation
• C. queue matching
• D. linear programming

Answer 1

Answer:

D. linear programming

The simplex method is a popular search procedure used for solving Linear Programming Problems (LPP). It involves systematically shifting through basic feasible solutions until the optimal basic feasible solution is identified. The method can be used for two or more variables. The variables involved are artificial, basic, non-basic, slack, and surplus.