Introduction to Operations Research

•The Operations Research was referred as "Operational

Research” by British and Europeans, and the Americans
referred as "Operations Research“, but both are often
shortened to just "OR". Another term which is used for this
field is "Management Science - MS.

• The Americans sometimes combine the terms OR and MS

together and say "ORMS". Yet other terms sometimes used
are "Industrial Engineering“- IE, "Decision Science“ - DS, and
“Problem Solving”.

•In recent years there has been a move towards a

standardization upon a single term for the field, namely OR.
 What is Operations Research?

Operations: The activities carried out in an organization.

Research: The process of observation and testing characterized by

scientific method. Situation, problem statement, model
construction, validation, experimentation, candidate solutions.

Operations Research is the scientific approach to execute

decision making, which consists of:
 The art of mathematical modeling of complex situations
 The science of the development of solution techniques used
to solve these models
 The ability to effectively communicate the results to the
decision maker.
 What is Operations Research?
•It is a quantitative approach to decision making based on
the scientific method of problem solving.

•Operations Research is a scientific approach to decision

making that seeks to best design and operate a system,
usually under conditions requiring the allocation of scarce
resources.

•OR is the branch of science dealing with techniques for

optimizing the performance of systems.

•OR is the representation of real-world systems by

mathematical models together with the use of quantitative
methods for solving such models, with a view to optimizing.
 History of OR
It had its early roots in World War II and is flourishing in business and
industry with the aid of computer.
Substantial research in OR done mainly by military scientists.
 Methodology (Phases of OR)
Step 1. Formulate the Problem: OR analyst first defines the organization's problem. Defining
the problem includes specifying the organization's objectives and the parts of the organization
(or system) that must be studied before the problem can be solved.

Step 2. Formulate a Mathematical Model of the Problem: The analyst, develops a

mathematical model of the problem. In this many mathematical techniques that can be used to
model systems will be discussed.

Step 3. Obtaining the solution: In this step, problem will be solved using mathematical model
selected in step 2.

Step 4: Validation of the Model: The analyst cheque the validity of the model by verifying the
results and determine how well the model fits reality.

Step 5: Implement and Evaluate Recommendation: If the results are fruitful, the analyst
aids in implementing the recommendations. The system must be constantly monitored to ensure
that the recommendations are enabling decision maker(s) to meet their objectives.
 Model Development
• Model is defined as an idealized representation of real object.

• Models are the representations of real objects or situations.

• Three forms of models are iconic, analog, and mathematical.

Iconic models are physical replicas of real objects. Iconic

models are look alike models. Ex: Scaled down Model of an
Automobile, building, Toys, etc.

Analog models are physical in form, but do not physically

resemble the object being modeled. Ex: Graphs, Charts, tec.

Mathematical models represent real world problems through

a system of mathematical formulas and expressions based on
key assumptions, estimates, or statistical analyses. Ex: V = IR
 Features of OR
i. Use of scientific method (“research”)
• Careful observation of a phenomenon, called data gathering
• Model for hypothesis: model should be good representation of reality
• Experiments: to test hypothesis
• Model validation: verify against fresh data
• Uses Software packages for LP/IP/NLP: CPLEX, LINGO, SAS

ii. Search for optimality

