Mathematics · Economics
Optimization and Mathematical Programming
1,802 Questions
Mathematical programming involves selecting the best element from a set of alternatives based on specific criteria. These concepts are tested in various competitive exams, especially those focusing on decision making and resource allocation. The collection includes problems on linear programming, structural optimization, and computational complexity.
Linear programmingDynamic programmingConvex optimizationInteger programmingStructural optimization methodsMathematical modeling
Optimization and Mathematical Programming Questions
Which of the following is an essential condition in a situation for linear programming to be useful?
-
Linear constraints
-
Bottlenecks in the objective function
-
Non-homogeneity
-
Uncertainty
-
None of the above
A
Correct answer
Explanation
For linear programming, the constraints must be linear.
Choose the most correct of the following statements relating to primal-dual linear programming problems:
-
Shadow prices of resources in the primal are optimal values of the dual variables.
-
The optimal values of the objective functions of primal and dual are the same.
-
If the primal problem has unbounded solution, the dual problem would have infeasibility.
-
All of the above.
D
Correct answer
Explanation
From the primal-dual relationship,
The shadow prices of resources in the primal are optimal values of the dual variables.
If one of the problems has an optimal feasible solution then the other problem also has an optimal feasible solution. The optimal objective function value is same for both primal and dual problems.
If one problem has an unbounded solution then the other problem is infeasible.
To write the dual; it should be ensured that
I. All the primal variables are non-negative.
II. All the bi values are non-negative.
III. All the constraints are $≤$ type if it is maximization problem and $≥$ type if it is a minimization problem.
-
I and II
-
II and III
-
I and III
-
I, II and III
C
Correct answer
Explanation
To write the dual, then all the primal variables must be non-negative.
All the constraints are $\leq$ type if it ia maximization problem and $\geq$ type if it is a minimization problem.
A
Correct answer
Explanation
Different algorithms can achieve the same result, often with varying levels of efficiency, complexity, or resource usage. Choosing between them depends on the specific constraints of the problem.
Which of the following is a metaheuristic algorithm inspired by the behavior of ants?
-
Ant Colony Optimization
-
Particle Swarm Optimization
-
Genetic Algorithm
-
Simulated Annealing
A
Correct answer
Explanation
Ant Colony Optimization (ACO) is a metaheuristic algorithm that takes inspiration from the foraging behavior of ants. It is used to solve optimization problems by simulating the way ants find the shortest path between their nest and a food source.
What is the key idea behind simulated annealing?
-
Randomly searching the solution space
-
Gradually decreasing the temperature of a system
-
Using a population of solutions
-
Applying local search techniques
B
Correct answer
Explanation
Simulated annealing is a metaheuristic algorithm that takes inspiration from the physical process of annealing. It works by gradually decreasing the temperature of a system, allowing it to explore different regions of the solution space and find better solutions.
Which of the following is a nature-inspired algorithm based on the evolution of biological populations?
-
Genetic Algorithm
-
Particle Swarm Optimization
-
Ant Colony Optimization
-
Simulated Annealing
A
Correct answer
Explanation
Genetic Algorithm (GA) is a nature-inspired algorithm that takes inspiration from the process of natural selection. It works by maintaining a population of solutions and applying genetic operators (such as crossover and mutation) to evolve better solutions over time.
What is the main mechanism used by particle swarm optimization (PSO) to search for optimal solutions?
-
Local search techniques
-
Randomly searching the solution space
-
Exploiting historical information
-
Swarm intelligence
D
Correct answer
Explanation
Particle swarm optimization (PSO) is a nature-inspired algorithm that takes inspiration from the collective behavior of bird flocks or fish schools. It works by maintaining a population of particles (potential solutions) and allowing them to interact with each other to find better solutions.
Which of the following is a key component of a genetic algorithm?
-
Fitness function
-
Population size
-
Crossover operator
-
Mutation operator
A
Correct answer
Explanation
The fitness function is a crucial component of a genetic algorithm. It evaluates the quality of each solution in the population and guides the selection process. The fitness function helps the algorithm identify better solutions and direct its search towards promising regions of the solution space.
What is the primary mechanism used by simulated annealing to escape local optima?
-
Randomly restarting the search
-
Increasing the temperature of the system
-
Applying local search techniques
-
Using a population of solutions
B
Correct answer
Explanation
Simulated annealing uses a temperature parameter to control the acceptance of worse solutions. By gradually increasing the temperature, the algorithm allows the system to explore a wider range of solutions and escape from local optima. As the temperature decreases, the algorithm becomes more focused on finding better solutions.
Which of the following is a key concept in ant colony optimization (ACO)?
-
Pheromone trails
-
Stigmergy
-
Local search techniques
-
Population diversity
A
Correct answer
Explanation
Pheromone trails are a fundamental concept in ant colony optimization (ACO). Ants deposit pheromones on the paths they take, creating a chemical trail that guides other ants towards food sources. This behavior is known as stigmergy, where the actions of individual ants collectively influence the behavior of the colony.
What is the main mechanism used by particle swarm optimization (PSO) to update the velocity of particles?
-
Local search techniques
-
Randomly selecting new velocities
-
Exploiting historical information
-
Using a global best position
D
Correct answer
Explanation
Particle swarm optimization (PSO) updates the velocity of particles based on their own best position and the global best position found so far. This allows particles to move towards promising regions of the solution space and explore different areas of the search space.
What is the primary goal of a metaheuristic algorithm?
-
Finding the optimal solution
-
Approximating the optimal solution
-
Exploring the entire solution space
-
Generating a diverse set of solutions
B
Correct answer
Explanation
Metaheuristic algorithms are designed to find approximate solutions to complex optimization problems where finding the optimal solution is computationally intractable. They aim to provide good-quality solutions within a reasonable amount of time, rather than guaranteeing the optimal solution.
Which of the following is a key component of a particle swarm optimization (PSO) algorithm?
-
Velocity update equation
-
Fitness function
-
Population size
-
Crossover operator
A
Correct answer
Explanation
The velocity update equation is a crucial component of a particle swarm optimization (PSO) algorithm. It determines how the velocity of each particle is updated based on its own best position and the global best position found so far. This equation guides the movement of particles in the search space and helps them converge towards promising regions.
What is the main purpose of mutation in genetic algorithms?
-
Introducing new genetic material
-
Exploiting historical information
-
Maintaining population diversity
-
Improving the convergence speed
A
Correct answer
Explanation
Mutation is a genetic operator used in genetic algorithms to introduce new genetic material into the population. It helps maintain population diversity and prevents the algorithm from getting stuck in local optima. Mutation allows the algorithm to explore different regions of the search space and potentially find better solutions.