Program Overview

Electrical Engineering Program at Indian Institute of Technology Bombay

The Indian Institute of Technology Bombay (IIT Bombay) was established in 1957, and the Department of Electrical Engineering (EE) has been one of its major departments since its inception.

About the Department

• The department offers various programs, including PhD, MTech, Dual Degree, and BTech.
• The department has a strong research focus, with areas of research including:
  • Communication and Signal Processing
  • Control and Computing
  • Power Electronics and Power Systems
  • Electronic Systems
  • Integrated Circuit and Systems
  • Solid State Devices

Academics

• The department offers a range of courses, including:
  • PhD
  • MTech
  • Dual Degree
  • BTech
• The department has a number of teaching labs, including:
  • Wadhwani Lab
  • TI DSP Lab
• The department also offers a range of co-curricular activities.

Admissions

• The department offers admission to PhD, Postgraduation, and Undergraduation programs.
• The admission criteria and process are available on the department's website.

Research

• The department has a strong research focus, with a number of research areas, including:
  • Communication and Signal Processing
  • Control and Computing
  • Power Electronics and Power Systems
  • Electronic Systems
  • Integrated Circuit and Systems
  • Solid State Devices
• The department has a number of research facilities and equipment.

People

• The department has a number of faculty members, including:
  • Faculty
  • Post Doc
  • Students
  • Staff
• The department also has a number of committees, including:
  • Committees

Engage

• The department offers a range of engagement opportunities, including:
  • Contribute
  • Alumni
  • Collaborate
  • Consult
  • Faculty Hiring
  • Post-Doc Hiring
  • Seek Training
  • Staff Hiring

EE 732 - Combinatorial Optimization

Course Description

• Pre-requisite: EE635 Applied Linear Algebra or equivalent; Brief Overview of Linear and Nonlinear Programming.
• The course covers topics such as:
  • Kuhn-Fourier Elimination Scheme
  • Farkas Lemma
  • Constrained Optimization through Lagrange multipliers for equation and inequality based systems
  • Karush-Kuhn-Tucker Theorem
  • Strong Duality Theorem of Linear Programming
  • Network Flows
  • Max-flow Min cut Theorem
  • Algorithms for maximizing flows
  • Min-cost flow Problem and its electrical equivalent
  • Menger's Theorems
  • Graph Optimization Problems
  • Maximum spanning tree
  • Matching and covering
  • Shortest path problem
  • Graph colouring problems
  • Introduction to Matroids
  • Axioms for matroids
  • The greedy algorithm and the related characterization of matroids

Latest Semester

• 2017-Autumn

Programs

• PG

Latest Instructor

• Harihar Narayanan

Substitutions

• Not Applicable