Mixed Integer Nonlinear Programming

Editors:

ISBN: 978-1-4614-1926-6 (Print) 978-1-4614-1927-3 (Online)

Table of contents (22 chapters)

previous Page of 2
  1. Front Matter

    Pages i-xvii

  2. Convex MINLP

    1. Front Matter

      Pages 1-1

    2. No Access

      Book Chapter

      Pages 1-39

      Algorithms and Software for Convex Mixed Integer Nonlinear Programs

    3. No Access

      Book Chapter

      Pages 41-59

      Subgradient Based Outer Approximation for Mixed Integer Second Order Cone Programming

    4. No Access

      Book Chapter

      Pages 61-89

      Perspective Reformulation and Applications

  3. Disjunctive Programming

    1. Front Matter

      Pages 91-91

    2. No Access

      Book Chapter

      Pages 93-115

      Generalized Disjunctive Programming: A Framework for Formulation and Alternative Algorithms for MINLP Optimization

    3. No Access

      Book Chapter

      Pages 117-144

      Disjunctive Cuts for Nonconvex MINLP

  4. Nonlinear Programming

    1. Front Matter

      Pages 145-145

    2. No Access

      Book Chapter

      Pages 147-224

      Sequential Quadratic Programming Methods

    3. No Access

      Book Chapter

      Pages 225-243

      Using Interior-Point Methods within an Outer Approximation Framework for Mixed Integer Nonlinear Programming

  5. Expression Graphs

    1. Front Matter

      Pages 245-245

    2. No Access

      Book Chapter

      Pages 247-262

      Using Expression Graphs in Optimization Algorithms

    3. No Access

      Book Chapter

      Pages 263-283

      Symmetry in Mathematical Programming

  6. Convexification and Linearization

    1. Front Matter

      Pages 285-285

    2. No Access

      Book Chapter

      Pages 287-314

      Using Piecewise Linear Functions for Solving MINLPs

    3. No Access

      Book Chapter

      Pages 315-347

      An Algorithmic Framework for MINLP with Separable Non-Convexity

    4. No Access

      Book Chapter

      Pages 349-369

      Global Optimization of Mixed-Integer Signomial Programming Problems

  7. Mixed-Integer Quadraticaly Constrained Optimization

    1. Front Matter

      Pages 371-371

    2. No Access

      Book Chapter

      Pages 373-405

      The MILP Road to MIQCP

    3. No Access

      Book Chapter

      Pages 407-426

      Linear Programming Relaxations of Quadratically Constrained Quadratic Programs

    4. No Access

      Book Chapter

      Pages 427-444

      Extending a CIP Framework to Solve MIQCPs

  8. Combinatorial Optimization

    1. Front Matter

      Pages 445-445

    2. No Access

      Book Chapter

      Pages 447-481

      Computation with Polynomial Equations and Inequalities Arising in Combinatorial Optimization

    3. No Access

      Book Chapter

      Pages 483-511

      Matrix Relaxations in Combinatorial Optimization

    4. No Access

      Book Chapter

      Pages 513-529

      A Polytope for a Product of Real Linear Functions in 0/1 Variables

  9. Complexity

    1. Front Matter

      Pages 531-531

    2. No Access

      Book Chapter

      Pages 533-557

      On the Complexity of Nonlinear Mixed-Integer Optimization

    3. No Access

      Book Chapter

      Pages 559-593

      Theory and Applications of n-Fold Integer Programming

previous Page of 2