Nonlinear Integer Programming

It is not an exaggeration that much of what people devote in their hfe re­ solves around optimization in one way or another. On one hand, many decision making problems in real applications naturally result in optimization problems in a form of integer programming. On the other hand, integer programm...

Πλήρης περιγραφή

Λεπτομέρειες βιβλιογραφικής εγγραφής
Κύριοι συγγραφείς: Li, Duan (Συγγραφέας), Sun, Xiaoling (Συγγραφέας)
Συγγραφή απο Οργανισμό/Αρχή: SpringerLink (Online service)
Μορφή: Ηλεκτρονική πηγή Ηλ. βιβλίο
Γλώσσα:English
Έκδοση: Boston, MA : Springer US, 2006.
Σειρά:International Series in Operations Research & Management Science, 84
Θέματα:
Διαθέσιμο Online:Full Text via HEAL-Link
Πίνακας περιεχομένων:
  • Optimality, Relaxation and General Solution Procedures
  • Lagrangian Duality Theory
  • Surrogate Duality Theory
  • Nonlinear Lagrangian and Strong Duality
  • Nonlinear Knapsack Problems
  • Separable Integer Programming
  • Nonlinear Integer Programming with a Quadratic Objective Function
  • Nonseparable Integer Programming
  • Unconstrained Polynomial 0–1 Optimization
  • Constrained Polynomial 0–1 Programming
  • Two Level Methods for Constrained Polynomial 0–1 Programming
  • Mixed-Integer Nonlinear Programming
  • Global Descent Methods.