البرمجة الخطية (LP أو التحسين الخطي) هو أسلوب لتحقيق أفضل النتائج ( مثل أقصى قدر من الأرباح أو بأقل تكلفة ) في النموذج الرياضي الذي يتم تمثيل العلاقات الخطية المتطلبة .البرمجة الخطية هي حالة خاصة من البرمجة الرياضية (الحسابية الأمثل) .أكثر رسميا، البرمجة الخطية هي تقنية لاستمثال الاستفادة من وظيفة الخطية الموضوعية
، و يخضع لخطية المساواة و عدم المساواة القيود الخطية .
المنطقة المجدية هي محدب الشكل المتعدد السطوح، و هي مجموعة تعرف بأنها تقاطع العديد من المساحات بشكل نصف محدود ، كل منها يعرف من قبل عدم المساواة الخطية .دالة الهدف هي وظيفة أفيني قيمتها الحقيقية تعريف على هذا الشكل المتعدد السطوح .خوارزمية البرمجة الخطية يتم إيجاد نقطة في هذا المتعدد الوجوه حيث تمتلك
أصغر (أو أكبر )القيمة في حالة وجود مثل هذه النقطة .
Linear programming (LP, or linear optimization) is a method to
achieve the best outcome (such as maximum profit or lowest cost) in a mathematical model whose requirements are represented by linear relationships. Linear programming is a special case of mathematical programming (mathematical optimization).
More formally, linear programming is a technique for the
optimization of a linear objective function, subject to linear equality and linear inequality constraints. Its feasible region is a convex polyhedron, which is a set defined as the intersection of finitely many half spaces, each of which is defined by a linear inequality. Its objective function is a real-valued affine function defined on this polyhedron. A linear programming algorithm finds a point in the polyhedron where this function has the smallest (or largest) value if such a point exists.
References used
Alexander Schrijver (2003). Combinatorial optimization: polyhedra and efficiency. Springer
G.B.Dantzig. Linear programing and Extensions
H. P. Williams, Model Building in Mathematical Programming, Third revised Edition, 1990. (ModelingPrinceton University Press; Princeton, New Jersey, 1963
L.V. Kantorovich: A new method of solving some classes of extremal problems, Doklady Akad Sci USSR, 28, 1999, 211-214
Earthmoving is the process of moving and processing soil from one location to another to alter an existing land surface into a desired configuration. Highways, dams, and airports are typical examples of heavy earthmoving projects. Over the years, con
This work deals with a new method for solving Integer Linear Programming Problems depending on a previous methods for solving these problems, such that Branch and Bound method and Cutting Planes method where this new method is a combination between t
In this paper we offer a new interactive method for solving Multiobjective linear
programming problems. This method depends on forming the model for reducing the
relative deviations of objective functions from their ideal standard, and dealing with
In this research, we study the material point motion, in the field of a
homogeneous and unbounded, material rod. so we present the
Hamiltonian formalization of the problem and study the orbits
located in the plans perpendicular to the rod. We reve