Math 2.0

Resources / course

Nonlinear programming 99B7K1NK8J

URIm2://res/99B7K1NK8J
Kindcourse
CreatorsS. K. Gupta (instructor)
Date2017-07-06
Scopein
Idscourse 00582g326:111107104

Expressions

e1: edition

Languageen
Date2017-07-06
Contents
  • part 1: Unit-1
  • session 1: Convex Sets and Functions
  • session 2: Properties of Convex Functions-I
  • session 3: Properties of Convex Functions-II
  • session 4: Properties of Convex Functions- III
  • session 5: Convex Programming Problems
  • part 2: Unit-2
  • session 6: KKT optimality conditions
  • session 7: Quadratic Programming Problems-I
  • session 8: Quadratic Programming Problems -II
  • session 9: Separable Programming-I
  • session 10: Separable Programming-II
  • part 3: Unit-3
  • session 11: Geometric Programming-I
  • session 12: Geometric Programming-II
  • session 13: Geometric Programming-III
  • session 14: Dynamic Programming-I
  • session 15: Dynamic Programming-II
  • part 4: Unit-4
  • session 16: Dynamic programming approach to find shortest path in any network.
  • session 17: Dynamic Programming-IV
  • session 18: Search Techniques-I
  • session 19: Search Techniques-II
  • session 20: Search Techniques-III

Catalogue records