OPERATING RESEARCH (OR)

Prof. Osama Emam

Prof. Osama Emam

 1. Question 1: What is Operations Research?

Operations Research is a field that applies mathematical and analytical methods to solve complex
problems related to decision-making and optimization. It uses techniques such as mathematical
modeling, statistical analysis, and simulation to help organizations make better strategic and
operational decisions. Operations Research aims to optimize processes, improve efficiency, and
maximize resources by considering factors like constraints, uncertainty, and trade-offs. It finds
applications in various domains, including logistics, supply chain management, finance,
healthcare, and transportation.

2. Question 2: What are the most prominent Operations research

techniques?

a. Linear Programming
b. Include Integer Programming
c. Dynamic Programming
d. Network Programming
e. Nonlinear Programming

3. Question 3: what are the phases for implementing Operations

research?
f. Definition of the problem.
g. Construction of the model.
h. Solution of the model.
i. Validation of the model.
j. Implementation of the solution.
 4. Question 4: How computer has helped us to solve OR
problems?
Computers have played a crucial role in popularizing operations research (OR) in several ways:

1. Faster and more complex calculations: Computers have significantly enhanced the
capability of solving complex mathematical models and optimization problems. OR techniques,
such as linear programming and simulation, that were once tedious and time-consuming to solve
by hand, can now be executed quickly and effectively with the help of computers.

2. Increased data processing: With the advent of computers, the ability to process and analyze
large volumes of data has expanded immensely. This has allowed OR practitioners to deal with
more intricate and realistic models, incorporating numerous decision variables and constraints.

3. Improved decision support systems: Computers have facilitated the development of

powerful decision support systems (DSS) that incorporate OR techniques. These systems provide
managers and decision-makers with valuable insights and recommendations through user-friendly
interfaces, leading to more informed and effective decision-making.

4. Enhanced modeling capabilities: Computer-based OR tools have enabled the development

of advanced modeling techniques. Optimization algorithms, statistical analysis, and simulation
models can now be built and tested with greater ease and accuracy, boosting the overall
effectiveness of OR in practical applications.

5. Accessibility and availability: The widespread use and affordability of computers have made
OR more accessible. Researchers and practitioners can now leverage OR techniques without
extensive manual computations or the need for specialized hardware.

5. Question 5: Give key features of Operations Research features

of OR?

1. Problem Formulation: OR starts by defining the problem clearly and formulating it in a mathematical
or analytical model. This involves identifying the decision variables, constraints, objective function, and
other important parameters.

2. Mathematical Modeling: OR heavily relies on mathematical models to represent real-world systems

and decision problems. These models can be linear or nonlinear, deterministic or stochastic, and can
involve optimization, simulation, or queuing theory.

3. Optimization: Optimization is a fundamental aspect of OR. It involves finding the best solution
among various alternatives, considering specific objectives and constraints. OR employs optimization
techniques such as linear programming, integer programming, dynamic programming, and metaheuristics
to find optimal or near-optimal solutions.
 5. Decision Analysis: OR helps in making informed decisions by analyzing various scenarios and
evaluating the potential outcomes. Decision Analysis tools, such as decision trees, influence diagrams,
and game theory, are used to analyze different strategies and their consequences.

6. Simulation: Simulation is used in OR to model real-world scenarios and understand system behavior
under different conditions. Monte Carlo simulation and discrete-event simulation are common techniques
used to simulate complex systems and evaluate their performance.

7. Forecasting and Predictive Analytics: OR uses statistical methods and time-series analysis to
forecast future demand, sales, or other variables. These forecasts are crucial for planning and decision-
making in industries like supply chain management and finance.

6. Question 6 : Briefly discuss the technique and tools of OR?

1. Mathematical Programming Solvers: Software tools like CPLEX, Gurobi, and LP Solver provide
optimization solvers for linear programming, mixed-integer programming, and other mathematical
programming problems.

2. Simulation Software: Tools like Arena, Simio, and AnyLogic offer simulation capabilities to model
and analyze complex systems and processes.

3. Statistical Analysis Software: Packages such as R, Python (with libraries like NumPy and Pandas),
and SAS are commonly used for statistical analysis, forecasting, and predictive analytics.

4. Decision Analysis Tools: Software like PrecisionTree and Analytica help in decision analysis,
allowing users to construct decision trees, perform sensitivity analysis, and assess the value of
information.

7. Question 7 : What is linear programming?

Linear programming is a mathematical optimization technique used to determine the best possible
outcome in a model with linear relationships. It involves solving linear equations and inequalities
to optimize a linear objective function, while considering certain constraints. In simpler terms,
linear programming helps find the best solution to a problem when several choices are available
and there are limitations or restrictions on resources. It has various applications in fields like
economics, supply chain management, engineering, and finance.
8. Question 8: Discuss the application of linear programming to
help us to take decision-making.
1. Production planning: Linear programming assists in determining the optimal production
levels for different products or services. By considering factors like demand, availability
of resources, production capacities, and market conditions, managers can plan production
schedules and make informed decisions about the quantities to produce in order to
maximize profits or meet customer demand efficiently.

2. Inventory management: Efficient management of inventory is crucial for businesses to

minimize costs while ensuring a sufficient supply of goods. Linear programming helps
managers determine optimal inventory levels by considering factors like demand patterns,
production capacities, ordering costs, holding costs, and storage constraints. It enables
them to strike a balance between stocking enough inventory to meet demands and
minimizing holding costs.

3. Supply chain management: Linear programming assists in optimizing supply chain

