Which of the following statements is false about convex minimization problem ?
Pick an option to check yourself, or open the answer below.
Show answer & explanation
Correct answer: C. The set of all global minima is concave set
Explanation
For convex problems a local minimum is global, the set of minima is convex (not concave), and a strictly convex function has at most one minimum.
More Discrete Structures and Optimization questions
- The following LPP: Maximize z = 100x₁ + 2x₂ + 5x₃ subject to 14x₁ + x₂ − 6x₃ + 3x₄ = 7, 32x₁ + x₂ − 12x₃ ≤ 10, 3x₁ − x₂ − x₃ ≤ 0, x₁, x₂, x…
- Digital data from a sensor can fill 0 to 32 buffers. Let the sample space be S = {0, 1, 2, …, 32}, where j means j buffers are full, and p(…
- The equivalence of ¬∃x Q(x) is
- If Aᵢ = {−i, …, −2, −1, 0, 1, 2, …, i}, then ⋃ᵢ₌₁^∞ Aᵢ is
- Match the following in List - I and List - II, for a function f :
- Which of the relations on {0, 1, 2, 3} is an equivalence relation ?