JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY HYDERABAD B. Tech III QUANTITATIVE ANALYSIS FOR BUSINESS DECISIONS Previous Question Paper (February - 2023 - R18)

Linear Programming (LP) is a mathematical optimization technique used to allocate limited resources among competing activities in an optimal manner. Its utility and constraints are outlined below:

Advantages:

• Optimal Resource Allocation: It provides a scientific and objective method for determining the best possible course of action, ensuring maximum profit or minimum cost within defined constraints.
• Efficiency: It forces decision-makers to clearly define objectives and constraints, which leads to a more structured and logical analysis of complex business problems.
• Sensitivity Analysis: LP models allow for post-optimality analysis, enabling managers to understand how changes in resource availability or cost coefficients affect the final solution.
• Versatility: It is applicable across diverse sectors such as production planning, logistics, financial portfolio management, and marketing mix optimization.

Limitations:

• Assumption of Linearity: The model assumes that objective functions and constraints are linear, which often fails to capture real-world complexities like economies of scale or non-linear cost structures.
• Certainty Assumption: LP assumes that all parameters (coefficients, resource availability) are known with certainty, whereas business environments are typically characterized by risk and uncertainty.
• Divisibility Requirement: The model assumes that variables can take fractional values, which is impractical in scenarios where only whole units (e.g., number of machines or people) are meaningful.
• Single Objective Focus: Standard LP models are designed to optimize a single objective, making it difficult to address multi-objective problems without complex weighting or goal programming techniques.

In the context of linear programming and duality, the shadow price of a resource represents the marginal change in the optimal value of the objective function per unit increase in the availability of that specific resource, assuming all other parameters remain constant.

• It is mathematically defined as the value of the corresponding dual variable in the optimal solution of the dual problem.
• It indicates the maximum amount a decision-maker should be willing to pay for an additional unit of a constrained resource, often referred to as the marginal value or imputed value of the resource.
• If a resource is not fully utilized (i.e., there is slack), its shadow price is zero, because having more of an unconstrained resource provides no additional benefit to the objective function.
• If a resource is fully exhausted (i.e., it is a binding constraint), the shadow price is positive, reflecting the potential improvement in the objective function that would result from relaxing that constraint by one unit.