operations, including sourcing, transportation, and distribution. Managers can use it to
determine the most cost-effective routes for transportation, allocate resources across
different stages of the supply chain, and optimize production and distribution centers'
locations. By considering multiple constraints and variables, managers can make decisions
that minimize costs and maximize service levels.

4. Financial planning: Linear programming can aid in financial planning by optimizing the
allocation of financial resources. It helps managers determine the best mix of investments,
loans, and other financial instruments to maximize returns or minimize costs while
considering constraints like risk tolerance, interest rates, and return expectations. This can
support decision-making regarding capital budgeting, portfolio management, and financial
risk analysis.
 9. Question 9 : What are the essential characteristics of a linear
programming model?

1. Objective Function: A linear programming model must have a well-defined objective

function, which represents the goal to be maximized or minimized. It is typically a linear equation
that combines decision variables.

2. Variables: These are the unknowns that represent the decisions to be made. They are
typically denoted by symbols and are subject to certain constraints.

3. Constraints: Linear programming models have a set of linear constraints that restrict the
values of decision variables. These constraints can represent limitations on resources,
requirements, or limitations on feasible solutions.

4. Non-negativity: Decision variables in linear programming models are typically non-

negative, meaning they cannot take negative values. This restriction is imposed to reflect realistic
situations.

10. Question 10: what is the steps for FORMULATION OF

linear programming Problem STEPS

1. Identify decision variables

2. Write objective function
3. Formulate constraints
 11. Question 11:
Reddy Mikks produces both interior and exterior paints from two
raw materials, M1 and M2. The following table provides the basic
data of the problem:

The daily demand for interior paint cannot exceed that for exterior paint by more than 1 ton. Also,
the maximum daily demand for interior paint is 2 tons. Reddy Mikks wants to determine the
optimum (best) product mix of interior and exterior paints that maximizes the total daily profit.

Solution:
All OR models, LP included, consist of three basic components:
1. Decision variables that we seek to determine.
We need the value of x1,x2
x1 = tons produced daily of Exterior paint
x2 = tons produced daily of interior paint

2. Objective (goal) that we need to optimize (maximize or minimize).

Let z represent the total daily profit (in thousands of dollars)
Z max = 5x1 + 4x2

3. Constraints that the solution must satisfy.

1. 6 x1 + 4 x2 < 24 (raw material M1)
2. x1 + 2 x2 < 6 (raw material M2)
3. x2 - x1 < 1 Market Limit
 4. x2 < 2 Demand Limit
5. x1 > 0
6. x2 > 0
We need determine the value of x1,x2
Solving Constraints:
First one
6 x1 + 4 x2 < 24
1. 6x1 + 4x2=24
2. We put X1=0, = x2=24/4=6 (0,6)
3. We put X2=0, = x1=24/6=4 (4,0)
Second one
x1 + 2x2 < 6
1. X1 + 2x2=6
2. We put X1=0  x2=6/2=3 (0,3)
3. Putting X2=0 ,  x1=6 (6,0)

Third one:
x – 2x 1< 1
1. X2-x1=1
2. When x1=0,then x2=1 (0,1)
3. When x2 =0, then x1=-1 (-1,0)
Fourth one:
x2 < 2
1. x2 =2

2. x1 ,x2 > 0 Non-negativity

Fifth one:
x1 > 0
Sixth one:
x2 > 0
 12. Question 12

The Marvel Toy Company wishes to make three models of boats for the most profit. They found that a
model of a steamship takes the cutter one hour, the painter 2 hours, and the assembler 4 hours of work. It
produces $6 of profit. Their model of a four-mast sailboat takes the cutter 3 hours,
the painter 3 hours, and the assembler 2 hours. It produces $3 of profit. Their model of a two-mast sailboat
takes the cutter one hour, the painter three hours, and the assembler one hour. It produces $2 of profit. The
cutter is only available for 45 hours, the painter for 50 hours, and the assembler for 60 hours. Assuming
that they can sell all the models that are built, find the constraints of the problem, and describe how
the solution is obtained.

Solution:
The constraints are:
(1) X ≥ 0 There cannot be a negative number of models of steamships.
(2) Y ≥ 0 There cannot be a negative number of models of four-mast
sailboats.
(3) Z ≥ 0 There cannot be a negative number of models of two-mast
sailboats.

(4) The cutter has only 45 hours available there is the constraint:
X + 3Y + Z ≤ 45.
(5) the painter has only 50 hours of time available, there is the constraint:
2X + 3Y + 3Z ≤ 50.
(6) the assembler can work only 60 hours, there is the constraint:
4X + 2Y + Z ≤ 60.
(7) use the following equation for the profit:
Profit = $6X + $3Y + $2Z.
 13. Question 13:
The Reggio Advertising Company wishes to plan an advertising campaign in three different media--
television, radio, and magazines. The purpose of the advertising program is to reach as many potential
customers as possible. The results of a market study are given below, The company does not want to spend
more than $800,000 on advertising. It further requires that :
(1) at least 2 million exposures take place among women;
(2) advertising on television be limited to $500,000;
(3) at least 3 advertising units be bought on daytime television, and two units during prime time; and
(4) the number of advertising units on radio and magazines should each be between 5 and 10. Formulate
into a linear programming problem.

Solution:
Let x1, x2, x3, and x4 be the number of advertising units bought in daytime television, prime-time
television, radio, and magazines, respectively.

The total number of potential customers reached (in thousands)

= 400x1 + 900x2 + 500x3 + 200 x4.

