Kumar | Kumar, S: Recent Developments in Mathematical Programming | Buch | 978-1-138-41318-4 | sack.de

Buch, Englisch, 470 Seiten, Format (B × H): 156 mm x 234 mm, Gewicht: 1025 g

Kumar

Kumar, S: Recent Developments in Mathematical Programming

Buch, Englisch, 470 Seiten, Format (B × H): 156 mm x 234 mm, Gewicht: 1025 g

ISBN: 978-1-138-41318-4
Verlag: Taylor & Francis Ltd


This work is concerned with theoretical developments in the area of mathematical programming, development of new algorithms and software and their applications in science and industry. It aims to expose recent mathematical developments to a larger audience in science and industry.
Kumar Kumar, S: Recent Developments in Mathematical Programming jetzt bestellen!

Zielgruppe


Professional


Autoren/Hrsg.


Weitere Infos & Material


Preface -- List of Contributors -- PART 1: REVIEW ARTICLES IN MATHEMATICAL PROGRAMMING -- 1 Recent Advances in Global Optimization: A Tutorial Survey /Reiner Horst -- 2 Two-level Resource Control Preemptive Hierarchical Linear Programming Problem: A Review /Subhash C. Narula and Adiele D. Nwosu -- 3 Some Recent Developments in Infinite Programming /A. B. Philpott -- 4 Recent Developments in Mathematical Programming Software for the Microcomputer /R. Sharda andD. M. Steiger -- 5 C-Programming: Its Theory and Applications /Moshe Sniedovich -- PART 2: MULTICRITERIA OPTIMIZATION -- 6 Aspects of Multicriteria Optimization /B.D. Craven -- 7 A Duality Theorem for a Fractional Multiobjective Problem with Square Root Terms /R. R. Egudo -- 8 Efficiency and Duality Theory for a Class of Differentiable Multiobjective Programming Problems with Invexity /ZulfiqarAli Khan -- 9 Efficiency and Duality Theory for a Class of Nondifferentiable Multiobjective Programs /Zulfiqar Ali Khan -- 10 Symmetric Duality for Nonlinear Multiobjective Programming /B. Mond and T. Weir -- PART 3: SYSTEM OPTIMIZATION AND HEURISTICS -- 11 Data Envelopment Analysis: A Comparative Tool /M. J. Foster -- 12 A Study of Protean Systems — Some Heuristic Strategies for Redundancy Optimization /Radha Kalyan and Santosh Kumar -- PART 4: INTERIOR-POINT APPROACH AND QUADRATIC PROGRAMMING -- 13 Nearest Points in Nonsimplicial Cones and LCP’s with PSD Symmetric Matrices /K. S. Al-Sultan and K. G. Murty -- 14 A Study on Monotropic Piecewise Quadratic Programming /Jie Sun -- 15 Interior-Point Algorithms for Quadratic Programming /Yinyu Ye -- PART 5: COMPUTATIONAL EFFICIENCY, METHODS AND SOFTWARE -- 16 Problems in Protean Systems — Computer Programs for Some Solution Methods /Radha Kalyan and Santosh Kumar -- 17 Alternative Methods for Representing the Inverse of Linear Programming Basis Matrices /Gautam Mitra and Mehrdad Tamiz -- 18 Toward Parallel Computing on Personal Computers in Mathematical Programming /Moshe Sniedovich -- PART 6: MATHEMATICAL PROGRAMMING APPLICATIONS -- 19 A Mixed Integer Model of Petroleum Fields with Moving Platforms /Dag Haugland, Kurt Jornsten and Ebrahim Shayan -- 20 Optimal Stochastic Hydrothermal Scheduling Using Nonlinear Programming Technique /D. P. Kothari -- 21 Nonlinear Programming Applied to the Dynamic Rescheduling of Trains /R. G. J. Mills and S. E. Perkins -- 22 Network Routing Applications in National and Regional Planning /J. P. Saksena -- 23 An Application of the Lagrangean Relaxation Based Approach to the Bulk Commodity Production Distribution Problem /R. R. K. Sharma -- PART 7: ALGORITHMS, GAMES AND PARADOX -- 24 Flow Truncation in a Four Axial Sums’ Transportation Problem /L. Bandopadhyaya and M. C. Puri -- 25 Continuous Linear Programs and Continuous Matrix Game Equivalence /S. Chandra, B. Mond and M. V. Durga Prasad -- 26 A Short Note on a Path-following Interpretation of the Primal-dual Algorithm /Patrick Tobin and Santosh Kumar -- 27 On a Paradox in Linear Fractional Transportation Problems /Vanita Verma and M. C. Puri -- 28 Nash Equilibrium Points of Stochastic N-uels /P. Zeephongsekul -- APPENDICES -- Subject Index -- Author Index -- List of Referees.


Kumar, Santosh


Ihre Fragen, Wünsche oder Anmerkungen
Vorname*
Nachname*
Ihre E-Mail-Adresse*
Kundennr.
Ihre Nachricht*
Lediglich mit * gekennzeichnete Felder sind Pflichtfelder.
Wenn Sie die im Kontaktformular eingegebenen Daten durch Klick auf den nachfolgenden Button übersenden, erklären Sie sich damit einverstanden, dass wir Ihr Angaben für die Beantwortung Ihrer Anfrage verwenden. Selbstverständlich werden Ihre Daten vertraulich behandelt und nicht an Dritte weitergegeben. Sie können der Verwendung Ihrer Daten jederzeit widersprechen. Das Datenhandling bei Sack Fachmedien erklären wir Ihnen in unserer Datenschutzerklärung.