Optimization Methodologies

Define surplus variable.

• It is a variable that is subtracted from a constraint to turn the equality constraint into an equation

• It is a variable that is subtracted from a constraint to turn the inequality into an equation

• It is a variable that is added to a constraint to turn the equality constraint into an equation

• It is a variable that is added to a constraint to turn the inequality into an equation

Name the method which is used to solve Linear Programming Problems (LPP) that have two or more decision variables.

• Graphical method

• Johnson method

• Simplex method

• Hungarian Method

Identify the optimal solution to the stochastic optimization problems.

• The optimal solution changes frequently

• The optimal solution is fixed

• The optimal solution does not exist

• The optimal solution is 0

Apply a graphical method to find the coordinates of corner points of the common region for the following system of linear inequations.

3x+2y≤180, x+2y≤120, where x, y≥0

• (0,0), (0,60), (60,0), (30,45)

•  (45,50), (0,60), (60,0), (30,45)

• (03,20), (0,60), (60,0), (30,45)

• (5,5), (0,60), (60,0), (30,45)

Which of the following is the objective of the transportation problem?

• Maximizing the supply of goods

• Minimizing the transportation cost

• Minimizing the number of transportation vehicles

• Maximizing the transportation speed

The assignment problem can be formulated as a special case of the transportation problem. What is the key distinction between the two problems?

• In the assignment problem, the number of workers and jobs are equal, while in the transportation problem, the supply and demand are not necessarily equal.

• The assignment problem minimizes the total cost of transportation, while the transportation problem maximizes profit.

• In the assignment problem, there is only one source and one destination, while in the transportation problem, multiple sources and destinations exist.

• The assignment problem uses linear programming techniques, while the transportation problem uses integer programming.

In Golden Section Method, value of the golden ratio is ___________.

___________ is a type of mathematical optimization problem where the objective function is quadratic and the constraints are linear.

• Quadratic programming

• Integer programming

• NLPP

• LPP

Which of the following equations represents Little's Law for this queuing system?

• L=λ×W

• L=μ×W

• L=λ×Wq​

• W=λ×μ

A person who leaves the queue by losing his patience to wait is said to be ___________.

• Reneging

• Balking

• Jockeying

• Collusion