The restriction on the advertising budget is represented by:
40,000x1 + 75,000x2 + 30,000x3 + 15,000x4 ≦ 800,000.

The constraint on the number of women customers reached by the advertising campaign
becomes:
300,000x1 + 400,000x2 + 200,000x3 + 100,000x4 ≧ 2,00,000.

The constraints on television advertising are:

40,000x1 + 75,000x2 ≦ 500,000
x1 ≧ 3
x2 ≧ 2.
Since advertising units on radio and magazines should each be between 5and 10, one gets the
following constraints:
5 ≦ x3 ≦ 10
5 ≦ x4 ≦ 10.
The complete linear programming problem with some minor simplification is given below:

Maximize: Z = 400x1 + 900x2 + 500x3 + 200x4

Subject to: 40x1 + 75x2 + 30x3 + 15x4 ≦ 800

30x1 + 40x2 + 20x3 + 10x4 ≧ 200
40x1 + 75x2 ≦ 500
x1 ≧3
x2 ≧2
x3 ≧5
x3 ≦ 10
x4 ≧5
x4 ≦ 10.
 14. Question 14:
For its Sanford to Marksville short run, Sutland Airlines has first class; tourist class, and coach
accommodations. Packets of three tickets each, called 3 – Paks, are available at a special discount.
If tickets are sold in accordance with seating capacity, because of "no shows" it often happens that
flights are not made at full capacity, thus losing money for Sutland.
If Sutland oversells a flight and there are not enough cancellations or "no shows" to balance the
oversubscription, then some passengers are going to be inconvenienced until new arrangements
are made. It has been found that passengers thus inconvenienced exhibit essentially three kinds
of reaction: I. The passenger who heartily curses Sutland and then forgets all about his ordeal after
new arrangements have been made;
II. The passenger who becomes so angry that he never flies Sutland again; and
III. The passenger whose anger is so great that he never flies Sutland again and campaigns to stop
other people from flying Sutland.

The effects of these reactions have been thoroughly studied, and an annoyance scale has been
developed so that these effects can be described in quantitative terms. For a given flight 15 points
of reaction I (measured on the annoyance scale), 12 points of reaction II, and 9 points of reaction
III can be tolerated at most.

Table 1 was developed and distributed to the executives of Sutland who are involved in customer
relations. From an analysis of the past earnings of Sutland Airlines,
The expected profit on a 3 – Pak of first class tickets is $10, the expected profit on a 3 – Pak of
tourist class tickets is $12, and a 3 – Pak of coach tickets nets $14.
Of concern to Sutland Airlines is the question: By how many 3 – Paks of each type of
accommodation should a flight be oversold if the tolerance levels on the annoyance scale are not
to be exceeded and the largest possible profit is to be obtained? Of course, Sutland will break up
a 3 – Pak when necessary. Find the constraints, and explain how the problem should be solved.

Solution:

The constraints are:

(1) X ≥ 0 Either they overbook first class or they don't.
(2) Y ≥ 0 Either they overbook tourist class or they don't.
(3) Z ≥ 0 Either they overbook coach or they don't.

(4) First class has one point for Reaction I, tourist class has one point
for Reaction I, and coach has 5 points for Reaction I. Since the maximum
tolerable limit is 15 points for Reaction I, there is the constraint
X + Y + 5Z ≤ 15.
 (5) First class has 2 points for Reaction II, tourist class has three points
for reaction II, and coach has one point for Reaction II. Since the
maximum tolerable limit is 12 points for Reaction II, there is the constraint
2X + 3Y + Z ≤ 12.
(6) First class has two points for Reaction III, tourist class has two
points for Reaction Ill, and coach has one point for Reaction III. Since the
maximum tolerable limit is 9 points for Reaction III, there is the constraint
2X + 2Y + Z ≤ 9.
(7) These constraints of profit formula is
Profit = $10X + $12Y + $14Z.
 15. Question 15:
Mazarini Butchers, Inc., is a large-scale distributor of dressed meats that specializes in the hotel
market and runs a highly technological operation. Schneider Hotels, Inc. placed an order for a
ground meatloaf (mixed ground beef, pork, and veal) for 1,000 pounds according to the
following specifications:
a. The ground beef is to be no less than 400 pounds and not more than 600 pounds.
b. The ground pork must be between 200 and 300 pounds.
c. The ground veal must weigh between 100 and 400 pounds.
d. The weight of ground pork must be no more than one and one-half times the weight
of veal.
The negotiated contract provides that Scheider Hotelswill pay Mazarini Butchers $1,200 for
supplying the meatloaf. An analysis indicated that the cost per pound of beef, pork, and veal
would be, respectively, $0.70, $0.60, and $0.80.
The problem is one of maximizing contribution to overhead and profit subject to the specified
constraints on flavor proportions and the demand constraint of 1,000 pounds. How can this
problem be modeled?
Solution:
x1 = pounds of ground beef;
x2 = pounds of ground pork;
x3 = pounds of ground veal.

At first, the problem appears to consist of three variables, which

would make for a rather cumbersome graphical solution. The demand
constraint, however, allows for the tacit elimination of any one variable,
say x3; that is
x1 + x2 + x3 = 1.000
may be rewritten as
x3 = 1,000 – x1 – x2.
This expression may be substituted into the objective function and
constraints wherever x3 appears. The complete problem may be stated as

maximize:
z = Revenue – Variable costs
= 1,200 – 0.70x1 – 0.60x2 – 0.80x3
= 1,200 – 0.70x1 – 0.60x2 – 0.80 (1,000 – x1 – x2)
= 400 + 0.10x1 + 0.20x2

