KGiSL Institute of Technology
(Approved by AICTE, New Delhi; Affiliated to Anna University, Chennai)
Recognized by UGC, Accredited by NBA (IT)
365, KGiSL Campus, Thudiyalur Road, Saravanampatti, Coimbatore – 641035.
Department of Computer Science and Engineering
Name of the Faculty : Ms. Suganthi A
Subject Name & Code : IT in Agricultural System & AI3021
Branch & Department : Computer Science and Engineering
Year & Semester : IV / VII
Academic Year :2024-25
Syllabus
UNIT III: AGRICULTURAL SYSTEMS MANAGEMENT
Agricultural systems – managerial overview, Reliability of agricultural systems, Simulation of crop
growth and field operations, Optimizing the use of resources, Linear programming, Project
scheduling, Artificial intelligence and decision support systems.
AI3021/ITAS/IV CSE/VII SEM/KG-KiTE
Course Outcome
CO3: Apply IT Principles and Concepts for Management of Field
operations.
AI3021/ITAS/IV CSE/VII SEM/KG-KiTE
TOPIC
Optimizing the Use of Resources:
Linear Programming
Introduction
• Linear programming is a powerful tool used extensively in many
agricultural, feed, and food operations.
• A classic type of problem - > select the amount of ingredients to put
in a mixture to meet certain criteria, or constraints, such as ‘‘Protein
content must be at least 15%,’’ and ‘‘Select the lowest cost
combination of these ingredients.
• Activities and Resources - Resources are used to complete the
activities. Example : feed-mixing problem
AI3021/ITAS/IV CSE/VII SEM/KG-KiTE
Requirements of the Linear
Programming Model
1. The constraints must be linear. This means they must be in a form
such as
0:40 * X + 0:08 * Y <= 15
X = pounds of soybean meal per 100 pounds of feed
Y = pounds of corn per 100 pounds of feed
2. The equation defining the total cost (or return) is also linear.
3. Variables, such as X and Y earlier, be continuous, not integer.
AI3021/ITAS/IV CSE/VII SEM/KG-KiTE
Using Quattropro to Solve Linear
Programs: Hog/Cattle Optimization
• Learning how to solve practical problems with linear programming is
easier(solution without the linear programming algorithm)
• QuattroPro, uses a variety of different algorithms, or programmed
rules, to solve the problem(The optimal solution desired may be
either a minimum or a maximum). MS Excel – Also provides solution.
• Example: A man has 300 acres of land on which he wants to go into
Animal production instead of raising crops
AI3021/ITAS/IV CSE/VII SEM/KG-KiTE
Hogs and Cattles - Example
• Hogs require half a year and 0.6 acres of land per head, and cattle require one year and
1.0 acre per head.
• problem may be viewed as a one-year time span, with two batches of hogs and one
batch of cattle.
• Hogs require about 0.4 hours of labor per week per head; cattle require about 0.1 hours
of labor per week per head
• Cattle require no housing, but hogs require 20 sq ft each, and a 2000-sq ft building is
available. Thus, a maximum of 100 hogs can be handled at a time, or 200 hogs per year.
• To simplify the problem, the costs for land, labor, and housing are not considered,
because they are available but have no alternative use.
• Hogs return $10 net profit per head and cattle $15 per head, for the year, taking into
account feed costs but not land, labor, labor, or housing
• optimal solution data also show the increased cost of certain ‘‘near-optimal’’ solutions.
AI3021/ITAS/IV CSE/VII SEM/KG-KiTE
Linear Programming -
Constraints
• Any linear program has constraints; described in linear expressions, or
formulas
• The set of linear constraints for Hogs & Cattle problem:
1. 2 hogs per year on 0.6 acres and and each cow takes 1.0 acres
is linear
2. linear relationship between labor and number of animals.
3. housing requirement is 10 sq ft/hog each week, throughout
the year, and the maximum number of hogs per year is 200
• In QuattroPro, Optimizer refers to the objective function as the formula
we want to maximize (or minimize). This formula is entered into a
spreadsheet cell, which is called the solution cell.
AI3021/ITAS/IV CSE/VII SEM/KG-KiTE
LP Matrix
AI3021/ITAS/IV CSE/VII SEM/KG-KiTE
Objective Function
• In the Cell C8,C9 and C10
• Calculate the total profit for any particular numbers of hogs, X1, and
cattle, X2, in this way:
10 * X1 + 15 * X2 = total profit (to be maximized)
AI3021/ITAS/IV CSE/VII SEM/KG-KiTE
Constraint Equations
• Now only one detail remains to finish the spreadsheet entries.
Expressions must be entered for each constraint that describe the
amount of that constraint used by each activity.
• Example: the concept for the amount of land used is:
AI3021/ITAS/IV CSE/VII SEM/KG-KiTE
Concept of the Mathematical
Model
• Simple form is a model of the problem
• The three constraint equations tell us the rules of the problem.
• Objective function, which tells us what we wish to optimize and how
much each hog and each head of cattle contribute to that objective
• Do this by entering 20 in cell C8 for number of hogs and 10 in Cell C9
for number of cattle. Note that immediately the profit is shown to be
$350, 16 acres of land are used, 5 hours of labor, and 200 sq ft of
housing.
• call up the Optimizer dialog box, Provides Optimizer report
AI3021/ITAS/IV CSE/VII SEM/KG-KiTE
Conclusion
• Model linear problems to find a unique solution that meets a
condition, minimizing or maximizing, a linear objective function.
• Constraint equations have been formed to define the ‘‘rules’’ of the
problem, and the spreadsheet Optimizer allows trial values to be
entered in the variable cells, giving solutions to the constraint
equations.
• This has been done without using the objective function, thereby
demonstrating the modeling of the problem. For example, in the
feed-mixing problem, if 100 is entered for Corn, 100 appears in the
constraint cell for Total Feed.
AI3021/ITAS/IV CSE/VII SEM/KG-KiTE
Thank
You!
AI3021/ITAS/IV CSE/VII SEM/KG-KiTE
