Operations Research

  1. Nonlinear Programming
    1. Introduction to Nonlinear Optimization
      1. Types of Nonlinearities
        1. Challenges in Nonlinear Programming
          1. Local vs. Global Optimization
          2. Unconstrained Optimization
            1. Optimality Conditions
              1. First-Order Necessary Conditions
                1. Second-Order Sufficient Conditions
                2. Line Search Methods
                  1. Steepest Descent Method
                    1. Newton's Method
                      1. Quasi-Newton Methods
                      2. Trust Region Methods
                        1. Conjugate Gradient Methods
                        2. Constrained Optimization
                          1. Types of Constraints
                            1. Equality Constraints
                              1. Inequality Constraints
                              2. Lagrange Multiplier Method
                                1. Karush-Kuhn-Tucker Conditions
                                  1. Penalty and Barrier Methods
                                    1. Sequential Quadratic Programming
                                    2. Convex Optimization
                                      1. Convex Sets and Functions
                                        1. Properties of Convex Problems
                                          1. Global Optimality in Convex Problems
                                            1. Duality in Convex Programming
                                              1. Interior Point Methods

                                            Previous

                                            6. Integer Programming

                                            Go to top

                                            Next

                                            8. Dynamic Programming