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