TRB PG Assistant - Nonlinear programming - convex programming problems Online Test (MCQ Quiz)

1. What is the primary characteristic of a convex programming problem?

A) The objective function is concave, and the feasible region is convex. B) The objective function is convex, and the feasible region is convex. C) The objective function is linear, and the feasible region is convex. D) The objective function is concave, and the feasible region is non-convex.

2. In a convex programming problem, if a local minimum exists, what can be said about it?

A) It is also a global minimum. B) It may or may not be a global minimum. C) It is always a saddle point. D) It is only guaranteed to be a global minimum if the objective function is strictly convex.

3. Which of the following conditions defines a convex set?

A) For any two points in the set, the line segment connecting them lies entirely outside the set. B) For any two points in the set, the line segment connecting them lies entirely within the set. C) The set contains only a single point. D) The set is unbounded.

4. Consider a function f(x). If its Hessian matrix is positive semi-definite for all x in its domain, what type of function is f(x)?

A) Concave function B) Convex function C) Linear function D) Quasi-convex function

5. What is the relationship between a convex function and its epigraph?

A) The epigraph is a convex set. B) The epigraph is a non-convex set. C) The epigraph is always empty. D) The epigraph is a hyperplane.

6. Which theorem states that for a convex programming problem, any local optimum is also a global optimum?

A) Kuhn-Tucker Theorem B) Lagrange Multiplier Theorem C) Convexity Theorem D) Fundamental Theorem of Convex Optimization

7. What is the role of the Karush-Kuhn-Tucker (KKT) conditions in nonlinear programming?

A) They provide necessary and sufficient conditions for optimality in general nonlinear programming. B) They provide necessary conditions for optimality in general nonlinear programming and sufficient conditions for convex programming. C) They are only applicable to linear programming problems. D) They guarantee the existence of a feasible solution.

8. For a convex programming problem with inequality constraints g_i(x) <= 0, what property must the constraint functions g_i(x) possess?

A) They must be convex functions. B) They must be concave functions. C) They must be linear functions. D) They can be any differentiable function.

9. What does it mean for a function to be quasi-convex?

A) Its level sets are convex. B) Its objective value decreases as you move away from the optimum. C) It has a unique global minimum. D) Its Hessian matrix is negative semi-definite.

10. Which of the following is NOT a standard method for solving convex programming problems?

A) Gradient Descent B) Newton's Method C) Simplex Method D) Interior-Point Methods

11. In the context of convex programming, what is the significance of the Slater's condition?

A) It ensures the objective function is convex. B) It ensures the feasible region is convex. C) It guarantees that the KKT conditions are sufficient for optimality. D) It guarantees the existence of a unique solution.

12. Consider a convex optimization problem min f(x) subject to Ax = b. If f(x) is strictly convex, what is the nature of the solution?

A) There may be multiple optimal solutions. B) The optimal solution, if it exists, is unique. C) There is no optimal solution. D) The solution is unbounded.

13. What property must the objective function f(x) possess for the problem 'maximize f(x) subject to a convex feasible region' to be a convex programming problem?

A) f(x) must be convex. B) f(x) must be concave. C) f(x) must be linear. D) f(x) must be unimodal.

14. Which of the following is an example of a convex set?

A) A circle B) The union of two disjoint circles C) A set containing only the origin D) The boundary of a square

15. If a function is differentiable and its gradient is non-decreasing, what can be said about the function?

A) It is concave. B) It is convex. C) It is linear. D) It is neither convex nor concave.

16. What is the dual problem in convex optimization?

A) A problem that is always equivalent to the primal problem. B) A problem derived from the primal problem whose solution provides a lower bound on the optimal value of the primal problem. C) A problem that is always harder to solve than the primal problem. D) A problem that only exists for linear programming.

17. For a convex programming problem, the set of optimal solutions is always:

A) A single point B) A convex set C) An empty set D) A line segment

18. What is the main advantage of solving a convex programming problem compared to a general nonlinear programming problem?