subject to:
x1 ≤ 600
x1 ≥ 400 (1)
x2 ≤ 300 (2)
x2 ≥ 200 (3)
x3 ≤ 400 (4)
x3 ≥ 100 (5)
x1, x2, x3 ≥ 0. (6)
 16. Question 16:
A canning company operates two canning plants. Three growers are willing to supply fresh
fruits in the following amounts:

Harry 200 tons at $10 / ton

Frank 300 tons at $9 / ton
Tom 400 tons at $8 / ton
Shipping costs in dollars per ton are:

Plant capacities and labor costs are:

The canned fruits are sold at $50 / ton to the distributors. The company can sell at this price all
they can produce. How should the company plan its operations at the two plants so as to
maximize its profits? Formulate as a linear program.

Solution:
To formulate this as a linear program, define:
xHA = quantity shipped from Harry to Plant A
xHB = quantity shipped from Harry to Plant B
xFA = quantity shipped from Frank to Plant A
xFB = quantity shipped from Frank to Plant B
xTA = quantity shipped from Tom to Plant A
xTB = quantity shipped from Tom to Plant B.
The supply constraints are given by:
xHA + xHB ≦ 200
xFA + xFB ≦ 300
xTA + xTB ≦ 400.
The constraints on plant capacities are:
xHA + xFA + xTA ≦ 450
xHB + xFB + xTB ≦ 550.

All the variables are restricted to be nonnegative. To compute the

net profit for each of the variables, the cost of fresh fruits, shipping, and
labor costs must be subtracted from the selling price. For example, the
profit on variable xHA (fruits bought from Harry and processed at Plant A) is
given by:
PHA = 50 – (10 + 2 + 25) = $13 / ton.
Similarly, the other profits can be calculated, and the objective function is
to maximize:
Z = 13xHA + 17.5xHB + 15xFA + 19.5xFB + 12xTA + 19xTB
 17. Question 17:
A certain manufacturer produces four different types of gears. In the production of the gears he uses
milling machines, lathes, and presses. He has 9 milling machines, 12 lathes, and 16 presses.
Table 1 indicates how many minutes on each kind of machine are needed to produce agear of each of the
four types. The manufacturer realizes a profit of 8 cents on each gear of type 1, 15 cents on each one of
type 2, 6 cents on each of type 3, and 20 cents on each gear of type 4. Find a feasible solution to the
problem.

Solution:

Let xi denote the number of gears of type i,

i = 1, 2, 3, 4, produced per minute.

1. The quantity to be minimized – – the profit per minute – – is:

8x1 + 15x2 + 6x3 + 20x4.
2. The number of milling machines per minute must not exceed 9 :
x1 + 3x2 + x3 + 2x4,
.
3. The number of lathes used per minute must not exceed 12,:
2x1 + 2x2 + 2x3 + 3x4
4. The number of presses used per minute must not exceed 16 :
3x1 + 3x2 + 2x3 + 5x4

5. Find nonnegative numbers x1, x2, x3, x4 which maximize:

8x1 + 15x2 + 6x3 + 20x4

subject to:
x1 + 3x2 + x3 + 2x4 ≤ 9
2x1 + 2x2 + 2x3 + 3x4 ≤ 12
3x1 + 3x2 + 2x3 + 5x4 ≤ 16.
 18. Question 18:
Acme Manufacturing Company has a contract to deliver 100, 250, 190,
140, 220, and 110 home windows over the next 6 months. Production cost
(labor, material, and utilities) per window varies by period and is
estimated to be $50, $45, $55, $48, $52, and $50 over the next 6 months.

To take advantage of the fluctuations in manufacturing cost, Acme can

produce more windows than needed in a given month and hold the extra
units for delivery in later months. This will incur a storage cost at the rate
of $8 per window per month, assessed on end-of-month inventory.

Develop a linear program to determine the optimum production schedule?

Solution:
Total production cost = 50x1 + 45x2 + 55x3 + 48x4 + 52x5 + 50x6

Total inventory (storage) cost = 8(I1 + I2 + I3 + I4 + I5 + I6)

Minimize z = 50x1 + 45x2 + 55x3 + 48x4 + 52x5 + 50x6 + 8(I1 + I2 + I3 + I4 + I5 + I6)

x1 - I1 = 100 (Month 1 )
I1 + x2 - I2 = 250 (Month 2)
I2 + x3 - I3 = 190 (Month 3)
I3 + x4 - I4 = 140 (Month 4)
I4 + x5 - I5 = 220 (Month 5)
I5 + x6 = 110 (Month 6)
 19. Question 19:
A company is planning the manufacture of a product for March, April, May, and
June of next year.
The demand quantities are 520, 720, 520, and 620 units, respectively. The
company has a steady workforce of 10 employees but can meet fluctuating
production needs by hiring and firing temporary workers.
The extra costs of hiring and firing a temp in any month are $200 and $400,
respectively. A permanent worker produces 12 units per month, and a
temporary worker, lacking equal experience, produces 10 units per month.
The company can produce more than needed in any month and carry the surplus
over to a succeeding month at a holding cost of $50 per unit per month. Develop
an optimal hiring/firing policy over the 4-month planning horizon
Solution:
Remaining demand for March = 520 - 12 x 10 = 400 units
Remaining demand for April = 720 - 12 x 10 = 600 units
Remaining demand for May = 520 - 12 x 10 = 400 units
Remaining demand for June = 620 - 12 x 10 = 500 units
10x1 = 400 + I1 (March)
I1 + 10x2 = 600 + I2 (April)
I2 + 10x3 = 400 + I3 (May)
I3 + 10x4 = 500 (June)
Inventory holding cost = 50 ( I1 + I2 + I3 )
Cost of hiring = 200 (S1- + S2- + S3- + S4- )
Cost of firing = 400(S1+ + S2+ + S3+ + S4+)
Minimize Z = 50( I1 + I2 + I3) + 200(S1- + S2- + S3- + S4-) + 400(S1+ +
S2+ + S3+ + S4+)
 20. Question 20:
