What is Optimisation in Linear Programming?

S3-SA1-0445

Grade Level:

Class 8

AI/ML, Data Science, Physics, Economics, Cryptography, Computer Science, Engineering

Definition

What is it?

Optimisation in Linear Programming is like finding the 'best' possible solution from many choices, when those choices are limited by certain rules. It means making something as good as it can be – either getting the maximum profit or the minimum cost – using straight-line equations.

Simple Example

Quick Example

Imagine you have to pack your school bag for a trip. You want to carry the most snacks (maximize snacks) but your bag has a weight limit (a rule). Optimisation helps you pick the best combination of snacks without exceeding the weight limit.

Worked Example

Step-by-Step

Let's say you run a small chai stall. You can make two types of chai: Regular Chai and Special Masala Chai. --- Regular Chai uses 10ml milk and 5g sugar. Special Masala Chai uses 15ml milk and 7g sugar. --- You have only 300ml milk and 150g sugar available. --- You earn Rs. 5 profit per Regular Chai and Rs. 8 profit per Special Masala Chai. --- Your goal is to make the maximum profit. --- Let 'x' be the number of Regular Chai and 'y' be the number of Special Masala Chai. --- We want to Maximize Profit = 5x + 8y. --- The rules (constraints) are: 10x + 15y <= 300 (for milk) and 5x + 7y <= 150 (for sugar). Also, x >= 0 and y >= 0 (you can't make negative chai!). --- By plotting these on a graph and finding the corner points of the feasible region (the area where all rules are met), we can test which combination of x and y gives the highest profit. --- If you test points like (0,0), (0,20), (15,10), (30,0), you'll find that making 15 Regular Chai and 10 Special Masala Chai gives a profit of 5*15 + 8*10 = 75 + 80 = Rs. 155. This is the maximum profit.

Why It Matters

Optimisation is super important for making smart decisions in the real world! Companies use it to decide how many products to make (Economics), engineers use it to design the best bridges (Engineering), and even your phone's GPS uses it to find the fastest route (Computer Science). It helps people in jobs like data scientists and logistics managers save money and time.

Common Mistakes

MISTAKE: Not understanding that 'optimisation' can mean both 'maximizing' and 'minimizing'. | CORRECTION: Always check if the problem asks for the largest possible value (like profit) or the smallest possible value (like cost).

MISTAKE: Forgetting to consider all the 'rules' or constraints given in the problem. | CORRECTION: Read the problem carefully and list down every single condition or limit before you start solving.

MISTAKE: Confusing the objective function (what you want to maximize/minimize) with the constraints (the rules). | CORRECTION: The objective function is usually something like 'Profit = ...' or 'Cost = ...', while constraints are inequalities like 'Milk used <= total milk available'.

Practice Questions

Try It Yourself

QUESTION: A baker wants to make two types of cookies: Chocolate Chip (CC) and Oatmeal (O). CC cookies sell for Rs. 10 profit each, O cookies for Rs. 8 profit each. If the baker wants to maximize profit, what is the objective function? | ANSWER: Maximize Profit = 10CC + 8O

QUESTION: A factory produces chairs and tables. Each chair needs 2 hours of labor, each table needs 5 hours. Total labor hours available are 100. Write this as a linear programming constraint. | ANSWER: 2C + 5T <= 100 (where C is number of chairs, T is number of tables)

QUESTION: You are setting up a small juice shop. You can make Orange Juice (OJ) or Apple Juice (AJ). Each OJ needs 3 oranges and 1 minute to make. Each AJ needs 2 apples and 1.5 minutes to make. You have 30 oranges, 20 apples, and 25 minutes of time. If you make Rs. 20 profit per OJ and Rs. 25 per AJ, what are your constraints? | ANSWER: 3OJ <= 30 (oranges), 2AJ <= 20 (apples), 1OJ + 1.5AJ <= 25 (time), OJ >= 0, AJ >= 0

MCQ

Quick Quiz

Which of the following is the main goal of optimisation in Linear Programming?

To find any possible solution

To find the best possible solution (maximum or minimum) under given conditions

To only find solutions that use whole numbers

To make all variables equal to zero

The Correct Answer Is:

Optimisation specifically aims to find the 'best' solution, whether that's the highest profit (maximum) or the lowest cost (minimum), while still following all the rules. The other options don't capture this core idea.

Real World Connection

In the Real World

Think about how delivery services like Swiggy or Zomato plan their routes. They use optimisation to figure out the fastest way for their delivery partners to reach customers, minimizing travel time and fuel costs. Even ISRO uses similar ideas to plan rocket launch trajectories, ensuring they use minimum fuel to reach the correct orbit!

Key Vocabulary

Key Terms

OPTIMISATION: Finding the best possible solution (max or min) | LINEAR PROGRAMMING: A method using straight-line equations to solve optimisation problems | OBJECTIVE FUNCTION: The equation you want to maximize or minimize (e.g., Profit = ...) | CONSTRAINTS: The rules or limits that must be followed (e.g., Milk available <= 300ml) | FEASIBLE REGION: The area on a graph where all constraints are met.

What's Next

What to Learn Next

Great job understanding optimisation! Next, you should learn about 'Graphing Linear Inequalities'. This will show you how to visually represent the 'rules' (constraints) and find the 'feasible region' on a graph, which is key to solving these problems.