A) It is always faster to solve. B) Local optima are guaranteed to be global optima. C) It requires fewer constraints. D) The solution is always an integer.

19. Which of the following functions is NOT convex?

A) f(x) = x^2 B) f(x) = e^x C) f(x) = -x^2 D) f(x) = |x|

20. What is the purpose of the Lagrange multiplier in the KKT conditions for convex programming?

A) To relax the equality constraints. B) To penalize constraint violations. C) To incorporate inequality constraints into the objective function. D) To ensure the objective function is convex.

21. Consider the problem: minimize f(x) subject to x in C, where f is convex and C is a convex set. If the problem has a feasible solution, what is true about the set of optimal solutions?

A) It is empty. B) It is non-convex. C) It is convex. D) It is a single point.

22. What is the property of a function f such that for any x1, x2 and lambda in [0,1], f(lambda*x1 + (1-lambda)*x2) <= max(f(x1), f(x2))?

A) Convex B) Concave C) Quasi-convex D) Quasi-concave

23. Which method uses the second-order information (Hessian matrix) to find the minimum of a convex function?

A) Gradient Descent B) Steepest Descent C) Newton's Method D) Coordinate Descent

24. If the feasible region of an optimization problem is non-convex, what challenge arises for convex optimization techniques?

A) Local optima are guaranteed to be global optima. B) Convex optimization techniques are not applicable. C) Finding a local optimum does not guarantee finding a global optimum. D) The problem becomes linear.

25. What is the significance of the term 'programming' in 'convex programming'?

A) It refers to computer programming. B) It refers to the planning or scheduling aspect of decision-making. C) It refers to the graphical representation of the problem. D) It implies the problem must have an integer solution.

26. Consider a convex function f(x). The set {x | f(x) <= c} for a constant c is:

A) Always non-convex B) Always convex C) Sometimes convex, sometimes non-convex D) A hyperplane

27. Which condition is crucial for the applicability of KKT conditions as sufficient optimality conditions in nonlinear programming?

A) The objective function must be linear. B) The feasible region must be convex and the objective function must be convex (for minimization) and constraints must satisfy certain regularity conditions. C) All constraints must be active at the optimum. D) The problem must have only equality constraints.

28. What is the relationship between convex functions and their first derivatives?

A) The first derivative is always zero. B) The first derivative is non-decreasing. C) The first derivative is non-increasing. D) The first derivative is constant.

29. Which of the following is a common application of convex programming?

A) Portfolio optimization B) Traveling Salesperson Problem C) Integer Linear Programming D) Game Theory (non-cooperative)

30. If we are minimizing a convex function over a convex set, and we find a point x* where the gradient is zero (or satisfies KKT conditions for equality constraints), what can we conclude?

A) x* is a local maximum. B) x* is a local minimum, and if the function is strictly convex, it's a global minimum. C) x* is a saddle point. D) x* is not necessarily optimal.

31. What does the term 'non-linear' in 'non-linear programming' refer to?

A) The constraints must be non-linear. B) The objective function or at least one constraint is non-linear. C) The solution must be non-linear. D) The problem must not have a feasible region.

32. Which concept is closely related to convex functions and involves the property that the set of points where the function's value is less than or equal to a constant is a convex set?

A) Concavity B) Linearity C) Quasi-convexity D) Unimodality

33. What is the primary goal of convex programming?

A) To find any feasible solution. B) To find a local optimum that is guaranteed to be a global optimum. C) To minimize the number of constraints. D) To ensure all variables are integers.

34. If f(x) is a convex function and g(x) is a concave function, then f(x) - g(x) is:

A) Convex B) Concave C) Neither convex nor concave D) Linear

35. What is the geometric interpretation of a convex set?

A) A set with a curved boundary. B) A set where the line segment connecting any two points in the set is also entirely within the set. C) A set that contains only straight lines. D) A set that is bounded in all directions.

