JAIPURIA INSTITUTE OF MANAGEMENT OPERATION RESEARCH PROJECT ON BALANCE DIET PLAN FOR GIRLS

SUBMITTED BY : SACHIN DIXIT 118 RAVI GARG - 113 SAMEERA RAHMAN - 122 RICHA NIGAM - 114

As any good work is incomplete without acknowledging the people who

made it possible, this acknowledgement is incomplete without thanking our family, friends, and our faculty, without whose support this project wouldn't have taken shape. Since we have joined Jaipuria Institute of Management, LUCKNOW we have gained so much knowledge, which has been possible due to the wellmanaged education imparted to us under conditions, which are quite conducive to learning, at our college. We express our sincere gratitude to Dr. Sumi Khare , our teacher of Operations Research , who has helped us clarify our concepts by sharing his valued experiences in his teaching, research and training which have thereby become an unconscious part of our ideas and thoughts while analyzing the Operations Research project work on Management of Balance Diet Plan For Girls. Without his sincere help and guidance the project report would have not been a possible. We thank all our team members who had worked hard to make the report to its present form. Lastly we would like to thank our families for their continuing support, blessings and encouragement.

Introduction
Linear Programming In mathematics, linear programming (LP) is a technique for optimization of a linear objective function, subject to linear equality and linear inequality constraints. Informally, linear programming determines the way to achieve the best outcome (such as maximum profit or lowest cost) in a given mathematical model and given some list of requirements represented as linear equations. More formally, given a polytope (for example, a polygon or a polyhedron), and a real-valued affine function

Defined on this polytope, a linear programming method will find a point in the polytope where this function has the smallest (or largest) value. Such points may not exist, but if they do, searching through the polytope vertices is guaranteed to find at least one of them. Linear programs are problems that can be expressed in canonical form: Maximize: ctx Subject to: Ax<=b Represents the vector of variables (to be determined), while and are vectors of (known) coefficients and is a (known) matrix of coefficients. The expression to be maximized or minimized is called the objective function ( in this case). The equations are the constraints which specify a convex polyhedron over which the objective function is to be optimized. Linear programming can be applied to various fields of study. Most extensively it is used in business and economic situations, but can also be utilized for some engineering problems. Some industries that use linear programming models include transportation, energy, telecommunications, and manufacturing. It has proved useful in modeling diverse types of problems in planning, routing, scheduling, assignment, and design.

Linear Programming Assumptions Linear programming requires linearity in the equations as shown in the above structure. In a linear equation, each decision variable is multiplied by a constant coefficient with no multiplying between decision variables and no nonlinear functions such as logarithms. Linearity requires the following assumptions: 1) Proportionality - a change in a variable results in a proportionate change in that variable's contribution to the value of the function. 2) Additivity - the function value is the sum of the contributions of each term. 3) Divisibility - the decision variables can be divided into non-integer values, taking on fractional values. Integer programming techniques can be used if the divisibility assumption does not hold. In addition to these linearity assumptions, linear programming assumes certainty; that is, that the coefficients are known and constant. The Effect of Constraints Constraints exist because certain limitations restrict the range of a variable's possible values. A constraint is considered to be binding if changing it also changes the optimal solution. Less severe constraints that do not affect the optimal solution are non-binding. Tightening a binding constraint can only worsen the objective function value, and loosening a binding constraint can only improve the objective function value. As such, once an optimal solution is found, managers can seek to improve that solution by finding ways to relax binding constraints.

PROBLEM Decision Variables: X1, x2, x3, x4, x5, x6 (xi = the number of units consumed of variables nutrients by girls)

Objectives Function: Max Calories intake =

CONSTRAINTS: According to the product consumed.

PATATO PULSE RICE WHEAT MINIMUM FAT

.4 .053 .06 .017 .046 .07 .03 2.9 .09 .9 .04 3.7 .4 20gm 70gm 40gm 3gm

CARBOHYDRATES .8 PROTIEN IRON

.08 .02

. CONSTRAINTS: INDIVIDUALLY

NUTRIENTS
Carbohydrates Proteins Fat iron

FEMALE INTAKE
300 60 40 20

COMPONENT
Pulses Vegetable Other Vegetable Milk Rice Chapatti Assumptions-

FEMALE INTAKE
100 150 150 200 200 4

All Girls exercise ie.morning walk,yoga etc We have taken carbohydrates, protein ,fat as component of balance diet There is no budgt constraints.
.

Balance Diet

Chart for Girls

Female chapatti
x1 2

pulses
x2 3 2.6

veg
x3 2 0.7

other veg.
x4 2 1.34

milk
x5 1.5 1.55

rice
x6 1.75 1.51 Formula 20.47

calories carbohydrate fat protien iron chapatti pulses veg other veg. milk rice

1.81

0.17 0.44 0.32 0.02

0.4 0.02 0.09 0.046 M 100 M

M M M M M M M

0.3 0.06 0.08 0.09 M M 150

M

0.56 0.03 0.09 0.4 M M

M 150 M M M M

0.48 0.1 0.3 0.7 M M

M M 200 M

0.37 0 0.052 0.9

4.628 1.27 1.791

6 M M
M M M M

12

200

Analysis
1. Our objective was to maximize the calorie intake of the boys dwelling in Jaipuria hostel. We took various variables which were important for a balanced diet such as-chapati, pulses, vegetables, other vegetables, milk, and rice. 2. Solving the equation on excel sheet through solver we found that the optimum calorie intake by a boy is 20.4675. 3. Results of the optimum combination of various components are also found as to what extent we should consume the quantity of the components to get optimum calories. Sensitivity analysis shows that unto what extent we can change our variables which will not change our optimum solution.

SENSTIVITY REPORT OF BOYS

Adjustable Cells Cell $C$16 $D$1 6 $E$16 $F$16 $G$1 6 $H$1 6 Name x1 x2 x3 x4 x5 x6 Final Value 2 3 2 2 1.5 1.75 Final Value 4.6275 1.27 1.791 12 300 300 300 300 350 Shadow Price 0 0 0 0.30166666 7 0.026 0.00466666 7 0.00893333 3 0.00775 0.00755 Reduced Cost Objective Coefficient 0 1.81 0 0 0 0 0 2.6 0.7 1.34 1.55 1.51 Constraint R.H. Side 340 80 45 12 300 300 300 300 350 Allowable Allowable Increase Decrease 1E+30 1.81 1E+30 1E+30 1E+30 1E+30 1E+30 Allowable Increase 1E+30 1E+30 1E+30 810.16875 48010 81016.875 72015 28806 166188.461 5 2.6 0.7 1.34 1.55 1.51 Allowable Decrease 335.3725 78.73 43.209 12 300 300 300 300 350

Constraints Cell $I$18 $I$19 $I$20 $I$21 $I$22 $I$23 $I$24 $I$25 $I$26 Name carbohydrate formula fat formula protein formula chapati formula pulses formula veg formula other veg formula milk formula rice formula