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