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