36. Which of the following is a necessary condition for a point x* to be a minimum of a differentiable convex function f(x) over a convex set C?

A) The gradient of f at x* must be zero. B) The gradient of f at x* must be orthogonal to any feasible direction at x*. C) The Hessian of f at x* must be positive definite. D) The function f must be strictly convex.

37. What is the relationship between the primal and dual problems in convex optimization when strong duality holds?

A) The optimal value of the dual is always greater than the optimal value of the primal. B) The optimal value of the dual is always less than the optimal value of the primal. C) The optimal values are equal. D) The dual problem is always infeasible.

38. Consider the problem: minimize f(x) subject to h(x) = 0, where f is convex and h is affine (linear). What is the nature of the solution set?

A) The solution set is always empty. B) The solution set is always a single point. C) The solution set is convex. D) The solution set is non-convex.

39. Which property must a function f satisfy for the problem 'minimize f(x) subject to a convex feasible region' to be a convex programming problem?

A) f(x) must be concave. B) f(x) must be convex. C) f(x) must be linear. D) f(x) must be unimodal.

40. What is the definition of a strictly convex function?

A) For any distinct x1, x2 and lambda in (0,1), f(lambda*x1 + (1-lambda)*x2) < lambda*f(x1) + (1-lambda)*f(x2). B) For any distinct x1, x2 and lambda in (0,1), f(lambda*x1 + (1-lambda)*x2) <= lambda*f(x1) + (1-lambda)*f(x2). C) The Hessian matrix is positive definite. D) The function has a unique minimum.

41. Which of the following is an example of a non-convex set?

A) A line segment B) A filled square C) The region between two concentric circles (an annulus) D) The union of two disjoint line segments

42. What is the role of the 'complementary slackness' condition in KKT optimality conditions?

A) It ensures that if a constraint is inactive, its corresponding Lagrange multiplier is zero. B) It ensures that if a Lagrange multiplier is positive, the constraint must be active. C) It relates the objective function value to the constraint values. D) It guarantees feasibility.

43. If f(x) is convex and g(x) is convex, what can be said about f(g(x))?

A) It is always convex. B) It is always concave. C) It is convex if g(x) is non-decreasing. D) It is convex if f(x) is non-decreasing.

44. Which type of problem is NOT typically classified under convex programming?

A) Quadratic Programming with a positive definite quadratic term B) Linear Programming C) Integer Programming D) Second-Order Cone Programming

45. What is the characteristic of the feasible region in a convex programming problem?

A) It must be a single point. B) It must be a convex set. C) It must be a linear subspace. D) It must be unbounded.

46. Consider the optimization problem: minimize f(x) subject to g_i(x) <= 0 for i=1,...,m and h_j(x) = 0 for j=1,...,p. For this to be a convex programming problem, which of the following must be true?

A) f(x) is convex, g_i(x) are convex, and h_j(x) are convex. B) f(x) is convex, g_i(x) are convex, and h_j(x) are affine (linear). C) f(x) is concave, g_i(x) are concave, and h_j(x) are affine. D) f(x) is linear, g_i(x) are linear, and h_j(x) are linear.

47. What is the condition for a set to be a convex cone?

A) It is a convex set, and if x is in the set, then alpha*x is in the set for all alpha > 0. B) It is a convex set, and if x is in the set, then alpha*x is in the set for all alpha < 0. C) It is a convex set, and if x and y are in the set, then x+y is in the set. D) It is a convex set and contains the origin.

48. Which of the following optimization algorithms is most suitable for large-scale convex problems due to its efficiency in terms of iterations?

A) Simulated Annealing B) Genetic Algorithms C) Interior-Point Methods D) Random Search

49. If a convex programming problem has an unbounded feasible region, what can be concluded about its optimal solution?

A) An optimal solution always exists and is unique. B) The objective function value may be unbounded below, or an optimal solution may exist. C) An optimal solution never exists. D) The problem is always infeasible.

Nonlinear programming - convex programming problems - Online Test

Test Results