Scribd
Upload
182 views2 pages

STI College Naga Operations Research Midterm Exam: No/Incomplete Solution and Graphs Invalidates Your Answer

This document appears to be a midterm exam for an Operations Research course that covers linear programming topics. The exam contains two sections - (1) a graphical linear programming problem solving section containing 5 problems to choose from, and (2) a 10 question multiple choice section covering linear programming terminology. Students are asked to show their work, identify optimal solutions, and choose the correct multiple choice answer for each question.

Uploaded by

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

STI College Naga Operations Research Midterm Exam: No/Incomplete Solution and Graphs Invalidates Your Answer

This document appears to be a midterm exam for an Operations Research course that covers linear programming topics. The exam contains two sections - (1) a graphical linear programming problem solving section containing 5 problems to choose from, and (2) a 10 question multiple choice section covering linear programming terminology. Students are asked to show their work, identify optimal solutions, and choose the correct multiple choice answer for each question.

Uploaded by

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

STI College Naga

Operations Research

Midterm Exam

Name:_________________________________________________ Score :_________

I. Linear Programming: Graphical Solution. 20 points each. (80 points)

Directions: Choose and solve 4 of the following items. Identify maximum/minimum value or what special type of
solution ;No Optimal, Unbounded or Multiple Solutions.
No/Incomplete solution and graphs invalidates your answer.

1. Maximize P=3x1 + 2x2


Subject to:
6x1 + 4x2 ≤ 24
x1 ≤ 3
x1, x2 ≥ 0

2. Maximize P=3x1 + 5x2


Subject to:
x1≥ 5
x2 ≤ 10
x1 + 2x2 ≥ 10
x1, x2 ≥ 0

3. Maximize P = x1 + 10x2
Subject to:
x1 + 4x2 ≥ 12
x1 - 2x2 ≤ 0
2x2 - x1 ≤ 12
x1 ≤ 6

4. Minimize P = x1 + 10x2
x1 + 4x2 ≥ 12
x1 - 2x2 ≤ 0
2x2 - x1 ≤ 12
x1 ≤ 6

5. Maximize P = 3x1 + 2x2


Subject to
x1+ x2 ≤ 1
x1+ x2 ≥ 3
x1 ≥ 0 , x2 ≥ 0
II. Multiple Choice
Directions: Encircle the letter of the correct answer. 2 points each. (20 points)

1. It is a matrix based method used for solving linear programming problems with many variables
a. Simplex Method c. Simplex Tableau
b. Simplex Equation d. Simplex Flowchart

2. It is a table used to keep track of the calculations made at each iteration when the simplex method is employed
a. Simplex Method c. Simplex Tableau
b. Simplex Equation d. Simplex Flowchart

3. It is the column of the tableau that has the “most negative value” and the “most positive value” element in the
bottom/last row
a. Pivot post c. Axis column
b. Pivot row d. Pivot column

4. It is the column of the tableau that has the “most negative value” (for _________) and the “most positive
value” element in the bottom/last row
a. Minimization c. Acceleration
b. Maximization d. Negation

5. It is the column of the tableau that has the “most negative value” and the “most positive value” (for
_________) element in the bottom/last row
a. Minimization c. Acceleration
b. Maximization d. Negation

6. It corresponds to the variable that will leave the table in order to make room for another variable
a. Pivot post c. Axis column
b. Pivot column d. Pivot row

7. The region where all constraints overlap


a. Feasible District c. Feasible Region
b. Viable Region d. Practical Region

8. A linear programming model that has more than one optimal solution
a. Multiple Optimal Solution c. Redundancy
b. Infeasibility d. Unbounded Solution

9. A linear programming model in which the objective function of a linear programming problem can be made
infinitely large without violating any of the constraints
a. Multiple Optimal Solution c. Redundancy
b. Infeasibility d. Unbounded Solution

10. A linear programming model that arises when a linear programming problem has no feasible solution even
though all constraints are being satisfied
a. Multiple Optimal Solution c. Redundancy
b. Infeasibility d. Unbounded Solution

You might also like