A) Solving equations B) Counting prime numbers C) Generating random numbers D) Minimize or maximize an objective function
A) Limitation on the possible solutions B) The mathematical formula C) The initial guess D) The final result
A) Maximization B) Randomization C) Minimization D) Simplification
A) Simulated annealing B) Guess and check C) Simplex method D) Trial and error
A) The region with the maximum value B) The area outside the constraints C) The solution space D) The set of all feasible solutions
A) A solution with no constraints B) An incorrect solution C) A random solution D) A solution that satisfies all the constraints
A) Selects the best algorithm B) Evaluates the impact of changes in parameters on the solution C) Finds the global optimum D) Generates random solutions
A) A constraint function B) An equation without variables C) Function to be optimized or minimized D) A random mathematical operation
A) Quantitative analysis B) Algorithmic design C) Function maximization D) Mathematical programming
A) Two: discrete optimization and continuous optimization B) Four: combinatorial, stochastic, dynamic, and robust optimization C) One: general optimization D) Three: linear, nonlinear, and integer programming
A) Nonlinear programming B) Continuous optimization C) Linear programming D) Discrete optimization
A) Integer programming B) Combinatorial optimization C) Discrete optimization D) Continuous optimization
A) Linear programming B) Discrete mathematics C) Global optimization D) Local optimization
A) 5 B) 3 C) 1 D) 4
A) x = -1 B) x = 1 C) x = ∞ D) x = 0
A) Yes, it is infinity B) No, it is unbounded C) Yes, it is 2 D) Yes, it is -infinity
A) John von Neumann B) Fermat C) Leonid Kantorovich D) George B. Dantzig
A) 1950 B) 1947 C) 1960 D) 1939
A) Binary variables. B) Discrete variables. C) Continuous variables. D) Semidefinite matrices.
A) Simplifies the problem B) Eliminates trade-offs C) Adds complexity D) Reduces the number of solutions
A) Suboptimal B) Pareto optimal C) Inferior D) Non-efficient
A) The optimization algorithm B) The decision maker C) An external evaluator D) The designer of the system
A) By interactive sessions with the decision maker B) By ignoring less important objectives C) Automatically by the algorithm D) Through historical data analysis
A) Multi-modal optimization B) Global optimization C) The feasibility problem D) The existence problem
A) Feasibility conditions B) Second-order conditions C) The Karush–Kuhn–Tucker conditions D) First-order conditions
A) Line searches. B) Lagrangian relaxation. C) Interior-point methods. D) Trust regions.
A) Positive-negative momentum estimation. B) Lagrangian relaxation. C) Trust regions. D) Line searches.
A) Quantum optimization algorithms B) Ellipsoid method C) Simultaneous perturbation stochastic approximation (SPSA) D) Interior point methods
A) Coordinate descent methods B) Gradient descent C) Quasi-Newton methods D) Simultaneous perturbation stochastic approximation
A) Microeconomics. B) Electrical engineering. C) Engineering, especially aerospace engineering. D) Cosmology and astrophysics.
A) Civil engineering B) Operations research C) Control engineering D) Molecular modeling |