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