Find a “best” solution w.r.t. measure of performance
(Maximizes or Minimizes the Objective function s.t. constraints

iii. OR techniques rely on algorithms:

 iterative procedures
 computer application natural choice

iv. For a full-fledged implementation, OR applications go beyond many discipline

boundaries, A team-like approach works best here
Ex: Mathematics, Statistics, Economics, Computer Science, Engineering
v. Broadly applicable
 Different organizations (manufacturing, transportation, construction, telecom, military)
 Diverse problems: Complex (airline scheduling)
 Important (safety, health care): inventory management in blood bank
 New Product Development: Forecasting demand, choosing advertising levels, etc.
 Operations Research Models
Deterministic Models Stochastic Models
•Linear Programming • Discrete-Time Markov Chains
•Network Optimization • Continuous-Time Markov Chains
•Integer Programming • Queuing Theory (waiting lines)
•Nonlinear Programming • Decision Analysis
• Game Theory
• Inventory Models & Simulation
Deterministic models
 assume all data are known with certainty
 involve optimization
Stochastic models
• represent uncertain data via random variables or stochastic processes.
• characterize / estimate system performance
 Basic concepts of Mathematical Modelling

A mathematical model as consisting of:

Decision variables, which are the unknowns to be determined

by the solution to the model.

Constraints to represent the physical limitations of the system

Objective Function defines the goal of the real system, which

maximizes the income/profit or minimizes the losses.

An optimal solution to the model is the identification of a set

of variable values which are feasible (satisfy all the constraints)
and which lead to the optimal value of the objective function.
 Applications of OR
• Rescheduling aircraft in response to groundings and delays

• Planning production for printed circuit board assembly

• Scheduling equipment operators in mail processing &

distribution centers

• Developing routes for propane delivery

• Adjusting nurse schedules in light of daily fluctuations in

demand.

• Developing strategies for players

 Linear Programming Problem (LPP).

Linear programming Problem may be defined as the problem of

maximizing or minimizing a linear function that is subjected to
linear constraints.

It is an optimization method to maximize or minimize the

objective function of the given mathematical model with a set of
requirements which are represented in the linear relationship.

Components of Linear Programming

•Decision Variables
•Constraints
•Data
•Objective Functions
 Characteristics of Linear Programming
• Decision Variables: The decision variables are the alternate options
available to the decision maker which will decide the output. It gives
the ultimate solution of the problem. For any problem, the first step is
to identify the decision variables.

• Linearity: The relationship between two or more variables in the

function must be linear. It means that the degree of the variable is one.

• Objective Function: In a problem, the objective function should be

specified in a quantitative way.

• Constraints: The limitations should be expressed in the mathematical

form, regarding the resource.

• Non-negativity: The variable value should be positive or zero. It

should not be a negative value.
 Steps in LP Model Formulation

Step 1: Identify the decision variables:

Unknown quantities whose value will provide solution of the problem

Step 2: Identify the objective function: Target to be achieved

Optimizing: maximizing - profits, sales minimizing - costs should give
unique best solution.

Step 3: Identify the constraints: restrictions on the values of the

decision variables
Step 4: Construct mathematical expressions for objective function
and constraints
 Assumptions of LP Model
1. Proportionality: The contribution of each decision variable
in both the objective function & the constraints to be
directly proportional to the value of the variable. In other
word, double the amount, double the profit contribution or
resource consumed.

2. Additively: The total contribution of all the variables in the

objective function and in the constraints to be the direct
sum of the individual contributions of each variable.

3. Divisibility: Continuous ( non- integer) value of decision

variables possible.

4. Certainty (Deterministic): All parameters are known

constraints
Methods to Solve Linear Programming Problems

The linear programming problem can be solved using

different methods:

i. Graphical method

ii. Simplex method, or

iii. By using tools such as R

iv. Open solver, etc.

Here, we will discuss the two most important

techniques called the simplex method and
graphical method in detail.
 Examples of LPP
1. Product Mix Problem
A computer manufacturing firm is planning to manufacture desktop computers and Laptops. The
assembly line facility is available only for 150 hours per week and it is common for both the type
of computers. The time required to manufacture each desktop is 3 Hrs and for Laptop 5 hours is
required. Laptops require a special type of display and only 20 such displays can be imported per
month. Each desktop occupies 8 CFT space and laptop require 5 CFT to store in the air-
conditioned room, which is of 300 CFT. The profit per unit is Rs. 50/- and 40/- respectively for
Desktop and laptop. Formulate this problem as a product mix problem and find out the number
of desktops and laptops to be manufactured on each month.

Let x 1 be the No. of Disktop manufactured/week and

x 2 b e t h e N o . o f Portable ma nufactured/wee k

Maximize, Z = 50x1 + 40x2

Subject to: 3x1 + 5x2 ≤ 150 (Assembly time)

x2 ≤ 20 (special component)
8x1 + 5x2 ≤ 300 (warehouse space)
x1, x2 ≥ 0
2. Advertising Media Selection
An advertising company wishes to plan an advertising campaign in three different media –
TV, Radio and Magazines to reach as many potential customers as possible. The
purpose of the advertising program is to reach as many potential customers as possible.
Results of a market study are given below:
Television Radio Magazine
Daytime Prime time

Cost of an advertising unit (Rs.) 40,000 75,000 30,000 15,000

No. of potential customers reached per unit 400000 500000 900000 200000
No. of women customers reached per unit 300000 400000 200000 100000

The company does not want to spend more than Rs.800,000 /- on advertising. Further
i. A least 2 million exposures take place among women;
ii. Advertising on television be limited to Rs. 500,000/- ;
iii. At least 3 advertising units be bought on daytime television, and 2 units
during prime time; and
iv. No. of advertising units on radio & magazine should each be between 5 & 10
Let x1 = Number of advertising units bought in daytime television
x2 = Number of advertising units bought in prime time television
x3 = Number of advertising units bought in radio
x4 = Number of advertising units bought in magazines

Zmax. = 400,000x1 + 900,000x2 + 500,000x3 + 200,000x4

S.T. 40,000x1 + 75,000x2 + 30,000x3 + 15,000x4 ≤ 800,000 (advertising budget)
300,000x1 + 400,000x2 + 200,000x3 + 100,000x4 ≥ 2,000,000 (women customers)
40,000x1 + 75,000x2 ≤ 500,000 (television advertisement)
x1 ≥ 3 (advertising units on daytime)
x2 ≥ 2 (advertising units on prime time)
x3 ≥ 5 (advertising units on radio)
x3 ≤ 10 (advertising units on radio)
x4 ≥ 5 (advertising units on magazines)
x4 ≤ 10 (advertising units on magazines)
 3. Bus Scheduling Problem
3. City bus service is planning to introduce a mass-transit bus system. The number of buses
required during each 4-hour shift is given below. To carry out the required daily
maintenance, each bus can operate 8 successive hours a day only. Schedule the buses to meet
the each 4-hr shift requirement while minimizing the total number of buses in operation.

Shift 12am-4am 4am-8am 8am-12pm 12pm-4pm 4pm-8pm 8pm-12am

Busses needed 4 8 10 7 12 4

• Decision variables: Minimize Z = x1 + x2 +x3 +x4 +x5 + x6

x1= number of buses starting at 12:00 am
Subject to the following constraints
x2= number of buses starting at 4:00 am
x3= number of buses starting at 8:00 am x1 + x6 ≥ 4
(12:00 am - 4:00 am)
x4= number of buses starting at 12:00 pm x1 + x2 ≥ 8
(4:00 am - 8:00 am)
x5= number of buses starting at 4:00 pm x2 + x3 ≥ 10
(8:00 am - 12:00 noon)
x6= number of buses starting at 8:00 pm x3 + x4 ≥ 7
(12:00 pm - 4:00 pm)
x4 + x5 ≥ 12
(4 :00 pm - 8:00 pm)
x5 + x6 ≥ 4
(8:00 pm - 12:00 am)
x j ≥ 0, j = 1,2,..,6
 4. Load Balancing Problem
A machine shop has one drill machine and five milling machines, which are
to be used to produce an assembly of two parts, 1 and 2. The productivity
of each machine for the two parts is given below:

Production time in minutes per piece

Part Drilling Machine Milling Machine
1 3 20
2 5 15

It is desired to maintain a balanced loading on all machines such

that no machine runs more than 30 minutes per day longer than
any other machine (assume that the milling load is distributed equally
among all five milling machines). Divide the work time of each machine to
obtain the maximum number of completed assemblies assuming an 8-hour
working day.
Decision Variables:
x1 = number of part 1 produced per day x 2 = number of part 2 produced per day
y = number of completed assemblies, then y = minimum of (x1, x2)
Objective: Maximize y = Maximize (minimum of (x1, x2)) Equivalent to this: Maximize y,
Subject to y ≤ x1, y ≤ x2
Load on each milling m/c (in minutes)= (20x1 + 15x2 )/5 = 4x1 + 3x2 Load on the drill m/c
(in minutes)= 3x1 + 5x2
Total time available per day = 8x60 = 480 minute Z max = y
Thus, the time restriction on each machine S.T. y ≤ x1
y ≤ x2
For each milling m/c, 4x1 + 3x2 ≤ 480 4x1 + 3x2 ≤ 480
For the drill press, 3x1 + 5x2 ≤ 480 3x1 + 5x2 ≤ 480
The load balance constraint can be represented by x1 – 2x2 ≤ 30
|(4x1 + 3x2 ) – (3x1 + 5x2 )| ≤ 30 – x1 + 2x2 ≤ 30
or, | x1 – 2x2 | ≤ 30 (non-linear constraint) equivalent x1 ≥ 0,
to this: x1 – 2x2 ≤ 30 and – x1 + 2x2 ≤ 30 x2 ≥ 0
y≥0
 Solution to LPP by Graphical method

•Graphical method is used to solve an LPP with only

two-variables.
•It involves formulating a set of linear inequalities
subject to the constraints.
•Then the inequalities are plotted on an X-Y plane.
•Once having plotted all the inequalities on a graph, the
intersecting region gives the feasible region.
•The feasible region explains what all values the given
model can take and it also gives the optimal solution.
Important terms in LPP
• Boundary Constraints or Restrictions: Each constraint
boundary is a line (plane) that forms the boundary of what is
permitted by the corresponding constraint.

• Corner points (or extreme points) solutions: Points of

intersection of constraint boundaries.
• Feasible solution: A solution for which all constraints are
satisfied. e.g. any point within feasible region.
• Infeasible solution
• A solution for which at least one constraint is violated.
• Feasible region
It is collection of all feasible solutions.
1. A computer manufacturing firm is planning to manufacture desktop computers
and Laptops. The assembly line facility is available only for 150 hours per month
and it is common for both the type of computers. The time required to manufacture
each desktop is 3 Hrs and for Laptop 5 hours is required. Laptops require a special
type of display and only 20 such displays can be imported per month. Each desktop
occupies 8 CFT space and laptop require 5 CFT to store in the air-conditioned room,
which is of 300 CFT. The profit per unit is Rs. 50/- and 40/- respectively for Desktop
and laptop. Formulate this problem as a product mix problem and find out the
number of desktops and laptops to be manufactured on each month.

x1 - be the number of Disktops to be manufactured/ month

x2 - be the number of Portable ma nufactured/ month
Maximize, Z = 50x1 + 40x2

Subject to: 3x1 + 5x2 ≤ 150 (Assembly time)

x2 ≤ 20 (special component)
8x1 + 5x2 ≤ 300 (warehouse space)
x1, x2 ≥ 0
LP Formulation Solution X1 X2 Z = 50X1
point + 40X2
Maximize, Z = 50x1 + 40x2
A 0 0 0
Subject to: 3x1 + 5x2 ≤ 150….1
B 37.5 0 1875
x2 ≤ 20……2
C 30 12 1980
8x1 + 5x2 ≤ 300….3
60 D 16.67 20 1633.33
x1, x2 ≥ 0 E 0 20 800
50
X2
3
40

30

20 E D 2

C
The company has to produce 30 10 1
Feasible region
desktops and 12 laptops, which A B
10 20 30 40 50 60
contributes a maximum profit of
Rs. 1980/- per month. X1
 ii. Slope-Intercept Approach

• First put Z= 0 (say)

Let Z =50x1 + 40x2 = 0,

Let Z =50x1 + 40x2 = 100,

Let Z =50x1 + 40x2 = 800,

•If any (x1, x2) combination on this straight

line is feasible, increase Z.
X2 = MX1 + C
•Objective function: Z = 50x1 + 40x2 50x1 + 40x2 = 200

X2 = - 50/40 X1 + 5
=> (30,12) optimal and Z optimal or Z max = 1980
M = -5/4 and
C=5
2.A farmer has recently acquired a 110 hectares piece of land. He has decide to
grow Wheat and Barley on that land. Due to the quality of sun light and the
region’s excellent climate, the entire production of Wheat and Barley can be sold.
He wants to know how to plant each variety in the 110 hectares, given the costs,

net profits and labor requirements according to the data shown below: The farmer
has a budget of Rs.10,000 and availability of 1,200 man-days during the planning
horizon. Find the optimal solution and optimal value.

Variety Cost (Rs./Hect.) Net Profit (Rs./Hect.) Man-Days/Hect.

Wheat 100 50 10
Barley 200 120 30

Let X & Y are the number of hectares of land wheat and Barley to be planted respectively.

Max Z = 50X + 120Y

100X + 200Y ≤ 10,000
10X + 30Y ≤ 1200
X + Y ≤ 110
X ≥ 0, Y ≥ 0
X=0, Y=50; Y=0, X=100 Y=MX+C
M is the Slope = Y/X = -5/120
X=0, Y =40; Y=0, X=120 50X + 120Y = 6000
& C = 50 (It is a point where
X=0, Y=110; Y=0, X=110 120Y = -50X +6000
the slope line meets Y axis)
Y = - 50 /120 X + 50
= - 50/120 X +50
Y From the graph, it is clear
Y that Z is maximum at C.
50 120
3 At C, X= 40 & Y = 20.
C 100 Max Z = 50X + 120Y
X = 50 *60 +120*20
80
0 120
= Rs. 5400/-.
1 60
The company has to plat Barley for2 40 D
40 Hectares & Wheat for 20
20 C
Hectares, which yields a maximum Feasible region
B
profit of Rs. 5400/-
A X
20 40 60 80 100 120
3. The manager of an oil refinery must decide on the optimal mix of two possible
blending processes of which the input and output per production run are as follows:

Process Input (units) Output (units)

Crude A Crude B Gasoline X Gasoline Y
1 5 3 5 8
2 4 5 4 4

The maximum amount of crude available is 200 units of crude A and 150 units of
crude B. The market requirement shows that at least 100 units of gasoline X and 80
units of gasoline Y must be produced. The profit per production run for process 1
and 2 are Rs. 3 and 4 respectively. Formulate a suitable mathematical model.
Let X1 – be the number of production runs of process-1
X2 – be the number of production runs of process-2

Max. Z = 3X1 + 4X2

S.T. 5X1 + 4X2 ≤ 200

3X1 + 5X2 ≤ 150
5X1 + 4X2 ≥ 100
8X1 + 4X2 ≥ 80
X1, X2 ≥ 0
4. A company manufacturing medicines proposes to
produce 2 medicines A & B. There are sufficient
ingredients available to produce 10000 bottles of A &
20000 bottles of B. There are only 23,000 bottles are
available, into which either of the medicines can be
filled.

It takes 3 hours to produce 1000 bottles of A and 1 hour

to produce 1000 bottles of B and 33 production hours
available for the operation. The company earns a profit
of Rs.16/- per bottle of A and Rs. 14/- per bottle of B.
Determine the optimal product mix by graphical method.
5. A company manufactures washing machines and driers. The
major manufacturing departments and their monthly capacities are
as follows: The contribution to profit is Rs. 900/- per washing
machine and Rs.1000/- per drier. Determine the optimum product
mix and profit.

Sl. No Departments Monthly capacities in units

Washing M/c Drying m/c
1 Stamping 10000 or 10000
2 Motor & Transmission 16000 or 7000
3 Assembly line for washing 9000 ------
machine
4 Assembly line for Dryers ------ 5000
Feasible region
6. A company produces two types of leather belts of type A and type B.
Profits on the two types of belts are Rs. 4/- & Rs. 3/- respectively. Each belt of
type A requires twice as much time as required by a belt of type B. If all the
belts were of type B, the company could produce 1000 belts/day. The supply of
leather is sufficient only for 800 belts/day (both A & B combined). Belt A
requires a fancy buckle and only 400 such buckles are available/day. For belt B
only 700 buckles are available/day. How should the company manufacture the
two types of belts in order to maximize the profit?
7. Old hens can brought at Rs.200/- each and young one costs of Rs.500/- each.
Old hens lay 3 eggs/week and the young ones lay 5 eggs/week, each egg being
sold at 3 Rs. A hen costs Rs.10/- per week to food. If a person has only Rs.8000/-
to spend on hens, find graphically how many old and new hens should be purchase
assuming that accommodation facility is available is only for 20 hens.
8. The butcher shop traditionally makes a new dish
from a combination of ground beef and ground
pork. The ground beef contains 80% meet & 20%
fat and costs the shop Rs. 800/-kg. The ground
pork contains 68% meet & 32% fat and costs Rs.
600/-kg.

How much of each kind of meet should the shop

use in each kg of meet loaf if it wants to minimize
its cost and keep the fat content of the meet loaf
to no more than 25%. Solve graphically.
800X1 + 600X2 = 100
X2 = -.8/.6 X1+ 100/600
9. A customer requires 220 kg of a certain chemical consisting of two raw materials
- phosphate compound and chromate compound. Phosphate compound costs
Rs.14/- per Kg and Chromate compound costs Rs.21/-per Kg. Determine the least
cost mix for a batch of 220 kg of the product. The specifications of the chemical are
as follows:
i. The mix must contain at least 65 kg of chromate compound
ii. The mix should not contain more than 85 kg phosphate compound.
10. A company can advertise its product by using local radio and TV stations. Its budget limits
the advertisement to Rs. 1000/- a month. Each minute of radio advertisement costs Rs.5/- and
each minute of TV advertisement costs Rs. 100/-. The company would like to use the radio at
least twice as much as the TV. Past experience shows that each minute of TV advertisement will

usually generate 25 times as many sales as each minute of radio advertisement. Determine the
optimal allocation of the monthly budget to Radio and TV advertisements.
11. A fertilizer company intends to market a new fertilizer which is to be a mixture
of two ingredients A & B. The properties of the two ingredients are as follows:

Ingredients
Cost/kg Bone Nitrogen Lime Phosphor
(Rs) metal ous
Ingredient - A 2 20% 30% 40% 10%

Ingredient – B 1.5 40% 10% 45% 5%

It has been decided that:

i. the minimum fertilizer will be sold in bags containing a minimum of 50 kg

ii. it must contain at least 15% Nitrogen
iii. it must contain at least 8% Phosphorous
iv. it must contain at least 25% Bone metal
The company wishes to meet the above requirements at the minimum cost
possible. Determine the optimum values of ingredients and corresponding cost.
12. Two different types of food stuffs F1 & F2 are containing vitamins V1,
V2 & V3. Minimum daily requirements of these vitamins are 3 mg of V1,
60 mg of V2, and 20 mg of V3. Food stuff F1 contains 2 mg of V1, 90 mg
of V2, and 5 mg of V3 and food F2 contains 2 mg of V1, 10 mg of V2, and
80 mg of V3. Cost of 1 unit of F1 is Rs. 15/- and that of F2 is Rs. 24/-/
Find the minimum cost of food stuffs, that would be supply the required
amounts of each vitamins to the body.

Let X1 – be the number of food stuffs of type F1

X2 – be the number of food stuffs of type F2

Min. Z = 15X1 + 24X2

S.T. 2X1 + 2X2 ≥3

90X1 + 10X2 ≥ 60
5X1 + 80X2 ≥ 20
X1, X2 ≥0
13. A hostel student has to prepare two subjects for the next day’s
IA tests. Each hour of study he devotes to paper A is expected to
give a return of 6 marks and each hour devoted to paper B is
expected to give a return of 5 marks. He has to download the
study material required for his study. He feels that 1GB data
consumed in 12 minutes to download the study material for Paper-
A and 1 GB consumed in 20 minutes to download paper-B. The
student has only 15 GB data with him. The time is running short
and only 4 hours are available for preparation. It is necessary that
he should devote at least 2 hours to prepare for both the papers.
He wants to score maximum marks. Formulate the problem as an
LPP and determine the optimum schedule for preparation for his
coming test
14. A manufacturer of patent medicines is proposed to produce two medicines A and
B. There are sufficient ingredients available to make 20,000 bottles of medicines – A
and 40000 bottles of medicine – B, but there are only 45000 bottles are available,
into which either of the medicines can be filled. Further, it takes three hours to
prepare enough material to fill 1000 bottles of medicines – A and one hour to
prepare enough material to fill 1000 bottles of medicine – B, and there are 66 hours
available for this operation. The profit is Rs. 8 per bottle for medicine – A and Rs. 7
per bottle for medicine - B. Formulate the problem as an LPP and find the optimal
solution.

Let X1 – be the number of bottles of medicine-A proposed to produce

X2 – be the number of bottles of medicine-B proposed to produce

Max Z = 8000X1 + 7000X2

S.T. 3X1 + X2 ≤ 66
1X1 + 1X2 ≤ 45
X1 ≤ 20,
X2 ≤ 40,
X 1, X 2 ≥ 0
15. A former has to plant two kinds of trees P and Q in a land of 4000 Sq-meter
area. Each tree P requires 25 Sq. m and each Q requires 40 Sq-meter of land. The
annual water requirement for each tree P is 30 units and for each tree Q is 15
units. At most 3000 units of water is available annually. It is also estimated that
the ratio of the total number of trees Q to the number of trees P should not be
less than 6/19 and should not be more than 17/8. The return per tree from P is
expected to be one and half times as much as from tree Q. Formulate the
problem as a LP model and find the optimal solution for planting trees.

Let X1 – be the number of P-type trees to be planted

X2 – be the number of Q-type trees to be planted

Max Z = 1.5X1 + X2

S.T. 30X1 + 15X2 ≤ 3000

25X1 + 40X2 ≤ 4000
X2 / X 1 ≥ 6/19
X2 / X 1 ≥ 17/8
X1, X2 ≥0
 No feasible solution: For any objective function
x2

x1
 Unbounded solution

x2

x1

In both cases, No Optimal Solution

Unbounded feasible region

x2
B
(0, 14)

(0, 2)
C
x1
(4, 0) (12, 0)