JELLA MAE T.

YCALINA BSA-2

Questions:

1. What is linear programming?

Linear programming is a way of using systems of linear inequalities to find
maximum or minimum value. It is a method of optimising operations with some
constraints and is considered an important technique that is used to find the optimum
resource utilisation.  It is used to make processes more efficient and cost-effective.
Some areas of application for linear programming include food and agriculture,
engineering, transportation, manufacturing and energy. Linear Programming is widely
used in Mathematics and some other field such as economics, business,
telecommunication, and manufacturing fields. 

2. Give some examples of linear programing in each of the following:

A. Production
A company makes two products (X and Y) using two machines (A and B). Each unit
of X that is produced requires 50 minutes processing time on machine A and 30
minutes processing time on machine B. Each unit of Y that is produced requires 24
minutes processing time on machine A and 33 minutes processing time on machine B.
At the start of the current week there are 30 units of X and 90 units of Y in stock.
Available processing time on machine A is forecast to be 40 hours and on machine B is
forecast to be 35 hours. The demand for X in the current week is forecast to be 75 units
and for Y is forecast to be 95 units. Company policy is to maximise the combined sum
of the units of X and the units of Y in stock at the end of the week.

 Formulate the problem of deciding how much of each product to make in the
current week as a linear program.

B. Marketing
Consider a chocolate manufacturing company that produces only two types of
chocolate – A and B. Both the chocolates require Milk and Choco only.  To manufacture
each unit of A and B, the following quantities are required:

 Each unit of A requires 1 unit of Milk and 3 units of Choco

 Each unit of B requires 1 unit of Milk and 2 units of Choco

The company kitchen has a total of 5 units of Milk and 12 units of Choco. On each sale,
the company makes a profit of

 Rs 6 per unit A sold

 Rs 5 per unit B sold.

Now, the company wishes to maximize its profit. How many units of A and B should it
produce respectively?
 C. Accounting
Bob has 4000 acres of land. Growing 1 Metric Ton each of wheat and barley
requires 1 and 0.8 acres of land respectively. Bob only uses organic fertilizers for his
crops. Bob estimates that he could procure a maximum of 10 Metric Tons of organic
fertilizers for the next crop season. Growing 1 Metric Ton each of wheat and barley
requires 0.0035 and 0.002 Metric Tons of fertilizers respectively.

D. Financial Management
Imagine that you are a lab technician, and your job is to feed rabbits daily. Their
daily diet contains a minimum of 24 grams (g) of fat, 36 g of carbohydrates, and 4 g of
protein. You can feed only 5 ounces of food per day. It is suitable as per the budget that
your order two food products and blend them to obtain an optimal mix. Food X consists
of 8 g of fat, 12 g of carbohydrates, and 2 g of protein per ounce, and costs $0.20 per
ounce. Food Y includes 12 g of fat, 12 g of carbs, and 1 g of protein per ounce, at the
cost of $0.30 per ounce. What is the optimal blend?

3. Define each of the following:

a. Linear Equations – is an algebraic equation in which each term has an
exponent of one and the graphing of the equation results in a straight line. An example
of linear equation is y=mx + b.
b. System of equations – is a collection of two or more equations with a same
set of unknowns. In solving a system of equations, we try to find values for each of the
unknowns that will satisfy every equation in the system. The equations in the system
can be linear or non-linear. This tutorial reviews systems of linear equations.
c. linear inequalities – are the expressions where any two values are
compared by the inequality symbols such as, ‘<’, ‘>’, ‘≤’ or ‘≥’. These values could be
numerical or algebraic or a combination of both.
d. System of Inequalities – is a set of two or more inequalities in one or more
variables. Systems of inequalities are used when a problem requires a range of
solutions, and there is more than one constraint on those solutions.
e. Variables – is a quantity that may change within the context of a mathematical
problem or experiment. Typically, we use a single letter to represent a variable. The
letters xx, yy, and zz are common generic symbols used for variables. Sometimes, we
will choose a letter that reminds us of the quantity it represents, such as tt for
time, vv for voltage, or bb for bacteria.
f. maximize – to increase to the greatest possible amount or degree, to look for
ways of maximizing profit and to represent at the highest possible estimate.
g. minimize – to reduce or keep to a minimum minimize costs minimize delays,
to underestimate intentionally.
h. objective function – is the real-valued function whose value is to be either
minimized or maximized subject to the constraints defined on the given LPP over the
set of feasible solutions. The objective function is maximized or minimized based on the
goal of the given LPP.
 i. constraints – it is the linear inequalities or equations or restrictions on the
variables of a linear programming problem.
j. feasible region – is defined as an area bounded by a set or collection of
coordinates that satisfy a system of given inequalities. This region satisfies all
restrictions imposed by a linear programming scenario. It is a concept of an optimization
technique.