Scribd
Upload
11 views4 pages

Chapter Three - MCQ2

The document contains a series of questions related to linear programming and the Simplex method, covering topics such as methods for solving problems, the role of slack variables, and conditions for determining optimal solutions. It includes multiple-choice questions that test knowledge on converting inequalities, identifying entering and leaving variables, and understanding the implications of redundant constraints. Additionally, it references a specific example involving the Reddy Mikks Company and its daily profit.

Uploaded by

mayadanasr996
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
11 views4 pages

Chapter Three - MCQ2

The document contains a series of questions related to linear programming and the Simplex method, covering topics such as methods for solving problems, the role of slack variables, and conditions for determining optimal solutions. It includes multiple-choice questions that test knowledge on converting inequalities, identifying entering and leaving variables, and understanding the implications of redundant constraints. Additionally, it references a specific example involving the Reddy Mikks Company and its daily profit.

Uploaded by

mayadanasr996
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 4

1.

What is the primary method used for solving linear programming problems

with a large number of variables?

(A) Gauss-Jordan method

(B) Optimal variable method

(C) Redundant constraints method

(D) Simplex Method

2. Which type of problem is solved by the Simplex method?

(A) Minimum value of decision variables

(B) Unbounded Solutions

(C) Minimum or maximum value of the objective function

(D) Maximum value of constraints

3. In the canonical form, what are 'Cj'?

(A) Non-negative slack variables

(B) Coefficients of the objective function

(C) Decision variables

(D) Coefficients of constraints

4. What is added to the left-hand side of a constraint to convert a '≤' inequality

to an equation in the standard form?

(A) Pivot element

(B) Basic variable

(C) Non-negative slack variable

(D) Surplus variable

Created by @XeeBot
5. How is a '≥' inequality converted to an equation in the standard form?

(A) Subtracting a surplus variable

(B) Subtracting a slack variable

(C) Adding a surplus variable

(D) Adding a slack variable

6. What is the role of slack variables in converting the linear programming

problem to standard form?

(A) To identify pivot columns

(B) To find redundant constraints

(C) To determine the optimal solution

(D) To convert inequalities to equations

7. In the context of the Simplex method, what does the entering variable

correspond to?

(A) The highest positive coefficient in the z-row

(B) The pivot column coefficient

(C) The lowest negative coefficient in the z-row for a maximization problem

(D) The basic variable associated with the smallest nonnegative ratio

Created by @XeeBot
8. Which row operation is used to replace the leaving variable in the Basic

column with the entering variable?

(A) Gauss-Jordan row operation

(B) Pivot row operation

(C) Row elimination

(D) Standard equation operation

9. When can the optimal solution be determined according to the Simplex

method?

(A) When all coefficients Cj are greater than or equal to zero

(B) When the decision variables are maximized

(C) When all slack variables are zero

(D) When the feasibility condition is met

10. In the example of the Reddy Mikks Company, what is the daily profit

indicated by the optimal solution?

(A) $31,000

(B) $21,000

(C) $10,000

(D) $8,000

Created by @XeeBot
11. What type of solution occurs if the model has redundant constraints

according to the Simplex method?

(A) Infeasible Solutions

(B) Unbounded Solution

(C) Degenerate Solution

(D) Multiple Solutions

12. What indicates a redundant constraint in the Simplex Method?

(A) Smallest nonnegative ratio

(B) Presence of basic variables equal to zero

(C) At least one redundant constraint in the model

(D) Equal ratios for the minimum ratio

Created by @XeeBot

You might also like