Ie 335 Fall 2020 Quiz 1 O4

Download as docx, pdf, or txt
Download as docx, pdf, or txt
You are on page 1of 3

Department of Industrial Engineering

Academic Year: 2020/2021 Semester: Fall


Date: 30/11/2020 Version … A…
Course Information
IE335-Operations research
Course Code: Section: O4
optimization
Instructor Name: Dr. Denis Veliu

Earned Mark
Students Information
Student 1: Name: ………………………………….. ID: …………………..

Assignment Information / 100


Assignment Type: QUIZ 1 2.5%
List of covered course outcome in this assignment:
Due date:
30/11/2020 (30
1. Model a system, component, or process mathematically to find an optimal solution for a given
problem. (SO: 1) minutes)
Number of Questions:
2. Identify, 10
formulate, and solve linear programming models. (SO: 1)
6. Apply the gained knowledge in a real life system and communicate the results orally and in
Number writing.
of Pages:(SO: 2, 3, 5, 6, 7) 4

1. In graphical representation the bounded region is known as __________ region.

a) Solution
b) basic solution
c) feasible solution
d) optimal

2.  What is the objective function in linear programming problems?


a) A constraint for available resource
b) An objective for research and development of a company
c) A linear function in an optimization problem
d) A set of non-negativity conditions

3. The objective function for a maximization problem is given by


z = 2 x1 - 5 x2 + 3 x3
An optimal solution can be reached in:

a) d(2,-5,3)
b) d(-2,5,-3)
c) d(2,5,3)
d) d(-2,-5,-3)

4. While solving a linear programming problem infeasibility may be removed by


______________.

a) adding another constraint


b) adding another variable
c) removing a constraint
d) removing a variable

5.  Linear Programming Problem is a technique of finding the ______________.

a) optimal value
b) approximate value
c) initial value
d) infeasible value

6. Any solution to a Linear Programming Problem which also satisfies the non-
negative notifications of the problem has ______________.

a) solution
b) basic solution
c) basic feasible solution
d) feasible solution

7. Graphical method of linear programming is useful when the number of decision


variable are ______________.

Page | 2
a) 1
b) 2
c) 4
d) 5

8. In graphical method the restriction on number of constraint is __________.

a) 2
b) not more than 3
c) 3
d) none of the above

9. In linear programming the condition to be satisfied is

a) Constraints have to be linear


b) Objective function has to be linear
c) none of the above
d) both a and b

10. Which of the following is not the phase of OR methodology?

a) Formulating a problem
b) Constructing a model
c) Finding all feasible solutions
d) Controlling the environment

QUIZ ANSWER SHEET


Write one of answer choice (A, B, C, D) in the below box for related question
Question No 1 2 3 4 5 6 7 8 9 10
Choice

Page | 3

You might also like