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