Scribd
Upload
0 views

Linear Programming Problems Final

The document discusses a linear programming problem related to a new Taj Hotels branch in Mumbai, focusing on maximizing profit from 50 available rooms, which include Villas priced at ₹30,000 and Deluxe rooms at ₹10,000, while ensuring at least 20 Deluxe rooms. It outlines the steps to formulate linear programming problems, including recognizing decision variables, expressing constraints, and formulating the objective function. Additionally, it explains key concepts such as feasible solutions, optimal feasible solutions, and the feasible region in the context of linear programming.

Uploaded by

tusyajadhav
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
0 views

Linear Programming Problems Final

The document discusses a linear programming problem related to a new Taj Hotels branch in Mumbai, focusing on maximizing profit from 50 available rooms, which include Villas priced at ₹30,000 and Deluxe rooms at ₹10,000, while ensuring at least 20 Deluxe rooms. It outlines the steps to formulate linear programming problems, including recognizing decision variables, expressing constraints, and formulating the objective function. Additionally, it explains key concepts such as feasible solutions, optimal feasible solutions, and the feasible region in the context of linear programming.

Uploaded by

tusyajadhav
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 4

LINEAR PROGRAMMING

PROBLEMS
By- Tusya Jadhav, Karam Sapra, Pulkit Gupta, Sharanya Gupta, Aaditya Gupta
Project Details- Daily Life Problems

• The company “Taj Hotels” is opening a new branch in Mumbai,


they will have 50 rooms available which will consist of two types
of rooms – Villas and Deluxe. The rooms will be priced at ₹30,000
per night for the Villas and ₹10,000 per night for the Deluxe
rooms.
• The operational cost of the hotel is 1.5 lakh for one week, taking
the numbers of Villas as ‘x’ and the number of Deluxe rooms as
‘y’ find out the number of Villas and Deluxe rooms the hotel
should have to maximise profit, considering that there should be
at-least 20 Deluxe Rooms.
What are Linear Programming Problems?

• Linear Programming Problems in maths is a system process of


finding a maximum or minimum value of any variable in a
function.
• 1. Recognize the decision variables and assign symbols to them
like X, Y, Z & so on). Now these are the quantities we wish to
find out.
• 2. Express all the constraints in terms of inequalities in relation
the decision variable. 3. Formulate the objective function in
terms of the decision variables.
• 4. Add the non-negativity condition/constraints.
Solving a Linear Programming Problem:
Graphical Method-

• 1. Solution: A set of decision variables values which


satisfy all the constraints of an LPP.
• 2. Feasible solution: Any solution which also satisfies the
non-negativity limitations of the problem.
• 3. Optimal feasible solution: Any feasible solution which
maximises or minimises the objective function.
• 4. Feasible Region: The common region determined by
all the constraints and non-negativity limitations of
• an LPP.
• 5. Corner point: A point in the feasible region that is the
intersection of two boundary lines

You might also like