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.
This research presents new procedures to calculate the aggregates weight and the water requirement to realize a controlled concrete mixing design, where the aggregates proportion is defined by numerical method according to referential curve draw as r
eferring to the proposed fine aggregate ratio and the required water will be calculated as referring to the aggregates surface area. The results showed the facility and the reliability of the proposed design procedures.
تتناول مسألة التقصي الخطي البحث عن هدف مختبئ (أو مفقود) على المحور الحقيقي R
يعطي موضع الهدف بدلالة توزيع احتمالي و تكون الرغبة عندئذ بإيجاد الهدف بأقل قيمة متوقعة زمنيًا.
