Powered by Lingsoft® Search Expander  | |
RSSDecomposition Techniques in Mathematical Programming | ||||||||||||||||||
 |
| |||||||||||||||||
| ||||||||||||||||||
 | | | ||||||||||||||||
| Table of contents Part I.Motivation and Introduction 1. Motivating Examples: Models with Decomposable Structure Part II.Decomposition Techniques 2. Decomposition in Linear Programming: Complicating Constraints 3. Decomposition in Linear Programming: Complicating Variables 4. Duality 5. Decomposition in Nonlinear Programming 6. Decomposition in Mixed-Integer Programming 7. Other Decomposition Techniques Part III.Local Sensitivity Analysis 8. Local Sensitivity Analysis Part IV.Applications 9. Applications Part V.Computer Codes 10. Some GAMS Implementations Part VI.Solution to Selected Exercises 11. Exercise Solutions DRM-restrictions Printing: not available Clipboard copying: not available | ||||||||||||||||||
| We do not deliver the extra material sometimes included in printed books (CDs or DVDs). | ||||||||||||||||||
|
|
See also
