Tutorial 1 Formulation Graphical Method
Uploaded by
namantalreja33Tutorial 1 Formulation Graphical Method
Uploaded by
namantalreja33Common questions
Powered by AIThe Linear Programming Problem (LPP) can be formulated by first defining the decision variables as the number of units for clothes A, B, and C. The objective function to maximize is the total profit, given by 15xA + 25xB + 20xC, where xA, xB, and xC are the units produced for clothes A, B, and C, respectively. Constraints include the material limits: for red wool, 4xA + 6xB ≤ 80; for green wool, 4xB + 10xC ≤ 100; and for blue wool, 6xA + 4xB + 8xC ≤ 150. Non-negativity constraints xA, xB, xC ≥ 0 must also be included .
LPP assumptions, such as linearity, additivity, divisibility, and certainty impact solution validity by simplifying real-world complexities into manageable forms, which may limit applicability. Linearity ensures proportionality and consistency in resources, while certainty assumes known and stable coefficients and constraints, which is often unrealistic, thus affecting the robustness of solutions derived .
Constraints are essential as they define the restrictions within which a solution must be found, representing real-world limits like resources, capacity, or regulatory standards. They shape feasible regions within which optimal solutions are computed, thus directly influencing solution viability and practical applicability .
Inspector accuracy impacts cost through error rates. Grade A checks 40 pieces/hour at 95% accuracy, with costs of Rs. 100/hr plus error cost. Grade B checks 30 pieces/hour at 98% accuracy for Rs. 120/hr. This necessitates balancing inspection selection to meet minimum piece checks (4500/day) while minimizing aggregate hourly and error-associated costs. Constraints ensure inspectors' work limitations and checking targets are met efficiently .
The objective function is pivotal in LPP as it encapsulates the goal, whether maximization or minimization, defining the problem's purpose. It guides decision-making by quantifying the outcome to be optimized, allowing evaluation of potential decisions against quantitative targets, supporting evidence-based strategy execution .
To formulate the LPP, define decision variables as units of products A, B, C produced in-house (xA xB, xC) and products A, B for subcontracting (yA, yB). The profit-maximizing objective function is 700xA + 1000xB + 1100xC + 500yA + 900yB. Constraints include casting time (6xA + 10xB + 8xC ≤ 8000), machining time (6xA + 3xB + 8xC ≤ 12000), and assembly time (3xA + 2xB + 2xC ≤ 10000). Additionally, xC cannot be subcontracted. Non-negativity constraints also apply (xA, xB, xC, yA, yB ≥ 0).
Decision variables represent choices available in LPP, such as quantities to produce, invest, or assign. They form the core components manipulated to achieve the objective function's goals, converting a problem scenario into mathematical equations that are solvable, facilitating structured and optimal decision-making .
Key considerations include defining decision variables for investments in bonds A and B. The objective function is to maximize interest earned, 0.08xA + 0.10xB. Constraints must reflect that xA + xB ≤ 500,000, xA ≤ 100,000, xB ≥ 200,000, and xA ≥ xB. Non-negativity constraints (xA, xB ≥ 0) must be ensured .
The structure facilitates profit maximization by allowing decisions based on resource allocation and process efficiency. For products A and B, decision variables represent units to produce. The objective function, 3xA + 4xB, is maximized under machine time constraints where for M1: xA + xB ≤ 450, and for M2: 2xA + xB ≤ 600, derived from available hours/minutes converted to production capacity. Non-negativity constraints apply to xA, xB ≥ 0, ensuring realistic solutions .
To solve graphically, plot constraints 2x1 + x2 ≤ 26 and 2x1 + 4x2 ≤ 56 along with x1 - x2 ≥ -5 on a graph. Identify the feasible region defined by these constraints. Objective function 10x1 + 15x2 is used to find the line passing through feasible region vertices; calculate Z at each vertex to find the maximum value. Solutions at points (0,14) and (13,0.5) calculate Z, selecting the maximum one as optimal .