Thanks to visit codestin.com
Credit goes to www.scribd.com

Scribd
Upload
36 views3 pages

Math 3c/d Linear Programming

This document discusses linear programming and how to solve linear programming models graphically. It describes determining the objective function and constraints, sketching the feasible region, and minimizing or maximizing the objective function by comparing values at the vertices. It then provides an example problem about allocating land for tomatoes and lettuce to minimize project costs, and outlines the steps to solve it using a linear programming model.

Uploaded by

Daksh Parashar
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
36 views3 pages

Math 3c/d Linear Programming

This document discusses linear programming and how to solve linear programming models graphically. It describes determining the objective function and constraints, sketching the feasible region, and minimizing or maximizing the objective function by comparing values at the vertices. It then provides an example problem about allocating land for tomatoes and lettuce to minimize project costs, and outlines the steps to solve it using a linear programming model.

Uploaded by

Daksh Parashar
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/ 3

Math 3c/d Linear programming

Modelling of real world problems


Maximizing/Minimising functions (objective function) subjected
to linear constraints

Graphical procedure to solve linear


programming models

Determine the objective functions and associated variables


Write down objective function in terms of the variables
Determine constraints and equivalent inequalities
Sketch the feasible region check if integer solutions are
required
Minimise or maximize the objective function by determining
and comparing the values of the objective function at each
vertices (extreme point theorem)

E.g. OT Lee Pg. 169


Nick has a block of land with an area of 1000 m2 which Nick hopes
to turn into small vegetable garden. Fertilizer, watering and
maintenance costs are $1.50/m2 and $2/m2 to plant a crop of
tomatoes and lettuce respectively. Nick intends to utilize not more
than twice as much land for tomatoes than lettuces. Nick estimates
that he and his family will spend 5 hours/m2 and 3-hours/m2
respectively for a crop of tomatoes and lettuces. This includes time
for preparing the ground, maintenance and harvesting. Nick and his
family have 4000 hours of time available for this project.
Construct a linear programming model to determine how much land
should be allocated to tomatoes and lettuces such that the project
cost is minimised.
Solution
Determine the objective function and variables

Constraints

Express constraints as inequalities

Sketch the feasible region

Minimise/Maximize the objective function

Min Cost: $1538.46

You might also like