Linear

Programming
Saturday, March 9, 2024 10:20 PM

Linear programming is considered as an optimization method to maximize or

minimize the objective function of the given mathematical model with the set of
some requirements which are represented in the linear relationship. The main aim of
the linear programming problem is to find the optimal solution.

Common Terminologies Used in Linear Programming

Let us define some terminologies used in Linear Programming using the above
example.
• Decision Variables: The decision variables are the variables that will decide my
output. They represent my ultimate solution. To solve any problem, we first
need to identify the decision variables.
• Objective Function: It is defined as the objective of making decisions. In the
above example, the company wishes to increase the total profit represented by Z.
So, profit is my objective function.
• Constraints: The constraints are the restrictions or limitations on the decision
variables. They usually limit the value of the decision variables. In the
above example, the limit on the availability of resources Milk and Choco are my
constraints.
• Non-negativity Restriction: For all linear programs, the decision variables
should always take non-negative values. This means the values for decision
variables should be greater than or equal to 0.
• Feasible Solution: Any non-negative solution which satisfies all the constraints
is known as a feasible solution. The region comprising all feasible solutions is
referred to as feasible region.
• Optimal Solution: The solution where the objective function is maximized or
minimized is known as optimal solution.

The maximum value of the profit function F(x,y)=4x+6y subjected to the constraints x≥0 , y≥0, x≤5, x≤6
A. 26
B. 36
C. 56
D. 48

Linear programming is a
(a) constrained optimization technique
(b) technique for economic allocation of limited resources
(c) mathematical technique
(d) all of these

Objective function of an LP problem is

(a) a constant
(b) a function to be optimized
(c) an inequality
(d) a quadratic equation

For the LP problem Minimize z = 2x + 3y the coordinates of the corner points of the bounded feasible region are
A(3, 3), B(20,3), C(20, 10), D(18, 12) and E(12, 12). The minimum value of z is
(a) 49
(b) 15
(c) 10
(d) 05