Scribd
Upload
688 views10 pages

Maths Project Class 12

This document provides details about a student's math investigatory project on linear programming for their CBSE class 12 exams in the academic year 2023-2024. It includes an introduction to linear programming, its characteristics, uses, principles, and definitions of key terms. The student thanks their teacher and parents for their support and guidance in completing the project.

Uploaded by

Anshul Kumar Roy
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
688 views10 pages

Maths Project Class 12

This document provides details about a student's math investigatory project on linear programming for their CBSE class 12 exams in the academic year 2023-2024. It includes an introduction to linear programming, its characteristics, uses, principles, and definitions of key terms. The student thanks their teacher and parents for their support and guidance in completing the project.

Uploaded by

Anshul Kumar Roy
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 10

Coast guard public school

Daman

Academic year 2023-2024

Name :- abhishek jalendra rai


Class :- xii-a (maths)
Roll no :- 2
Subject :-maths investigatory
Project
Topic :- linear programing
Coast guard public school
Daman

Certificate
This is to certify you that Student ABHISHEK
JALENDRA RAI of class 12th- A (Maths) of Roll
no – 2 has successfully completed the project
entitled ‘ LINEAR PROGRAMING ’ in the
subject Maths laid down in the regulation of
CBSE for the purpose of Board Examination in
class XII to be held in ACADEMIC YEAR 2023-
2024 .

Teacher Incharge principal

acknowledgement
I would like to express my special thanks to my
teacher, Mrs Khushboo Chauhan who have gave
me the golden opportunity to do this project about
‘LINEAR PROGRAMING’

which helped me to know about various things that


are to be known . I also like to thank my parents
who have helped me to collect the data and
support me for which I am Gratefull .

INTRODUCTION
Linear programing is a major innovation since
World War II in the field of business decision
making, particularly under condition of certainty .
The word ‘Linear’ means the relationship handled
are those represented by straight lines , i.e the
relationship are of the form y=a+bx and the word
‘programing’ means taking decisions
systematically. Thus , Linear programing is a
decision making technique under given constraints
on the assumption that the relationships amongst
the variables representing different phenomena
happen to be linear .
A linear programing problem consists of three
parts. First, there objective function
Which is either to be maximize or to be
minimized. Second , there is a set of linear
constraints which contains three technical
specifications of the problems in

relation to the given resources or requirements .


Third there is a set of non negativity constraints
since negative production has no physical
counterpart .

AIM :-
1.) To find and know the importance and
Uses of ‘ Linear programing ’ .
2.) To formulate a linear programing problem
and solve in simplex method and dual
problem .
DATA COLLECTION
Linear Programing is a versatile mathematical
technique in operations research and a plan of
actions to solve a given problem involving
linearly related variables in order to achieve the
laid down objective in the form of minimizing or
maximizing the objective function under a given
set of constraints .

Characteristics:-
 Objectives can be expressed in a standard form
viz. maximize /minimize z=f(X) where z is
called the objective function.
 Constraints are capable of being expressed in
the form of equality or inequality viz.
f(x)=or<= or >= k , where k=constant and
x>=0.
 Resources to be optimized are capable of
being quantified in numerical terms.
 The variables are linearly related to each
other .
 More than one solution exist, the objectives
being to select the optimum solution .
 The linear programming technique is based on
simultaneous solutions of linear equations .

Uses:-

There are many uses of L.P. It is not possible to


list them all here. However L.P is very useful to
find out the following:
Optimum product mix to maximize the profit.
Optimum schedule of orders to minimize the
total cost.
Optimum media-mix to get maximum
advertisement effect.
Optimum schedule of supplies from warehouses
to minimize transportation costs.
Optimum line balancing to have minimum
idling time.
Optimum allocation of capital to obtain
maximum R.O.I
Optimum allocation of jobs between machines
for maximum utilization of machines.
Optimum assignments of jobs between workers
to have maximum labor productivity.
Optimum staffing in hotels, police stations and
hospitals to maximize efficiency.
Optimum number of crew in buses and trains to
have minimum operating costs.
Optimum facilities in telephone exchange to
have minimum break downs.

The above list is not an exhaustive one; only an


illustration.

Advantages:-
Provide the best allocation of available
resources.
meet overall objectives of the management.
Assist management to take proper decisions.
Provide clarity of thought and better
appreciation of problem.
Improve objectivity of assessment of the
situation.
Put across our view points more successfully by
logical argument supported by scientific methods.

PRINCIPLES:-
Following principles are assumed in L.P.P

Proportionality:
There exist proportional relationships between
objectives and constraints.

Additivity:
Total resources are equal to the sum of the
resources used in individual activities.

Divisibility:
Solution need not be a whole number viz decision
variable can be in fractional form.

Certainty:
Coefficients of objective function and constraints
are known constants and not change viz
parameters remain unaltered.
Finiteness:
Activities and constraints are finite in number.
Optimality:
The ultimate objective is to obtain an optimum
solution viz 'maximization' or 'minimization'.

DEFINITION OF TERMS:-

Basic solution: There are instances where number


of unknowns (p) are more than the number of
linear equations (q) available. In such cases we
assign zero values to all surplus unknowns. There
will be (p-q) such unknowns. With these values we
solve 'q' equations and get values of 'q' unknowns.
Such solutions are called Basic Solutions.
Basic variables: The variables whose value is
obtained from the basic solution is called basic
variables.

Non-basicvariables: The variables whose


value are assumed as zero in basic solutions are
called non-basic variables.

You might also like