Linear Programming MCQs

श्रेणी: Mathematics | विषय: Advanced Mathematics | टॉपिक: Linear Programming

Advanced Mathematics • Linear Programming

A solution to a linear programming problem that satisfies all the constraints except the non-negativity constraint is referred to as: A solution to a linear programming problem that satisfies all the constraints except the non-negativity constraint is referred to as:

सेव करें Save सेव्ड Saved

A. Feasible solution Feasible solution B. Basic solution Basic solution C. Optimal solution Optimal solution D. Basic feasible solution Basic feasible solution

सही उत्तर: B Correct Answer: B

A basic solution satisfies the system of equality constraints but need not satisfy non-negativity. If it also satisfies non-negativity, it becomes a basic feasible solution.

Advanced Mathematics • Linear Programming

If at least one of the basic variables is zero in a basic feasible solution of an LPP, the solution is said to be: If at least one of the basic variables is zero in a basic feasible solution of an LPP, the solution is said to be:

सेव करें Save सेव्ड Saved

A. Optimal Optimal B. Singular Singular C. Unbounded Unbounded D. Degenerate Degenerate

सही उत्तर: D Correct Answer: D

A basic feasible solution is degenerate when one or more of its basic variables has value zero.

Advanced Mathematics • Linear Programming

In the simplex method, which variables are introduced to convert constraint conditions into equations? In the simplex method, which variables are introduced to convert constraint conditions into equations?

सेव करें Save सेव्ड Saved

A. Feasible variables Feasible variables B. Basic variables Basic variables C. Degenerate variables Degenerate variables D. Slack variables Slack variables

सही उत्तर: D Correct Answer: D

Slack variables are added to less-than-or-equal-to constraints to convert the inequalities into equations.

Advanced Mathematics • Linear Programming

Select the correct dual of the LPP: Maximize z=5x1+9x2, subject to 2x1+5x2>=37, 6x1-7x2>=56, and x1,x2>=0. Select the correct dual of the LPP: Maximize z=5x1+9x2, subject to 2x1+5x2>=37, 6x1-7x2>=56, and x1,x2>=0.

सेव करें Save सेव्ड Saved

A. Minimize L=-37y1-56y2; subject to -2y1-6y2>=5, -5y1+7y2>=9, y1,y2>=0 Minimize L=-37y1-56y2; subject to -2y1-6y2>=5, -5y1+7y2>=9, y1,y2>=0 B. Minimize L=-5y1-9y2; subject to 2y1+5y2>=37, 6y1-7y2>=56, y1,y2>=0 Minimize L=-5y1-9y2; subject to 2y1+5y2>=37, 6y1-7y2>=56, y1,y2>=0 C. Minimize L=5y1+9y2; subject to 2y1+5y2>=56, 6y1-7y2>=37, y1,y2>=0 Minimize L=5y1+9y2; subject to 2y1+5y2>=56, 6y1-7y2>=37, y1,y2>=0 D. Minimize L=37y1+56y2; subject to 2y1+6y2>=5, 5y1-7y2>=9, y1,y2>=0 Minimize L=37y1+56y2; subject to 2y1+6y2>=5, 5y1-7y2>=9, y1,y2>=0

सही उत्तर: A Correct Answer: A

After converting the primal constraints to the appropriate standard sign form, transposing the coefficient matrix gives the dual displayed in option A, which is also the answer marked in the source.

Linear Programming MCQs

Linear Programming MCQs

श्रेणी अनुसार अभ्यास करें

विषय अनुसार अभ्यास करें

टॉपिक अनुसार अभ्यास करें

परीक्षा अनुसार अभ्यास करें