A firm produces three products. These products are processed on three different
machines. The time required to manufacture one unit of each of the three
products and the daily capacity of the three machines are given in the table
below:

The Maximum profit on Machine 1 is $4, the expected profit on Machine 2 is $3, and Machine 2 is $6.

Solution:

To formulate this as a linear program, define:

M1 = quantity Product 1
M2 = quantity Product 2
M3 = quantity Product 3
Non negativity
x1, x2 , x3 ≥ 0

Maximize the profit.

Z = 4x1+ 3x2 + 6x3
Constraints are on the machines :
2x1+ 3x2 + 2x3 ≤ 440
4x1+ 0x2 + 3x3 ≤ 470
2x1+ 5x2 + 0x3 ≤ 430
 21. Question 21

PRODUCT MIX PROBLEM

A factory manufactures two products A and B. To manufacture one unit of A,
1.5 machine hours and 2.5 labour hours are required. To manufacture product
B, 2.5 machine hours and 1.5 labour hours are required. In a month, 300
machine hours and 240 labour hours are available.
Profit per unit for A is $ 50 and for B is $ 40. Formulate as LPP.

Solution
X1 = Number of units of A manufactured per month.
X2 = Number of units of B manufactured per month.
The objective function:
Max Z = 50x1+ 40x2
Subjective Constraints For machine hours
1.5x1+ 2.5x2 ≤ 300

For labour hours

2.5x1+ 1.5x2 ≤ 240

Non negativity
x1, x2 ≥0
 22. Question 22:
A company produces three products A, B, C. For manufacturing three raw
materials P, Q and R are used.
Profit per unit
A - $ 5, B - $ 3, C - $ 4
Resource requirements/unit

Maximum raw material availability:

P - 80 units; Q - 100 units; R - 150 units. Formulate LPP.
Solution
Decision variables:
x1 = Number of units of A
x2 = Number of units of B
x3 = Number of units of C

Profit per unit is given, objective function is maximization

Max Z = 5x1+ 3x2 + 4x3
Constraints:
For P:
0x1+ 20x2 + 30x3 ≤ 80
For Q:
20x1+ 30x2 + 20x3 ≤ 100
For R:
50x1+ 0x2 + 40x3 ≤ 150
Non negativity
X1, X2, X3 ≥ 0
 23. Question 23:
A company produces a basic and premium version of its product. The basic version requires 20
minutes of assembly and 15 minutes of painting. The premium version requires 30 minutes of
assembly and 30 minutes of painting. If the company has staffing for 3,900 minutes of assembly
and 3,300 minutes of painting each week. They sell the basic products for a profit of $30 and the
premium products for a profit of $40. How many of each version should be produced to maximize
profit?
Solution
 Let b = the number of basic products made,
 and p = the number of premium products made.
 Objective: Z=30b+40p
 Constraints:
1. 20b+30p ≤ 3900
b p
0 130
195 0
2. 15b+30p ≤ 3300
b p
0 110
220 0

3. b≥0, p≥0

 To determine C
20b+30p ≤ 3900 *15

15b+30p ≤ 3300 *20

300b+450p=58,500
-
300b+600p=66,000
-150p=-7,500
p=-7500/-150
p=50
300b+450(50) =58,500
300b+22,500=58,500
300b=58,500-22,500
300b=36,000
b=36,000/300 b=120
The point (195, 0) gives the largest profit, and that profit is 5850. Meaning they should sell
195 basic versions and 0 Premium versions to maximize their profit.

24. Question 24:

At a university, Professor Symons wishes to employ two people, John, and Mary, to grade
papers for his classes. John is a graduate student and can grade 20 papers per hour; John earns
$15 per hour for grading papers. Mary is a post-doctoral associate and can grade 30 papers per
hour; Mary earns $25 per hour for grading papers. Each must be employed at least one hour a
week to justify their employment. If Prof. Symons has at least 110 papers to be graded each
week, how many hours per week should he employ each person to minimize the cost?

Solution

 Let x= no. of hours per week John is employed.

 and y= no. of hours per week Mary is employed.
 Objective function: Z =15x+25y
 Constraints:

1. x≥1

2. y≥1

3. 20x+30y≥110
x y
0 3.67
5.5 0

4. x≥0, and y≥0.

The points (4, 1) give the least cost, and that cost is $85. Therefore, to minimize grading
costs, Professor Symons should employ John 4 hours a week, and Mary 1 hour a week at a
cost of $85 per week.
 25. Question 25:
Dorian makes luxury cars and jeeps for high-income men and women. It wishes to advertise
with 1-minute spots in comedy shows and football games. Each comedy spot costs $50K and
is seen by 7M high-income women and 2M high-income men. Each football spot costs $100K
and is seen by 2M high-income women and 12M high-income men. How can Dorian reach
28M high-income women and 24M high-income men at the least cost?
Solution
 Let x = the number of comedy spots
 and y = the number of football spots
 Objective: z = 50x + 100y (Minimization)
 Constraints:
 7 x + 2 y ≥ 28 (high income women)
