• الرئیسیة
  • البحث المتقدم
  • قائمة المکتبات
  • حول الموقع
  • اتصل بنا
  • نشأة

عنوان
Algorithmic Principles of Mathematical Programming

پدید آورنده
by Ulrich Faigle, Walter Kern, Georg Still.

موضوع
Algorithms.,Computational complexity.,Computer science.,Information theory.,Mathematical optimization.,Mathematics.

رده

کتابخانه
کتابخانه مطالعات اسلامی به زبان های اروپایی

محل استقرار
استان: قم ـ شهر: قم

کتابخانه مطالعات اسلامی به زبان های اروپایی

تماس با کتابخانه : 32910706-025

9789048161171
9789401598965

b408452

Algorithmic Principles of Mathematical Programming
[Book]
by Ulrich Faigle, Walter Kern, Georg Still.

Dordrecht :
Imprint: Springer,
2002.

Kluwer Texts in the Mathematical Sciences, A Graduate-Level Book Series,
24
0927-4529 ;

1. Real Vector Spaces -- 2. Linear Equations and Linear Inequalities -- 3. Polyhedra -- 4. Linear Programs and the Simplex Method -- 5. Lagrangian Duality -- 6. An Interior Point Algorithm for Linear Programs -- 7. Network Flows -- 8. Complexity -- 9. Integer Programming -- 10. Convex Sets and Convex Functions -- 11. Unconstrained Optimization -- 12. Constrained Nonlinear Optimization -- List of frequently used Symbols.
0

Algorithmic Principles of Mathematical Programming investigates the mathematical structures and principles underlying the design of efficient algorithms for optimization problems. Recent advances in algorithmic theory have shown that the traditionally separate areas of discrete optimization, linear programming, and nonlinear optimization are closely linked. This book offers a comprehensive introduction to the whole subject and leads the reader to the frontiers of current research. The prerequisites to use the book are very elementary. All the tools from numerical linear algebra and calculus are fully reviewed and developed. Rather than attempting to be encyclopedic, the book illustrates the important basic techniques with typical problems. The focus is on efficient algorithms with respect to practical usefulness. Algorithmic complexity theory is presented with the goal of helping the reader understand the concepts without having to become a theoretical specialist. Further theory is outlined and supplemented with pointers to the relevant literature.

9789048161171

Springer eBooks

Algorithms.
Computational complexity.
Computer science.
Information theory.
Mathematical optimization.
Mathematics.

Faigle, Ulrich.

Kern, Walter.
Still, Georg.

SpringerLink (Online service)

20190301073800.0

 مطالعه متن کتاب 

[Book]

Y

الاقتراح / اعلان الخلل

تحذیر! دقق في تسجیل المعلومات
ارسال عودة
تتم إدارة هذا الموقع عبر مؤسسة دار الحديث العلمية - الثقافية ومركز البحوث الكمبيوترية للعلوم الإسلامية (نور)
المكتبات هي المسؤولة عن صحة المعلومات كما أن الحقوق المعنوية للمعلومات متعلقة بها
برترین جستجوگر - پنجمین جشنواره رسانه های دیجیتال