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