Prescriptive Analytics:

Linear programming Programme

SUBMITTED BY:
Chaudhari Kalpesh Ravindra
23PGDM-ABPM50

SUBMITTED TO:
Dr. Sahiba Sharma
Assistant Professor IIPMB

1
1.Introduction:
In the busy world of airlines, it's important to have the right number of
stewardesses to serve passengers and keep costs in check. The director of
passenger services at Ace Air Lines needs to figure out how many new
stewardesses to hire and train over the next six months to meet the flight hour
requirements. This decision involves considering training time, available
stewardesses, costs, and how many stewardesses may leave their jobs.
By using a mathematical approach called linear programming, the director can
find the best way to hire and train stewardesses to save
To formulate the problem as a linear programming design to minimize costs for
the director of passenger services at Ace Air Lines, we can define the following
symbols and equations:

2. Linear programming
Equations Explanation:

1. Objective Function:
$ \text{Minimize: } Z = \sum_{i=1}^{6} (800z_i + 400x_i) $
- This equation represents the total cost to be minimized over the six-month
period. It includes the cost of regular stewardesses ($800z_i$) and the cost of
trainees ($400x_i$) for each month.

2. Stewardess Availability Equation:

$ z_{i+1} = z_i - 0.1z_i + x_{i-1} $
- This equation calculates the number of stewardesses available at the beginning
of each month. It considers the stewardesses from the previous month ($z_i$),
accounts for 10% of stewardesses quitting their jobs, and adds the new hires
from the previous month ($x_{i-1}$).

3. Regular Stewardess Flight Hours Cut Equation:

2
$ y_i = 100x_i $
- This equation determines the number of regular stewardess flight hours cut
due to training. It is based on the assumption that each new trainee ($x_i$)
requires 100 hours of regular stewardess time.

4. Total Stewardess Flight Hours Available Equation:

$ 150z_i = 9000 $
- This equation sets the limit on the total stewardess flight hours available in
each month. It ensures that the total hours worked by stewardesses ($150z_i$)
do not exceed 9000 hours, considering the maximum of 150 hours per
stewardess.

5. Stewardesses Quitting Equation:

$ q_i = 0.1z_i $
- This equation calculates the number of stewardesses quitting their jobs each
month. It is based on the assumption that 10% of the stewardesses ($0.1z_i$)
will leave the company.

6. Non-negativity Constraints:
$ x_i, y_i, z_i, q_i \geq 0 $
- These constraints ensure that the variables representing the number of new
hires ($x_i$), flight hours cut ($y_i$), stewardesses available ($z_i$), and
stewardesses quitting ($q_i$) are non-negative, meaning they cannot be less
than zero.

By understanding and applying these equations, the director of passenger

services can formulate and solve the linear programming model to make
informed decisions on hiring and training stewardesses to meet the airline's
needs at minimum cost.

3
3.Equations Explanation:

1. Objective Function:
$ \text{Minimize: } Z = \sum_{i=1}^{6} (800z_i + 400x_i) $
- This equation represents the total cost to be minimized over the six-month
period. It includes the cost of regular stewardesses ($800z_i$) and the cost of
trainees ($400x_i$) for each month.

2. Stewardess Availability Equation:

$ z_{i+1} = z_i - 0.1z_i + x_{i-1} $
- This equation calculates the number of stewardesses available at the beginning
of each month. It considers the stewardesses from the previous month ($z_i$),
accounts for 10% of stewardesses quitting their jobs, and adds the new hires
from the previous month ($x_{i-1}$).

3. Regular Stewardess Flight Hours Cut Equation:

$ y_i = 100x_i $
- This equation determines the number of regular stewardess flight hours cut
due to training. It is based on the assumption that each new trainee ($x_i$)
requires 100 hours of regular stewardess time.

4. Total Stewardess Flight Hours Available Equation:

$ 150z_i = 9000 $
- This equation sets the limit on the total stewardess flight hours available in
each month. It ensures that the total hours worked by stewardesses ($150z_i$)
do not exceed 9000 hours, considering the maximum of 150 hours per
stewardess.

4
5. Stewardesses Quitting Equation:
$ q_i = 0.1z_i $
- This equation calculates the number of stewardesses quitting their jobs each
month. It is based on the assumption that 10% of the stewardesses ($0.1z_i$)
will leave the company.

6. Non-negativity Constraints:
$ x_i, y_i, z_i, q_i \geq 0 $
- These constraints ensure that the variables representing the number of new
hires ($x_i$), flight hours cut ($y_i$), stewardesses available ($z_i$), and
stewardesses quitting ($q_i$) are non-negative, meaning they cannot be less
than zero.

4.Conclusion
By understanding and applying these equations, the director of passenger
services can formulate and solve the linear programming model to make
informed decisions on hiring and training stewardesses to meet the airline's
needs at minimum cost.
The director at Ace Air Lines can use math to figure out the best way to hire and
manage flight attendants without spending too much. This method helps decide
how many flight attendants to hire and how to handle them leaving, aiming to
save money while keeping enough staff for flights. It's a smart plan that helps
the airline run smoothly and keep costs low.