Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Scribd
Upload
37 views

Optimization Techniques

The document contains model questions for 5 units of the course Optimization Techniques. It includes questions related to concepts like continuous functions, vectors, eigen values, optimization problems, algorithms complexity, linear programming, integer programming, machine learning techniques, queuing theory, multi-objective optimization and evolutionary algorithms.

Uploaded by

abhinandanpaul1
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
37 views

Optimization Techniques

The document contains model questions for 5 units of the course Optimization Techniques. It includes questions related to concepts like continuous functions, vectors, eigen values, optimization problems, algorithms complexity, linear programming, integer programming, machine learning techniques, queuing theory, multi-objective optimization and evolutionary algorithms.

Uploaded by

abhinandanpaul1
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 3

Model Questions for the Course Optimization Techniques

Unit-1

1. Define the criteria for a function to be continuous. Explain with suitable examples.
2. Define vector and explain the concept of addition of two vectors.
3. Prove that a + b = b + a in vector calculus, where a and b are two vectors.
4. Explain how to calculate b - a in vector calculus, where a and b are two vectors.
5. Write a short note on Eigen value and give any one application of Eigen value.
6. Define the term optimization problem. Give two examples.
7. Write a short note on the complexity of algorithms.
8. Calculate Big-Oh notation for the following function 5 x2 – 2x + 3
9. What is the need to calculate the time complexity?
10. What is the advantage of theta-notation over Big-Oh notation?

Unit-2

1. Define the term “feasibility” with the help of suitable examples.


2. What is meant by the unbounded solution?
3. Explain the following terms with the help of a suitable example: (i) optimal solution (ii)
constraints (iii) decision variable.
4. What is meant by constraints? Which are the different types of constraints?
5. What are the problems associated with using gradient based method to solve optimization
problems?
6. Explain how to identify three types of local extrema using gradient.
7. Explain the term local optima with the help of a suitable example.
8. Write a short note on any gradient free method to solve optimization problems.
9. Write a short note on BFGS method.
10. Demonstrate the use of slack variable.
11. What is the standard form of a linear programming problem?
12. Explain Nelder-Mead algorithm.
13. Use Nelder-Mead algorithms to minimize f(x) = x2 – 4x + y2 - xy (Show upto 3 iterations).

Unit-3

1. What is meant by integer programming problem? Give a suitable example.


2. Justify why integer linear programming model is suitable for the following problem of
capital-budgeting: “Select the potential investments by choosing among the possible plant
locations and to settle upon a set of research and development projects. The objective is to
maximize total contributions from all the investments without exceeding the limited
availability of certain resources.”
3. What is meant by LP relaxation? What are the advantages of solving the LP relaxation
problem?
4. What are the properties of the LR problem with reference the corresponding IP.
5. Can rounding the solution of LP relaxed problem be a solution to integer LPP? Justify your
answer.
6. Define term over-fitting in the context of regression.
7. Explain how to detect and avoid over-fitting.
8. What is the need for lasso regression?
9. Define logistic regression. Explain a suitable problem where logistic regression could be
applied.
10. Write a short note on principal component analysis.
11. Use the simplex method to solve the following LP problem. (Solve upto 3 iterations)
Maximize Z = 3x1 + 5x2 + 4x3
subject to the constraints
(i) 2x1 + 3x2 ≤ 8, (ii) 2x2 + 5x3 ≤ 10, (iii) 3x1 + 2x2 + 4x3 ≤ 15 and x1, x2, x3 ≥ 0

Unit-4

1. Write a short note on support vector machine.


2. Explain deep learning with some application areas.
3. Write any two applications of queuing theory.
4. Explain the arrival process in queuing model.
5. What are the queue characteristics?
6. State and explain Little’s Law.
7. John owns a small coffee shop. He wants to know the average number of customers queuing
in his coffee shop, to decide whether he needs to add more space to accommodate more
customers. Currently, his queuing area can accommodate no more than eight people. John
measured that, on average, 40 customers arrive at his coffee shop every hour. He also
determined that, on average, a customer spends around 6 minutes in his store (or 0.1
hours). Given these inputs, find the average number of customers queuing in his coffee
shop.
8. In a conference lunch, if each participant needs about 45 seconds to take his/her food and
there are 1000 participants, how many tables should be provided (assume two sides of the
serving tables could be used) so that the lunch break can be finished within one hour?
9. What is meant by multi-objective optimization? Name any one method to solve these type
of problems.
10. Explain Pareto optimality with the help of suitable diagrams and/or examples.

Unit-5

1. Explain the method to convert constrained optimization to unconstrained one. Give a


suitable example.
2. What is the use of penalty functions?
3. Convert into unconstrained form by explaining the steps followed: minimize f(x) = 100/x
subject to x ≤ 5
4. Explain the term quadratic loss based on the constraint x ≤ 5.
5. Explain how to calculate quadratic loss for equality constraints and inequality constraints.
6. Justify the need to multiply the quadratic loss function by a constant while framing the
objective function.
7. Explain the term simulated annealing.
8. Explain the general framework of particle swarm optimization.
9. Write the PSO algorithm and explain its working.
10. Compare genetic algorithm and PSO.
11. Explain fire-fly algorithm.
12. What are the advantages of evolutionary algorithms over gradient based algorithms in
solving optimization problems?

You might also like