Solved Exercises of The Graphical Method in Linear Programming
Uploaded by
ScribdTranslationsSolved Exercises of The Graphical Method in Linear Programming
Uploaded by
ScribdTranslationsSolved Exercises of the Graphical Method in
Linear Programming
Exercise N°1: A wine company has recently acquired a land of 110 hectares.
Due to the quality of the sun and the excellent climate of the region, the entire
production of Sauvignon Blanc and Chardonay grapes can be sold. We want to
know how much to plant of each variety in the 110 hectares, given the costs,
net benefits and labor requirements according to the data shown below:
Suppose you have a budget of US$10,000 and availability of 1,200 man days
during the planning horizon. Formulate and graphically solve a Linear
Programming model for this problem. Clearly detail the domain of feasible
solutions and the procedure used to find the optimal solution and optimal value.
Decision Variables:
: Hectares destined for the cultivation of Sauvignon Blanc
: Hectares destined for the cultivation of Chardonay
Objective Function:
Maximize
Restrictions:
Where the restrictions are associated with the maximum availability of hectares
for planting, available budget, man hours in the planning period and non-
negativity, respectively.
The following graph shows the representation of the problem of the wine
company. The outlined area corresponds to the domain of feasible solutions,
where the optimal basic feasible solution is reached at vertex C , where the
budget and man-day constraints are active. In this way, by solving said system
of equations, the coordinate of the optimal solution is found where
and (hectares). The optimal value is
(Dollars).
Exercise N°2: A workshop has three (3) types of machines A, B and C; can
manufacture two (2) products 1 and 2, all products have to go to each machine
and each one goes in the same order: First to machine A, then to B and then to
C. The following table shows:
The hours required on each machine, per unit of product
The total hours available for each machine, per week
The profit per unit sold of each product
Formulate and solve through the graphical method a Linear Programming
model for the previous situation that allows obtaining the maximum profit for
the workshop.
Decision Variables:
: Units to produce of Product 1 weekly
: Units to produce of Product 2 weekly
Objective Function:
Maximize
Restrictions:
The constraints represent the availability of weekly hours for machines A, B and
C, respectively, in addition to incorporating the non-negativity conditions.
For the graphical resolution of this model we will use the GLP software which
we addressed in the article Forest Planning Problem solved with Graphic
Linear Optimizer (GLP) . The green area corresponds to the set of feasible
solutions and the level curve of the objective function that passes through the
optimal vertex is shown with a red dotted line.
The optimal solution is and with optimal value
which represents the profit for the workshop.
Exercise N°3: A company produces two different products. One of them
requires per unit 1/4 of an hour in assembly work, 1/8 of an hour in quality
control work and US$1.2 in raw materials. The other product requires per unit
1/3 of an hour in assembly work, 1/3 of an hour in quality control work and
US$0.9 in raw materials. Given the current availability of personnel in the
company, there is at most a total of 90 hours for assembly and 80 hours for
quality control, each day. The first product described has a market value (sales
price) of US$9.0 per unit and for the second this value corresponds to US$8.0
per unit. Additionally, it has been estimated that the maximum daily sales limit
for the first product described is 200 units, there being no maximum daily sales
limit for the second product.
Formulate and graphically solve a Linear Programming model that allows you to
maximize the company's profits.
Decision Variables:
: Units to be produced daily of Product 1
: Units to be produced daily of Product 2
Objective Function:
Maximize
Restrictions:
The first restriction represents the limitations of daily assembly hours. The
second restriction is the availability of hours for quality control tasks (also
daily). The third constraint establishes an upper bound for the daily production
and sales of Product 1. Additionally, non-negativity conditions are included for
the decision variables.
The domain of feasible solutions has 5 vertices that correspond to the optimal
candidates of the problem. In particular the optimal vertex is D so that the
optimal solution is and with optimal value
which corresponds to the maximum profit
for the company.
