PracHub
QuestionsPremiumCoachesLearningGuidesInterview Prep
|Home/Machine Learning/Imc

Solve a constrained problem using KKT conditions

Last updated: Mar 29, 2026

Quick Overview

This question evaluates understanding of constrained optimization using Karush–Kuhn–Tucker (KKT) conditions, including Lagrangian formulation, stationarity, complementary slackness, dual feasibility, and identification of active constraints.

  • medium
  • Imc
  • Machine Learning
  • Data Scientist

Solve a constrained problem using KKT conditions

Company: Imc

Role: Data Scientist

Category: Machine Learning

Difficulty: medium

Interview Round: Onsite

Use Karush–Kuhn–Tucker (KKT) conditions to solve the following constrained optimization problem: Minimize \[ \min_{x,y}\; f(x,y)=x^2+y^2 \] subject to - \(x+y \ge 1\) - \(x \ge 0\) - \(y \ge 0\) Tasks: 1) Write the Lagrangian and KKT conditions (stationarity, primal feasibility, dual feasibility, complementary slackness). 2) Identify which constraints are active at the optimum. 3) Solve for \((x^*,y^*)\) and the optimal value.

Quick Answer: This question evaluates understanding of constrained optimization using Karush–Kuhn–Tucker (KKT) conditions, including Lagrangian formulation, stationarity, complementary slackness, dual feasibility, and identification of active constraints.

Related Interview Questions

  • Choose optimal posted price under adverse selection - Imc (medium)
  • Compute gambler’s ruin probabilities and hitting times - Imc (medium)
  • Run EDA and train models while preventing overfitting - Imc (medium)
  • Explain linear regression and Transformer fundamentals - Imc (medium)
Imc logo
Imc
Jan 14, 2026, 12:00 AM
Data Scientist
Onsite
Machine Learning
1
0
Loading...

Use Karush–Kuhn–Tucker (KKT) conditions to solve the following constrained optimization problem:

Minimize

min⁡x,y  f(x,y)=x2+y2\min_{x,y}\; f(x,y)=x^2+y^2minx,y​f(x,y)=x2+y2

subject to

  • x+y≥1x+y \ge 1x+y≥1
  • x≥0x \ge 0x≥0
  • y≥0y \ge 0y≥0

Tasks:

  1. Write the Lagrangian and KKT conditions (stationarity, primal feasibility, dual feasibility, complementary slackness).
  2. Identify which constraints are active at the optimum.
  3. Solve for (x∗,y∗)(x^*,y^*)(x∗,y∗) and the optimal value.

Solution

Show

Submit Your Answer

Sign in to leave a comment

Loading comments...

Browse More Questions

More Machine Learning•More Imc•More Data Scientist•Imc Data Scientist•Imc Machine Learning•Data Scientist Machine Learning
PracHub

Master your tech interviews with 8,500+ real questions from top companies.

Product

  • Questions
  • Learning Tracks
  • Interview Guides
  • Resources
  • Premium
  • For Universities
  • Student Access

Browse

  • By Company
  • By Role
  • By Category
  • Topic Hubs
  • SQL Questions
  • Compare Platforms
  • Discord Community

Support

  • support@prachub.com
  • (916) 541-4762

Legal

  • Privacy Policy
  • Terms of Service
  • About Us

© 2026 PracHub. All rights reserved.