x y
0 14
4 0
 2 x + 12 y ≥ 24 (high income men)
x y
0 2
12 0

4. b≥0, p≥0
 To determine B
7 x + 2 y ≥ 28 *2
2 x + 12 y ≥ 24 *7
14x+4y= 56
-
14x+84y=168
-80y=-112
y=-112/-80
y=1.4
Point (X, Y) Z=50x+100y Min
14x+4(1.4) =56 A (0,14) 50(0) + 100(14) 1400
14x+5.6=56 B (3.6,1.4) 50(3.6) + 100 (1.4) 320
14x=56-5.6
14x=50.4 C (12,0) 50(12) + 100(0) 600
x=50.4/14
x=3.6
the optimal solution is (3.6, 1.4) which gives the least cost. Meaning that Dorian should
advertise with 3.6 spots in comedy shows and 1.4 spots in football games.
 26. Question 26:
Vitamins B1 and B2 are found in two foods F1 and F2. 1 unit of F1 contains 3
units of B1 and 5 units of B2. 1 unit of F2 contains 5 units of B1 and 7 units of
B2 respectively.
Minimum daily prescribed consumption of B1 & B2 is 30 and 40 units
respectively.
Formulate as LPP.

Solution
Decision Variables:
x1 = No. of units of P1 per day.
x2 = No. of units of P2 per day.
Objective function:
Min. Z = 30 x1 + 40 x2
Subject to constraints:
3x1+ 5x2 ≥ 30 (for N1)
5x1+ 7x2 ≥ 40 (for N2)
x1, x2 ≥ 0

27. Question 27:

Maximize Z = 2x1 + x2
subject to constraints
 X1 + 2x2 ≤ 10
 X1 + x2 ≤ 6
 X1- x2≤2
 X1 - 2x2 ≤ 1
 X1 ≥ 0, x2 ≥ 0.
As x1 and x2 > 0, the feasible region is in I quadrant.

