Scribd
Upload
5 views

Linear Programming Quiz

The document contains a quiz on Linear Programming (LP) and the Simplex Method, featuring multiple choice and short answer questions that assess understanding of key concepts such as goals, assumptions, feasible regions, and sensitivity analysis. It also includes a practical problem-solving question related to maximizing an objective function subject to constraints. The quiz is designed to evaluate knowledge of fundamental Operations Research principles and the application of the Simplex Method.

Uploaded by

Selma (Student) Khelili
Copyright
© © All Rights Reserved
Available Formats
Download as TXT, PDF, TXT or read online on Scribd
5 views

Linear Programming Quiz

The document contains a quiz on Linear Programming (LP) and the Simplex Method, featuring multiple choice and short answer questions that assess understanding of key concepts such as goals, assumptions, feasible regions, and sensitivity analysis. It also includes a practical problem-solving question related to maximizing an objective function subject to constraints. The quiz is designed to evaluate knowledge of fundamental Operations Research principles and the application of the Simplex Method.

Uploaded by

Selma (Student) Khelili
Copyright
© © All Rights Reserved
Available Formats
Download as TXT, PDF, TXT or read online on Scribd
You are on page 1/ 4

Linear Programming Quiz

Multiple Choice Questions:

What is the primary goal of Linear Programming (LP)?

a) To minimize costs
b) To maximize profits
c) To optimize resource allocation
d) All of the above
Which of the following is NOT a core assumption of Linear Programming?

a) Proportionality
b) Additivity
c) Divisibility
d) Uncertainty
What is the feasible region in a Linear Programming problem?

a) The set of all possible solutions


b) The set of solutions that satisfy all constraints
c) The set of solutions that maximize the objective function
d) The set of solutions that minimize the objective function
What is the significance of corner points in a Linear Programming problem?

a) They represent infeasible solutions


b) They represent optimal solutions
c) They are points where constraints intersect
d) They are points where the objective function is minimized
What is the impact of an infeasible Linear Programming problem?

a) There is no solution that satisfies all constraints


b) There are multiple optimal solutions
c) The objective function is unbounded
d) The problem is too complex to solve

Multiple Choice Questions:

What is the primary goal of the Simplex Method?

a) To find the feasible region of an LP problem


b) To identify the optimal solution of an LP problem
c) To convert an LP problem into standard form
d) To determine the number of basic and non-basic variables
Which of the following is NOT a special case in Linear Programming?

a) Unboundedness
b) Infeasibility
c) Optimality
d) Degeneracy
What is the significance of the minimum ratio test in the Simplex Method?

a) To determine the entering variable


b) To determine the leaving variable
c) To check for optimality
d) To convert the LP problem into standard form
What is a basic feasible solution (BFS)?

a) A solution that satisfies all constraints


b) A solution that is not feasible
c) A solution that is optimal
d) A solution that corresponds to a corner point of the feasible region
How can we identify an unbounded LP problem using the Simplex Method?

a) When all reduced costs are negative


b) When all reduced costs are positive
c) When a pivot column cannot be found
d) When the minimum ratio test fails

Multiple Choice Questions:

What is the primary purpose of the two-phase method in linear programming?

a) To find an initial feasible solution


b) To solve a degenerate LP problem
c) To handle unbounded LP problems
d) To find alternative optimal solutions
What is the significance of degeneracy in linear programming?

a) It leads to multiple optimal solutions


b) It can cause the Simplex method to cycle
c) It indicates an infeasible problem
d) It indicates an unbounded problem
What is sensitivity analysis in linear programming?

a) Analyzing the sensitivity of the optimal solution to changes in the objective


function coefficients
b) Analyzing the sensitivity of the optimal solution to changes in the right-hand
side values of constraints
c) Both a and b
d) None of the above
What is the dual price of a resource?

a) The rate of change of the objective function per unit increase in the resource
b) The cost of acquiring an additional unit of the resource
c) The shadow price of the resource
d) All of the above
What is the purpose of artificial variables in linear programming?

a) To convert inequality constraints to equality constraints


b) To find an initial basic feasible solution
c) To handle unbounded problems
d) To handle degenerate problems
Short Answer Questions:

Explain the concept of cycling in the Simplex method and how it can be avoided.
Describe the two-phase method for solving linear programming problems.
What is the significance of sensitivity analysis in decision-making?
How can you determine the range of optimality for an objective function
coefficient?
You can also consider adding a practical problem-solving question, where students
are asked to solve a linear programming problem using the Simplex method and
perform sensitivity analysis.

For example:

Consider the following LP problem:

Maximize Z = 3x1 + 2x2


Subject to:
2x1 + x2 <= 4
x1 + 2x2 <= 5
x1, x2 >= 0

Difficulty and Content of the Quiz


The quiz you provided seems to be of medium difficulty, covering fundamental
concepts of Operations Research (OR) and the Simplex Method. The content aligns
well with what you might expect from introductory lectures on these topics.

New Quiz (Multiple Choice)


Here's a new quiz similar to the old one, with answers:

1. Which of the following conditions in the simplex method can be used to identify
a degenerate Linear Programming (LP) problem?

a) The coefficients of the objective function. (Incorrect)


b) The coefficients of the pivot column having a zero value in the row
corresponding to the basic feasible solution. (Correct)
c) The right-hand side (RHS) of constraints. (Incorrect)
d) By applying the two-phase method. (Incorrect)
2. The range of feasibility measures the range of values for an objective function
coefficient where the optimal solution remains the same. True or False?

True (This allows you to analyze the sensitivity of the solution to changes in the
objective function.)
3. What is Operations Research (OR)?

a) A field of study that uses statistical methods to analyze data. (Incorrect)


b) A branch of mathematics that studies the properties of shapes and spaces.
(Incorrect)
c) A branch of science that studies the composition, structure, and properties of
matter and the changes it undergoes. (Incorrect)
d) An interdisciplinary field of study that uses mathematical models to analyze
complex decision-making problems in organizations. (Correct)
4. If there are n positive decision variables and m constraints, which expression
accurately represents the total number of variables present in the simplex table?

a) m (Incorrect)
b) n * m (Incorrect)
c) n (Incorrect)
d) n + m (Correct)
Here are the answers to the old quiz:

Question Answer
1 b) By applying the two-phase method.
2 d) Each of these choices are true.
3 d) An interdisciplinary field of study that uses mathematical models to
analyze complex decision-making problems in organizations.
4 d) n + m
5
6 The model should be simple enough to be understood, yet capture the most
critical aspects of the problem.
7 None of the above.
8 When encountering a degenerate Linear Programming (LP) problem, it implies:
Cycling can occur.
9 The coefficients of the objective function
10 Data collection, problem formulation, model development, implementation, and
results analysis.
11 Applicable only if the other coefficients of the objective function are
fixed.
12 The final corner point evaluated is the optimal one.
13 No option is correct
14 Optimizing the seating arrangement at a party to maximize the overall
happiness, where happiness depends on the compatibility of neighboring guests.
15 By applying the two-phase method.
16 No option is correct
17 All models are approximations of reality, but some can be useful in guiding
decision-making processes.
18 False
19 n + m
20 We solve the system of constraints.

You might also like