Linear Programming Concept and Assumptions, Usage in Business Decision Making

Linear programming is a mathematical technique used to determine the most effective solution to a problem by either maximizing or minimizing a linear objective function, subject to a set of constraints. This involves formulating a linear equation to represent the goal, and then finding the optimal values for the decision variables that meet the specified constraints. Applied across various fields like business, economics, engineering, and computer science, linear programming helps optimize resources, costs, and profits. It’s a valuable tool for making well-informed decisions and tackling complex problems, ranging from production scheduling to investment portfolio management.

Assumptions of Linear Programming:

• Linearity:

Both the objective function and the constraints are linear. This means that the relationship between variables is represented by straight-line equations, and there are no interactions or non-linear effects between variables.

• Additivity:

The contribution of each variable to the objective function and constraints is additive. This implies that the total effect is the sum of the individual effects of each variable.

• Proportionality:

Changes in the objective function and constraints are directly proportional to changes in the decision variables. For instance, if you double the quantity of a variable, its effect on the outcome is also doubled.

• Continuity:

Decision variables can take any value within a continuous range, including fractional values. This means that the variables are not restricted to integer values, though integer programming can be used if such constraints are required.

• Certainty:

All coefficients in the objective function and constraints are known with certainty and remain constant. There is no uncertainty or variation in these parameters.

• Additivity of Constraints:

The constraints are also linear and additive. This implies that the total effect of the constraints is the sum of the individual constraints.

• Feasibility:

There exists at least one set of values for the decision variables that satisfies all the constraints. This ensures that a feasible solution to the problem exists.

• Non-negativity:

The decision variables are non-negative, meaning they cannot take negative values. This is important in practical scenarios where negative quantities do not make sense, such as production levels or resource allocations.

Usage of Linear Programming in Business Decision Making:

• Resource Allocation:

Businesses often face constraints on resources such as labor, materials, and capital. Linear programming helps in allocating these resources in the most efficient way to maximize profit or minimize costs. For example, a manufacturer might use linear programming to determine the optimal mix of products to produce given constraints on raw materials and production capacity.

• Production Planning:

Linear programming assists in planning production schedules to optimize output. It helps businesses decide how much of each product to manufacture to meet demand while minimizing production costs. For instance, a company with multiple production lines and varying production costs can use linear programming to balance the load across these lines efficiently.

• Supply Chain Management:

Businesses use linear programming to optimize their supply chain operations, including transportation, inventory management, and distribution. It can help determine the best routes for shipping goods to minimize transportation costs or the optimal inventory levels to meet demand without overstocking.

• Portfolio Optimization:

In finance, linear programming is used to create investment portfolios that maximize returns or minimize risk, given certain constraints such as budget limits or risk tolerance. For example, an investor might use linear programming to allocate investments across different assets to achieve the best risk-return trade-off.

• Workforce Scheduling:

Linear programming can be applied to create efficient work schedules for employees while meeting various constraints such as labor laws, shift requirements, and employee availability. This ensures that staffing levels are optimal for meeting business needs without incurring unnecessary labor costs.

• Marketing and Sales Optimization:

Businesses use linear programming to optimize marketing and sales strategies. For instance, it can help in deciding the optimal mix of advertising channels to maximize reach and engagement within a given budget.

• Project Management:

In project management, linear programming can be used to schedule tasks and allocate resources efficiently, ensuring that projects are completed on time and within budget. It helps in identifying the critical path and managing constraints related to resources and deadlines.

• Cost Minimization:

Linear programming helps in minimizing costs associated with various business operations. For example, it can be used to minimize transportation costs by optimizing delivery routes or to reduce production costs by selecting the most cost-effective combination of inputs.

General Mathematical Form of LPP:

Steps in Solving LPP:

1. Identify decision variables.

2. Formulate the objective function.

3. Set up the constraints.

4. Represent constraints graphically (for two variables).

5. Determine the feasible region.

6. Find the corner points (vertices).

7. Evaluate the objective function at each corner point.

8. Choose the point that gives the optimal (maximum or minimum) value.