Solution
 Shaded area OGIJKBO is the feasibility region.

 ZG(1, 0）=(2*1)+(1*0)=2
 ZI(3, 1) = (2*3) + (1*1)=7
 ZJ(4, 2) = (2*4) + (1*2) = 10 (Max)
 ZK(2, 4) = (2*2) + (1*4) = 8
 ZB(0, 5) = (2*0) + (1* 5) = 5

28. Question 28:

A diet conscious housewife wishes to ensure certain minimum intake of vitamins A,
B and C for the family. The minimum daily (quantity) needs of vitamins A,B and C
for the family are respectively 30, 20 and 16 for the supply of theses minimum
vitamin requirements, the house wife relies on two fresh foods. The first one
provides 7, 5, 2 units of the three vitamins per gram respectively and the second one
provides 2, 4, 8 units of the same three vitamins per gram of the foodstuff
respectively. The first foodstuff costs 3$ per gram and the second 2$ per gram. The
problem is how many grams of each foodstuff should the housewife buy every day
to keep her food bills as low as possible? (Formulate the problem as liner
programming problem.)

Solution

let
𝑥1:𝑡ℎ𝑒 𝑛𝑢𝑚𝑏𝑒𝑟 𝑜𝑓 units of food
𝑥2:𝑡ℎ𝑒 𝑛𝑢𝑚𝑏𝑒𝑟 𝑜𝑓 units of foods
1.The data of the given problem can be summarized as below:
 Objective function: Minimum
𝑍 = 3𝑥1 + 2𝑥2
subject to the Constraints:
(1) 7𝑥1 + 2𝑥2 ≥ 30
(2) 5𝑥1 + 4𝑥2 ≥ 20
(3) 2𝑥1 + 8𝑥2 ≥ 16
(4) 𝑥1 , 𝑥2 ≥ 0

Solve graphically a Linear Programming model that will

allow the housewife to minimize the cost. And determine the
optimal solution.

To determine two points on the Constraints as follow

7𝑥1 + 2𝑥2 = 30 >> ( 0 , 15 ) and (4.3 , 0)
5𝑥1 + 4𝑥2 = 20 >> ( 0 , 5 ) and ( 4, 0)
2𝑥1 + 8𝑥2 = 16 >> (0,2) and (8,0)

29. Question 29 :
The manager of an oil refinery has to decide upon the optimal mix of two possible blending processes of
which the inputs and outputs per production run are as follows

The maximum amount available of crude A and B are 200 units and 150 units respectively. Market
requirements show that at least 100 units of gasoline X and 80 units of gasoline Y must be produced. The
profits per production run from process 1 and process 2 are 3$ and 4$ respectively. Formulate the problem
as liner programming problem.

Solution
Let 𝑥1:𝑡ℎ𝑒 𝑛𝑢𝑚𝑏𝑒𝑟 𝑜𝑓 𝑝𝑟𝑜𝑑𝑢𝑐𝑡𝑖𝑜𝑛 𝑓𝑟𝑜𝑚 𝑝𝑟𝑜𝑐𝑒𝑠𝑠𝑒𝑠

𝑥2:𝑡ℎ𝑒 𝑛𝑢𝑚𝑏𝑒𝑟 𝑜𝑓 𝑝𝑟𝑜𝑑𝑢𝑐𝑡𝑖𝑜𝑛 𝑓𝑟𝑜𝑚 𝑝𝑟𝑜𝑐𝑒𝑠𝑠𝑒𝑠

Objective function: Maximize 𝑍 = 3𝑥1 + 4𝑥2

Constrains:

(1) 5𝑥1 + 4𝑥2 ≤ 200

(2) 3𝑥1 + 5𝑥2 ≤ 150

(3) 5𝑥1 + 4𝑥2 ≥ 100

(4) 8𝑥1 + 4𝑥2 ≥ 80

(5) 𝑥1 , 𝑥2 ≥ 0
 30. Question 30:
A workshop has three (3) types of machines A, B and C; it can manufacture two (2) products 1 and 2, and
all products have to go to each machine and each one goes in the same order; First to the machine A, then
to B and then to C. The following table shows:

 The hours needed at each machine, per product unit.

 The total available hours for each machine, per week.

 The profit of each product per unit sold.

Formulate and solve using the graphical method a Linear Programming model for the previous situation
that allows the workshop to obtain maximum gains.

Solution
let 1:𝑡ℎ𝑒 𝑛𝑢𝑚𝑏𝑒𝑟 𝑜𝑓 𝑝𝑟𝑜𝑑𝑢𝑐𝑡 1 𝑝𝑒𝑟 𝑤𝑒𝑒𝑘 .

let 𝑥2:𝑡ℎ𝑒 𝑛𝑢𝑚𝑏𝑒𝑟 𝑜𝑓 𝑝𝑟𝑜𝑑𝑢𝑐𝑡 2 𝑝𝑒𝑟 𝑤𝑒𝑒𝑘 .

Objective function:

Maximize 𝑍 = 𝑥1 + 1.5𝑥2

Constrains:

(1) 2𝑥1 + 2𝑥2 ≤ 16

(2) 𝑥1 + 2𝑥2 ≤ 12

(3) 4𝑥1 + 2𝑥2 ≤ 28

(4) 𝑥1 , 𝑥2 ≥ 0

For the graphical solution:

Step 1: since 𝑥1 , 𝑥2 ≥ 0, we consider only the first quadrant of x y-plane.

Step 2: we draw straight lines for the equations

2𝑥1 + 2𝑥2 = 16

𝑥1 + 2𝑥2 = 12

4𝑥1 + 2𝑥2 = 28
To determine two point on the straight line 2𝑥1 + 2𝑥2 = 16

put 𝑥2 = 0 >> 𝑥1 = 8 , (8,0) is a point on the line1.

put 𝑥1 = 0 >> 𝑥2 = 8 , (0,8) is a point on the line1.

To determine two point on the straight line 𝑥1 + 2𝑥2 = 12

put 𝑥2 = 0 >> 𝑥1 = 12 , (12,0) is a point on the line 2.

put 𝑥1 = 0 >> 𝑥2 = 6 , (0,6) is a point on the line 2.

To determine two point on the straight line 4𝑥1 + 2𝑥2 ≤ 28

put 𝑥2 = 0 >> 𝑥1 = 14 , (7,0) is a point on the line 3.

put 𝑥1 = 0 >> 𝑥2 = 14 , (0,14) is a point on the line 3.

 31. Question 31:
A furniture manufacturer produces two types of chairs: Standard and Deluxe. The
company has limited resources, such as labor hours and raw materials, and wants
to maximize their profit. Each standard chair earns a profit of $20, and each deluxe
chair earns a profit of $30. The production time required for a standard chair is 2
hours, while a deluxe chair requires 3 hours. The company has a total of 80 labor
hours available and can produce a maximum of 25 chairs.
Solution
Let's define our variables:
x1 = number of standard chairs to produce
x2 = number of deluxe chairs to produce

The objective is to maximize the profit:

Objective function: Z = 20x1 + 30x2

Subject to the following constraints:

2x1 + 3 x2 ≤ 80 (labour hour constraint)
x1 + x2 ≤ 25 (chair production constraint)
x1, x2 ≥ 0 (non-negativity constraint)
 32. Question 32:
A manager at an oil company wants to find optimal mix of two blending processes. Formulate LPP.
Data:

Profit per operation:

Process 1 (P1) = $ 4, 000
Process 2 (P2) = $ 5, 000
Maximum availability of crude oil:
Grade A = 500 units
Grade B = 400 units
Minimum Demand for Gasoline:
X = 300 units
Y = 200 units

Solution
Decision Variables:

x1 = No. of operations of P1

x2 = No. of operations of P2

Objective Function:

Max. Z = 4000 x1 + 5000 x2

Subjective to constraints:

6x1+ 5x2 ≤ 500

4x1+ 6x2 ≤ 400

6x1+ 5x2 ≥300

9x1+ 5x2 ≥200

x1, x2 ≥ 0
 33. Question 33:
Suppose an industry is manufacturing tow types of products P1 and P2. The profits per Kg of the
two products are Rs.30 and Rs.40 respectively. These two products require processing in three
types of machines. The following table shows the available machine hours per day and the time
required on each machine to produce one Kg of P1 and P2. Formulate the problem in the form of
linear programming model.

Solution
The procedure for linear programming problem formulation is as follows:
Introduce the decision variable as follows:
Let
x1 = amount of P1
x2 = amount of P2
Maximize
30x1 + 40x2
Subject to: 3x1 + 2x2 ≤ 600
3x1 + 5x2 ≤ 800
5x1 + 6x2 ≤ 1100
x1≥ 0, x2 ≥ 0

36. Question 36 :
A company owns two flour mills viz. A and B, which have different production capacities for high,
medium and low quality flour. The company has entered a contract to supply flour to a firm every month
with at least 8, 12 and 24 quintals of high, medium and low quality respectively. It costs the company
Rs.2000 and Rs.1500 per day to run mill A and B respectively. On a day, Mill A produces 6, 2 and 4
quintals of high, medium and low quality flour, Mill B produces 2, 4 and 12 quintals of high, medium and
low quality flour respectively. How many days per month should each mill be operated in order to meet
the contract order most economically.

Solution
Let us define x1 and x2 are the mills A and B.

The linear programming problem is given by Minimize

2000x1 + 1500x2

Subject to:
6x1 + 2x2 ≥ 8
2x1 + 4x2 ≥ 12
4x1 + 12x2 ≥ 24
x1 ≥ 0, x2 ≥ 0
 37. Question 37
Solve the following LPP using simplex method: 1- Max 𝒁 = 𝟑𝑿𝟏 + 𝟒𝑿𝟐
Subject to
15𝑋1 + 10𝑋2 ≤ 300
2.5𝑋1 + 5𝑋2 ≤ 110
𝑋1 ≥ 0, 𝑋2 ≥ 0

Solution
The standard form of LPP
Max 𝑍 − 3𝑋1 − 4𝑋2 = 0
Subject to
15𝑋1 + 10𝑋2 + 𝑆1 = 300
2.5𝑋1 + 5𝑋2 + 𝑆2 = 110
𝑋1 ≥ 0, 𝑋2 ≥ 0,
𝑆1 ≥ 0, 𝑆2 ≥ 0
We have m= 2 and n= 4 , thus n-m=2 ( Non-basic variable which equal zero)
The optimal solution: 𝒙𝟏 = 𝟖, 𝒙𝟐 = 𝟏𝟖, 𝒁 = 𝟗
 38. Question 38 :
Min 𝒁 = −𝟑𝑿𝟏 + 𝑿𝟐

Subject to

𝑋1 + 𝑋2 ≤ 5

2𝑋1 + 𝑋2 ≤ 8

𝑋1 ≥ 0, 𝑋2 ≥ 0

Solution
The standard form of LPP

Min 𝒁 + 𝟑𝑿𝟏 − 𝑿𝟐 = 𝟎

Subject to

𝑋1 + 𝑋2 + 𝑆1 = 5

2𝑋1 + 𝑋2 + 𝑆2 = 8

𝑋1 ≥ 0, 𝑋2 ≥ 0,

𝑆1 ≥ 0, 𝑆2 ≥ 0

We have m= 2 and n= 4 , thus n-m=2 ( Non-basic variable which equal zero)

We note all coefficient of objective function are non-positive values.

Thus, the optimal solution is 𝒙𝟏 = 𝟒, 𝑺𝟏 = 𝟏 , 𝒙𝟐 = 𝟎 , 𝑺𝟐 = 𝟎 , Z= -12

 39. Question 39:
Max 𝒁 = 𝟐𝟎𝟎𝑿𝟏 + 𝟏𝟒𝟎𝑿𝟐
Subject to
3𝑋1 ≤ 6000
2.9𝑋2 ≤ 8000 2.5
𝑋1 + 2𝑋2 ≤ 7500
1.3𝑋1 + 1.5𝑋2 ≤ 5000
𝑋1 ≥ 0, 𝑋2 ≥ 0

Solution
The standard form of LPP
Max 𝑍 − 200𝑋1 − 140𝑋2 = 0
Subject to
3𝑋1 + 𝑆1 = 6000
2.9𝑋2 + 𝑆2 = 8000
2.5𝑋1 + 2𝑋2 + 𝑆3 = 7500
1.3𝑋1 + 1.5𝑋2 + 𝑆4 = 5000
𝑋1 ≥ 0, 𝑋2 ≥ 0, 𝑆1 ≥ 0, 𝑆2 ≥ 0, 𝑆3 ≥ 0, 𝑆4 ≥ 0
We have m= 4 and n= 6 , thus n-m=2 ( Non-basic variable which equal zero)
The optimal solution: 𝒙𝟏 = 𝟐𝟎𝟎𝟎, 𝑺𝟐 = 𝟒𝟑𝟕𝟓 , 𝒙𝟐 = 𝟏𝟐𝟓𝟎 , 𝑺𝟒 = 𝟓𝟐𝟓 , Z=575000
 40. Question 40
Max 𝒁 = 𝟐𝑿𝟏 − 𝑿𝟐 + 𝑿𝟑

Subject to

2𝑋1 + 𝑋2 ≤ 10

𝑋1 + 2𝑋2 − 2𝑋3 ≤ 20

𝑋2 + 2𝑋3 ≤ 5

𝑋1 ≥ 0, 𝑋2 ≥ 0 , 𝑋3 ≥ 0

Solution
The standard form of LPP

Max z

𝑍 − 𝟐𝑿𝟏 + 𝑿𝟐 − 𝑿𝟑 = 0

𝟐𝑿𝟏 + 𝑿𝟐 + 𝒔𝟏 = 𝟏𝟎

𝑿𝟏 + 𝟐𝑿𝟐 − 𝟐𝑿𝟑 + 𝒔𝟐 = 𝟐𝟎

𝑿𝟐 + 𝟐𝑿𝟑 + 𝒔𝟑 = 𝟓

𝑿𝟏 ≥ 𝟎,𝑿𝟐 ≥ 𝟎 ,𝑿𝟑 ≥ 𝟎, 𝒔𝟏, 𝒔𝟐𝒔𝟑 ≥ 𝟎

We have m= 3 and n= 6 , thus n-m=3 ( Non-basic variable which equal zero)