TRB PG Assistant - Nonlinear programming - convex programming problems One Line Questions & Answers

1. Which of the following is an example of a convex set? — A circle

2. Which of the following is an example of a non-convex set? — The union of two disjoint line segments

3. What is the dual problem in convex optimization? — A problem derived from the primal problem whose solution provides a lower bound on the optimal value of the primal problem.

4. What is the geometric interpretation of a convex set? — A set where the line segment connecting any two points in the set is also entirely within the set.

5. For a convex programming problem, the set of optimal solutions is always: — A convex set

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

7. If a convex programming problem has an unbounded feasible region, what can be concluded about its optimal solution? — The objective function value may be unbounded below, or an optimal solution may exist.

8. 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)? — Convex function

9. 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? — Quasi-convexity

10. 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))? — Quasi-convex

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

12. Which of the following functions is NOT convex? — f(x) = -x^2

13. 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? — f(x) is convex, g_i(x) are convex, and h_j(x) are affine (linear).

14. 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? — f(x) must be convex.

15. 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? — f(x) must be concave.

16. What is the definition of a strictly convex function? — For any distinct x1, x2 and lambda in (0,1), f(lambda*x1 + (1-lambda)*x2) < lambda*f(x1) + (1-lambda)*f(x2).

17. Which of the following conditions defines a convex set? — For any two points in the set, the line segment connecting them lies entirely within the set.

18. Which of the following is NOT a standard method for solving convex programming problems? — Simplex Method

19. Which method uses the second-order information (Hessian matrix) to find the minimum of a convex function? — Newton's Method

20. What is the role of the 'complementary slackness' condition in KKT optimality conditions? — It ensures that if a constraint is inactive, its corresponding Lagrange multiplier is zero.

21. In the context of convex programming, what is the significance of the Slater's condition? — It guarantees that the KKT conditions are sufficient for optimality.

22. What is the condition for a set to be a convex cone? — It is a convex set, and if x is in the set, then alpha*x is in the set for all alpha > 0.

23. In a convex programming problem, if a local minimum exists, what can be said about it? — It is also a global minimum.

24. If f(x) is convex and g(x) is convex, what can be said about f(g(x))? — It is convex if f(x) is non-decreasing.

25. What is the main advantage of solving a convex programming problem compared to a general nonlinear programming problem? — Local optima are guaranteed to be global optima.

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

27. 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? — It is convex.

28. What is the characteristic of the feasible region in a convex programming problem? — It must be a convex set.

29. What is the significance of the term 'programming' in 'convex programming'? — It refers to the planning or scheduling aspect of decision-making.

30. What does it mean for a function to be quasi-convex? — Its level sets are convex.

31. Which theorem states that for a convex programming problem, any local optimum is also a global optimum? — Fundamental Theorem of Convex Optimization

32. If the feasible region of an optimization problem is non-convex, what challenge arises for convex optimization techniques? — Finding a local optimum does not guarantee finding a global optimum.

33. Which of the following is a common application of convex programming? — Portfolio optimization

34. Which type of problem is NOT typically classified under convex programming? — Integer Programming

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

36. What does the term 'non-linear' in 'non-linear programming' refer to? — The objective function or at least one constraint is non-linear.

37. What is the relationship between a convex function and its epigraph? — The epigraph is a convex set.

38. What is the relationship between convex functions and their first derivatives? — The first derivative is non-decreasing.

39. 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? — The gradient of f at x* must be orthogonal to any feasible direction at x*.

40. What is the primary characteristic of a convex programming problem? — The objective function is convex, and the feasible region is convex.

41. Which condition is crucial for the applicability of KKT conditions as sufficient optimality conditions in nonlinear programming? — The feasible region must be convex and the objective function must be convex (for minimization) and constraints must satisfy certain regularity conditions.

42. What is the relationship between the primal and dual problems in convex optimization when strong duality holds? — The optimal values are equal.

43. 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? — The solution set is convex.

44. 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? — The optimal solution, if it exists, is unique.

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

46. What is the role of the Karush-Kuhn-Tucker (KKT) conditions in nonlinear programming? — They provide necessary conditions for optimality in general nonlinear programming and sufficient conditions for convex programming.

47. What is the primary goal of convex programming? — To find a local optimum that is guaranteed to be a global optimum.

48. What is the purpose of the Lagrange multiplier in the KKT conditions for convex programming? — To incorporate inequality constraints into the objective function.

49. 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? — x* is a local minimum, and if the function is strictly convex, it's a global minimum.

Nonlinear programming - convex programming problems - One Line Questions