0% found this document useful (0 votes)
41 views15 pages

Energy Loss Reduction in Agriculture Optimization

Uploaded by

mohan
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
41 views15 pages

Energy Loss Reduction in Agriculture Optimization

Uploaded by

mohan
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd

Optimization of production processes to minimize energy loss in

agriculture
FMPE 601 ADVANCES IN FARM MACHINERY AND POWER
ENGINEERING

Course Teachers: Er. Sindhu Bhaskar & Dr. Rajesh A.N.

MOHANASELVAN T
2023-28-002
PhD (FMPE)
Introduction
• Resource use efficiency is a measure of how effectively resources such as land, water,
energy, and labour are used in agricultural production.

• It is an important concept in sustainable agriculture as it can help to reduce the


negative environmental impacts of agriculture while maximizing productivity and
profitability.

• Improving resource use efficiency is essential for sustainable agriculture. By adopting


practices that use resources more efficiently, the negative environmental impacts of
agriculture can be minimized while ensuring productivity, profitability, and sustainability.
Optimization Techniques

• Optimization techniques refer to the use of mathematical models and


algorithms to optimize the use of resources in agriculture.

• These techniques can be used to maximize productivity, minimize costs, and


reduce negative environmental impacts.

• There are several optimization techniques that can be used in agriculture:

Linear programming: Linear programming is a mathematical technique that is


used to optimize resource allocation. It involves formulating a model that
describes the agricultural system and using mathematical algorithms to identify
the optimal allocation of resources.
Dynamic programming: Dynamic programming is a mathematical technique
that is used to optimize decision-making over time. It involves formulating a
model that takes into account the impact of decisions on future outcomes and
using mathematical algorithms to identify the optimal decision path.

Simulation modelling: Simulation modelling is a technique that involves creating


a computer-based model of an agricultural system and using it to simulate
different scenarios. It can be used to optimize resource use by identifying the
most efficient combination of inputs and practices.

Genetic algorithms: Genetic algorithms are a type of optimization algorithm that


mimics the process of natural selection. They can be used to optimize agricultural
systems by identifying the most efficient combination of inputs and practices.
1. Optimization of resource use: Optimization techniques can be used to identify the optimal
allocation of resources such as land, water, energy, and labour to maximize productivity and
minimize costs.

2. Identification of best practices: Optimization techniques can be used to identify the most efficient
agricultural practices, such as crop rotations and intercropping, to maximize resource use efficiency.

3. Management of uncertainty: Optimization techniques can be used to manage uncertainty in


agriculture, such as variability in weather and market conditions, by identifying the best strategies
for coping with these uncertainties.

4. Minimization of negative environmental impacts: Optimization techniques can be used to


identify the most efficient practices for minimizing negative environmental impacts, such as
reducing greenhouse gas emissions and reducing soil erosion.
Linear programming problem

• The most difficult problem in the application of management science is the


formulation of a model.

• Therefore, it is important to consider model formulation before launching


into the details of linear programming solution.

• Model formulation is the process of transforming a real world decision


problem into an operations research model.
Algorithm

• The procedure for mathematical formulation of linear programming

problem consists of the following major steps:

• Step1: Write down the decision variables of the problem.

• Step2: Formulate the objective function to be optimized (maximized

or minimized) as a linear function of the decision variables.


Step3: Formulate the other conditions of the problem such as resource

limitations, market constraints ,inter-relation between variables etc. as linear

equations or in equations in terms of the decision variables.

Step4: Add the ‘Non-negativity’ constraint from the consideration that

negative values of the decision variables do not have any valid physical

interpretation

The objective function, the set of constraints and the non-negative constraint

together form a Linear Programming Problem.


Formulation of objective function:

Maximize (or) Minimize Z = c1x1 + c2x2 + c3x3 + ....... Cnxn

Formulation of constrains:

a11x1 + a12x2 + ... + a1n xn ≤ or ≥b1

a21x1 + a22x2 + ... + a2n xn ≤ or ≥ b2

a31x1 + a32x2 + ... + a3n xn ≤ or ≥ b3

................................

am1x1 + am2 x2 + ... + amn xn ≤ or ≥ bm

and the non-negativity restrictions

x1, x2, x3, ... xn > 0.


Methods used for solving LPP

• Graphical Method

• Simplex Method

• Artificial Variable Techniques- Big M Method


Graphical Method - Algorithm

Formulate the mathematical model of the given linear


programming problem.

Treat inequalities as equalities and then draw the lines


corresponding to each equation and non-negativity
restrictions.

Locate the end points (corner points) on the feasible region.

Determine the value of the objective function corresponding


to the end points determined in step 3.

Find out the optimal value of the objective function.


• Solution: A set of values x1, x2 ...xn which satisfies the constraints of the
LPP is called its solution.

• Feasible solution: Any solution to a LPP which satisfies the non-negativity


restrictions of the LPP is called its feasible solution.

• Optimum Solution or Optimal Solution: Any feasible solution which


optimizes (maximizes or minimizes) the objective function of the LPP is
called its optimum solution or optimal solution.
• Slack Variables: If the constraints of a general LPP be

…..(1)

then the non-negative variables si which are introduced to convert the


inequalities (1) to the equalities are called slack variables. The value of

these variables can be interpreted as the amount of unused resource.


• Surplus Variables: If the constraints of a general LPP be

…..(1)

then the non-negative variables si which are introduced to convert the inequalities
(1) to the equalities are called surplus variables. The value of these variables
can be interpreted as the amount over and above the required level.
References

• https://www.agricorn.in/2023/03/resource-use-effciency-and-optimiz
ation-techniques.html
• http://ecoursesonline.iasri.res.in/course/view.php?id=72

You might also like