SMVEC

UNIT-IV
LINEAR PROGRAMMING
UNIT – IV (SOLVED)
LINEAR PROGRAMMING
(100% NUMERICAL)
SYLLABUS
Stages of development of Operations Research- Applications of Operations Research – limitations of
Operations – Introduction of Linear Programming – Graphical Method- simplex Method
PART-A
Principal components of decision problem, Modeling phases
1. What is an operations research?
Solution:
Operations Research is the application of scientific methods to complex problems arising from
operations involving large systems of men, machines and money in industry, business, government
and defense.
“OR is the art of giving scientific approach to problem solving for executing management”.
2. What are the characteristics of operation research?
Solution:
The essential characteristics of OR are
1. Inter-disciplinary team approach – The optimum solution is found by a team of scientist
selected from various disciplines.
2. Wholistic approach to the system – OR takes into account all significant factors and
finds the best optimum solution to the total organization.
3. Imperfectness of solutions – Improves the quality of solution.
4. Use of scientific research – Uses scientific research to reach optimum solution.
5. To optimize the total output – It tries to optimize by maximizing the profit and
minimizing the loss.
3. What is the feature of OR?
Solution:
 Selecting and distributing resources.
 As it is scientific way of making decisions, it gives lot for today’s managers to develop
skills / knowledge to arrive at optimal decisions.
 It helps in finding scope for new method for solving a problem and improvement in the
system.
 It helps in understanding the economic explanation of the operations in the system.
 It helps in incorporating useful techniques and eliminates duplication of methods applied to
solve the problem.
4. What are the applications of OR?
Solution:
Some areas of applications are
a) Finance, Budgeting and investment
 Cash flow analysis, investment portfolios
 Credit policies, account procedures
b) Purchasing, Procurement and Exploration
 Rules for buying, supplies
  Quantities and timing of purchase
 Replacement policies
c) Production management
 Physical distribution
 Facilities planning
 Manufacturing
 Maintenance and project scheduling
d) Marketing
 Product selection, timing
 Number of salesman, advertising
5. What are the different phases of OR? (or) What are the various phases in the study of
operations research?
Solution:
OR study generally involves the following major phases:
(i) Defining the problem and gathering data
(ii) Formulating a mathematical model
(iii) Deriving solutions from the model
(iv) Testing the model and its solutions
(v) Preparing to apply the model
(vi) Implementation
6. What are the different types of problem used in OR?
Solution:
 Linear Programming (Graphical, Simplex method etc..,)
 Transportation model
 Assignment model
 Inventory models
 PERT / CPM (Network analysis)
 Queuing or waiting line models
 Replacement models
 Simulation
 Game theory
 Sequencing model
 Integer programming
 Dynamic programming
 Non-linear programming
 Decision theory
 Goal programming
7. Name some important fields in which OR has got wide scope.
Solution:
 Accounting – Cash flow planning, Credit policy analysis, Planning of delinquent account
strategy.
 Construction – Allocation of resource to projects, Determination of proper work force.
 Manufacturing – Inventory control, Production scheduling.
 Marketing – Advertising budget allocation, Product introduction timing, Selection of
product mix.
 Research and Development – Control of R&D projects, Product introduction planning.
8. Write the some of the applications of operations research in Engineering.
Solution:
The some of the applications of operations research in Engineering are
 Optimal design of water resources systems.
 Optimal design of structures.
 Production, planning, scheduling and control.
 Optimal design of electrical networks.

1
  Inventory control.
 Planning of maintenance and replacement of equipment.
 Allocation of resources of service to maximize the benefit.
 Design of material handling.
 Optimal design of machines.
 Optimal design of control systems.
 Optimal selection of sites for an industry.
9. What are the necessities of operations research in industry?
Solution:
The need of OR has been equally felt by the industry due to the following reasons:
a) Complexity – In a big industry, the number of factors influencing a decision has increased.
Situation has become big and complex because of these factors interact with each other in a
complicated manner. The mathematical model is need in addition to optimization, which
helps to analyse the complex situation.
b) Scattered responsibility and authority – In a big industry, responsibility and authority of
decision-making is scattered throughout the organization and thus it is not conscious, may be
following inconsistent goals. Mathematical model of OR overcomes this difficulty also to a
great extent.
c) Uncertainty – There is a great uncertainty about economic and general environment. This
makes each decision costlier and time consuming. OR is quite essential from reliability point
of view.
d) Knowledge explosion – Knowledge is increasing at a very fast rate. Majority of industries are
not up-to-date with the latest knowledge. OR teams collect the latest information for analysis
purpose which is quite useful for the industries.
10. List any three practical limitations of the OR techniques.
Solution:
 Formulation of problem is difficult and consumes time
 Gives approximate solution to the real problem
 The problems may become very complicated by considering all factors
 Huge problems cannot solve easily
 Can’t have more variables
11. What are the various mathematical expressions of formulating the Model?
Solution:
The various mathematical expressions of formulating the Model are
 Models by structure
 Models by nature of an environment
 Models by the extent of generality.
12. What is a Model?
Solution:
A model in OR is a simplified representation of an operation, or is a process in which only
the basic aspects or the most important features of a typical problem under investigation are
considered. The objective of a model is to identify the significant factors and interrelationship.
They reliability of the solution obtained from a model depends on the validity of the model
representing the real system.
13. State the different types of models used in OR.
Solution:
The different types of models used in OR are
 Descriptive model
 Predictive model
 Normative model
 Iconic model
 Analogue model
 Mathematical model

2
  Deterministic model
 Probabilistic model
14. Define Analogue model and Iconic model.
Solution:
Analogue model uses one set of properties to represent another set of properties, which has a
system under study.
Example: A network of water pipes to represent the flow of current in an electrical network or
graphs, organizational charts, etc.
Iconic model is physical or pictorial representation of various aspects of a system.
Example: Toy, Miniature model of a building, scaled up model of a cell in biology etc.
15. What is the mathematical model?
Solution:
If xj(j=1, 2,….,n) are n-decision variables of the problem and if the system is subject to m-
constraints the general mathematical model can be written in the form
Optimize z=f(x1, x2, …. , xn)
Subject to gi(x1, x2, …. , xn) ≤ , = , ≥ bi(i=1, 2, ….,m)
(called structural constraints)
and x1, x2, …. , xn≥ 0 (called the non-negative restrictions or constraints)

16. What are the limitations of an OR model?

Solution:
 Dependence on an Electronic Computer: O.R. techniques try to find out an optimal solution
taking into account all the factors. In the modern society, these factors are enormous and
expressing them in quantity and establishing relationships among these require voluminous
calculations that can only be handled by computers.
 Non-Quantifiable Factors: O.R. techniques provide a solution only when all the elements
related to a problem can be quantified. All relevant variables do not lend themselves to
quantification. Factors that cannot be quantified find no place in O.R. models.

 Distance between Manager and Operations Researcher: O.R. being specialist's job requires
a mathematician or a statistician, who might not be aware of the business problems. Similarly,
a manager fails to understand the complex working of O.R. Thus, there is a gap between the
two.

 Money and Time Costs: When the basic data are subjected to frequent changes, incorporating
them into the O.R. models is a costly affair. Moreover, a fairly good solution at present may be
more desirable than a perfect O.R. solution available after sometime.

 Implementation: Implementation of decisions is a delicate task. It must take into account the
complexities of human relations and behaviour.

17. Difference between ‘simulation model’ and ‘mathematical model’

Solution:
 Mathematical model: Mathematical model uses a set of mathematical symbols (letters,
numbers, etc.) to represent the decision variables of a system under consideration. These
variables related by mathematical equations or inequalities which describe the properties of
the system.
 Simulation model: Simulation model is a representation of reality through the use of a
model or device which will react in the same manner as reality under a given set of
conditions. Once a simulation model is designed, it takes only a little time, in general, to run
a simulation on a computer. It is usually less mathematical and less time consuming and
generally least expensive as wee, in many situations.
3
 LP formulation and Graphical solution&Resource allocation problem
18. What is the term LPP? (Aug 15)
Solution:
Linear programming problem deals with determining optimal allocation of limited resources
to meet given objective.
LPP deals with optimization of a function of decision variables, known as objective
functions, subject to a set of simultaneous linear equations (or inequalities) known as constraints
19. Write the general form of LPP.
Solution:
The general form of LPP is
Optimize
Subject to the constraints

and
20. Define the standard form of LPP in matrix form.
Solution:
In general, ≤ constraints will be associated with maximization LPP and ≥ constraints with
minimization LPP. Let us write the standard form of maximization problem.
Maximize
Subject to the constraints

and
The standard form of minimization problem is
Minimize
Subject to the constraints

and
21. Write the steps to formulate a LPP.
Solution:
 Identify the unknown variables to determined and assign symbols to them.
 Identify all the restrictions or constraints (or influencing factors) in the problem and express
them as linear equations, or inequalities of decision variables.
 Identify the objective or aim represent it also has a linear function of decision variables.
 Express the complete formulation of LPP as a general mathematical model.

22. What are the assumptions made in LPP? (or) properties of LPP.
Solution:
The assumptions made in LPP are
 Proportionality: The rate of change (slope) of the objective function and the constraint
equations with respect to the particular decision variable is constant.
 Additivity: Terms in the objective function and constraint equations must be additive.
 Divisibility: Decision variables can take on any fractional value and are therefore continuous
as opposed to integer in nature.
 Certainty: Values of all the models parameters are assumed to be known with certainty
(non-probabilistic)
23. What are the characteristics of standard form of LPP? (N/D 2013, N/D 2014)
Solution:
The characteristics of standard form of LPP are
4
  The objective function is of maximization type.
 All the constraint equation must be of equal type by adding slack or surplus variables.
 RHS of the constraint equation must be positive type.
 All the decision variables are of positive type.
24. What are the characteristics of canonical form of LPP? (Dec’13)
Solution:
The characteristics of canonical form of LPP are
If the objective function is of maximization type, then all constraints are of ≤ type. Similarly
if the objective function is of minimization type, then all constraints are of ≥ type. But non-negative
constraints are ≥ type for both cases. But solving the Linear programming problem we have to
convert the canonical form into standard form.
25. What are the applications of LPP?
Solution:
 Work scheduling
 Production planning & production process
 Capital budgeting
 Financial planning
 Blending
 Farm planning
 Distribution
 Multi-period decision problem
o Inventory model
o Financial model
o Work scheduling
26. What are the advantages of Linear programming problem?
Solution:
 It provides an insight and perspective in to the problem environment. This generally results in
clear picture of the true problem.
 It makes a scientific and mathematical analysis of the problem situations.
 It gives an opportunity to the decision maker to formulate his strategies consistent with the
constraints and the objectives.
 It deals wit5h changing situations. Once a plan is arrived through the linear programming it
can also be revaluated for changing conditions.
 By using linear programming the decision maker makes sure that he is considering the best
solution.
27. Define the terms Feasible, Infeasible and Optimal solution. (OR) Define feasible and optimal
solution to the LPP. (N/D 2016)
Solution:
 Feasible solution – The solution which satisfies all the non-negativity constraints of LPP is
called a feasible solution.
 Infeasible solution – The solution which does not satisfy all the constraints of LPP is called an
infeasible solution. That is, there is no solution for the given LPP
 Optimal solution – A basic feasible solution that has the most favorable value of the objective
function is called an optimal feasible solution.
28. Define Feasible region and corner point feasible solution. (N/D 2017)
Solution:
Feasible region – The region containing all the solutions of an inequality of the LPP (which is a
convex region) is called a feasible region.
Corner point feasible solution – the corner point of feasible solution is a solution that lies at the
corner of the feasible region.
29. Define Redundant constraints.
Solution:

5
 In a given LPP any constraint does not affect the feasible region or solution space then the
constraint is said to be a redundant constraint.Redundant constraints can be classified as weakly and
strongly redundant constraints.
For example,
If x is the constraint that has to lies between the points 10 to 60 and y is the constraint which
lies between 20 to 40 then y is the redundant constraint.
30. Define Unbounded solution.
Solution:
In some linear programming problems, the solution space becomes unbounded so that the value
of the objective function also can be increased indefinitely without a limit. But it wrong to conclude
that just because the solution space is unbounded the solution also is unbounded. The solution space
may be unbounded but the solution may be finite.
31. Define basic solution and basic feasible solution to the LPP.
Solution:
Basic solution – Given a system of m linear equations with n variables(m<n).The solution obtained
by setting (n-m) variables equal to zero and solving for the remaining m variables is called a basic
solution.
It is not a final solution for the given solution. But it is the solution which satisfies all the
basic constraints.
Basic feasible solution – A feasible solution which is also basic is called a basic feasible solution.
32. Write the steps for solving LPP using Graphical method.
Solution:
Step 1: Consider the inequality constraints as equalities. Draw the straight lines in the XOY
plane corresponding to each equality and non-negativity restrictions.
Step 2: Find the permissible region for the values of the variables which is the region bounded
by the lines drawn in step 1.
Step 3: Find the point of intersection of the bounded lines by solving the equations of the
corresponding lines.
Step 4: Find the values of Z at all vertices of the permissible region.
Step 5: For Maximization problem, choose the vertex for which Z is maximum. For
minimization problem, choose the vertex for which Z is minimum.

33. State the limitations of Graphical method.

Solution:
Graphical method is not a powerful tool of LPP as most of the practical situations do
involve more than two variables. Though graphical method can deal with any number of constraints
but since each constraint is shown as a line on a graph, a large number of lines make the graph
difficult to read.
34. What is the multiple optimal solutions?
Solution:
A LPP having more than one optimal solution is said to have alternative or multiple optimal
solutions.
Any feasible solution which optimizes the objective function of the LPP’s called the optimal
solution. Any optimal solution is lies in the convex region of feasible solution with the given
constraints.
35. Solve the following graphically
Max
Subject to constraints

6
 Solution:
Convert the given inequality constraints as equalities.

(i.e)
The solution space is given below with the shaded area with vertices
O( 0 , 0 ), A ( 3 , 0 ), B ( 2 , 2 ) and C ( 0 , 3 ).

The values of Z at these vertices are given by

Vertices Value of Z
O( 0 , 0 ) 0
A(3,0) 3
B(2,2) 4
C(0,3) 3
Since the problem is of Maximization type, the optimum solution is
Maximum
Resource allocation problem &Simplex Method
36. Define slack variable and surplus variables.(or) Explain slack variables of LPP. (A/M 2017)
Solution:
Slack variable:
The non-negative variable which is added to LHS of the constraint to convert the inequality ¿ into
an equation is called slack variable.

Where si are called slack variables.

Surplus variable:
The non-negative variable which is subtracted from the LHS of the constraint to convert the
inequality  into an equation is called surplus variable.

Where si are called surplus variables.

37. What is the difference between slack and surplus variable.
Solution:

Slack variable Surplus variable

Slack variable represents an unused amount A surplus variable represents the amount by
of resources. which solution values exceed a resource.
It is added to less than or equal (<) to type It is added to greater than or equal to (>) type
constraints in order to get an equality constraints in order to get an equality constraint.
7
 constraint.
The coefficient is +1. The coefficient is -1.
It cannot be used as a starting point since unit
It is used as a starting point.
matrix condition is not satisfied.
38. What is a role of slack variable and surplus variable in LPP?
Solution:
Convert all the inequalities of the constraints into equations by introducing slack and include the
symbol surplus variables in the constraint. Put the cost of these variables equal to zero.
‘‘Less than or equal to’’ (≤) constraints might have positive slacks associated with them.
Correspondingly, ‘‘greater than or equal to’’ (≥) constraints might have positive surpluses
associated with them. The program reports the amount of these slacks and surpluses in the optimal
solution.

39. Write the standard LPP form of the following

Maximize
Subject to constraints

Solution:
Introducing slack and surplus variables, the problem in the standard form can be expressed
as
Maximize
Subject to constraints

40. Write the standard LPP form of the following

Minimize
Subject to constraints

Solution:
Convert the minimization problem into maximization as
Maximize Z* = - Minimize (-Z) =
Introducing slack and surplus variables, the problem in the standard form can be expressed as
Maximize Z* =
Subject to constraints

41. Express the following LPP in standard form :

Maximize
Subject to constraints

8
 Solution:

As is unrestricted , where

The given LPP becomes Maximize

Subject to

Convert the second constraint into ≤ type by multiplying both sides by -1. Now, the LPP becomes

Maximize
Subject to

which is the standard form.

42. Express the following LPP in standard form :

Maximize
Subject to constraints

Solution:
Since is unrestricted, put where
Then the LPP becomes,
Maximize where
Subject to constraints

43. Express the following LPP in standard form :

Maximize
Subject to constraints

9
 Solution:
By introducing slack and surplus variables, the problem in the standard form can be expressed as
Maximize Z =
Subject to constraints

44. Express the following LPP in standard form:

Maximize
Subject to constraints

Solution:
By introducing slack and surplus variables, the problem in the standard form can be expressed as
Maximize Z =
Subject to constraints

45. Express the following LPP in standard form :

Maximize
Subject to constraints

Solution:
Here and are restricted to be non-negative, while is unrestricted. Let us express as

where Thus, the above constraints can be written as

Introducing the slack and surplus variable then the standard form is

Maximize
10
 Subject toconstraints

46. Express the following LPP in standard form :

Minimize
Subject to constraints

Solution:
Convert the minimization problem into a maximization as
Maximize Z* = - Minimize (-Z) =

By introducing slack and surplus variables, the problem in the standard form can be expressed as
Maximize Z* =
Subject to constraints

47. What is degenerate and non-degenerate basic solution?

Solution:
Non-Degenerate – The basic solution is said to be a non-degenerate basic solution if none of the
basic variables is zero.
Degenerate – A basic solution is said to be a degenerate basic solution if one or more of the basic
variables are zero. The concept of obtaining a degenerate basic feasible solution in LPP is known as
degeneracy. This may occur in the initial stage when atleast one basic variable is zero in the initial
basic feasible solution.
48. How to resolve the degeneracy in LPP?
Solution:
 Divide each element in the tied rows by the positive coefficients of the key column in that
row.
 Compare the resulting ratios, column by column, first in the identity and then in the body
matrix from left to right.
 The row which first contains the smallest algebraic ratio contains the leaving variable.
49. What is meant by leaving variable and entering variable?
Solution:
Leaving variable:
One of the basic variables (which is zero) at one iteration becomes non-basic (zero) at the
following iteration is called a leaving variable.
 Divide each element of the rows (with tie) by the positive coefficients of the key column in
that row.

11
  Compare the resulting ratios, column by column, first in the identity and then in the body
from left to right.
 The row which first contains the smallest ratio contains the leaving variable.
Entering variable:
One of the non-basic variables (which is zero) at one iteration becomes basic (non-zero) at the
following iteration is called an entering variable.
 Maximization problem — most negative coefficient in z-row
 Minimization problem — most positive coefficient in z-row
 break ties by choosing left-most column
 Column of entering variable is pivot column
 If no entering variable, STOP
– Optimum reached
– Current basic feasible solution is optimal
– Optimal objective value is last entry (solution column) of objective row

50. What are the advantages of Simplex method?

Solution:
The advantages of simplex method are
 Easy to understand.
 Simple to implement after the vocabulary is familiar.
 Allowing an individual to address problems with more than two decision variables.
 This method can be time consuming.

51. From the optimum simplex table how do you identify that the LPP has no solution?
Solution:
If atleast one artificial variable appears in the basis at zero level with a positive value in the
XB column and the optimality condition is satisfied then the original problem has no feasible
solution.A set of values x1, x2, x3, …. , xn which satisfies the constraints of the LPP is called its
solution.Any solution to a LPP which satisfies the non-negativity restrictions of the LPP is called
its feasible solution.
52. Write the fundamental conditions of simplex method.
Solution:
The two fundamental conditions of which the simplex method is based are:
(i) Condition of feasibility: It ensures that if the initial solution is basic feasible than during
computation only basic feasible solutions will be obtained.
(ii)Condition of optimality: It guarantees that only better solutions will be encountered.
53. Draw the general form of the simplex table.
Solution:
Cj ( 0 0 0)

CB YB

1 0 0
0 1 0

. . 0 0 1
. . . .
. . .
. . . . .
. . . .

(body matrix) (unit matrix)

.

12
54. Write the condition of an unbounded solution of a LPP in simplex method.
Solution:
For every basic feasible solution to a given LPP, if for atleast one ‘j’, for each and
is negative, then there does not exist any optimal solution to this LPP.
When the value of decision variables in LP is permitted to increase infinitely without
violating the feasibility condition, then the solution is said to be unbounded.
55. What is the necessity and sufficient condition of a LPP?
Solution:
A necessity and sufficient condition for a basic feasible solution to a LPP to be an optimum
(maximum) is that for all ‘j’ for which .
A sufficient condition for a basic feasible solution to an LPP to be an optimum (maximum) is
that for all ‘j’ for which the column vector is not in the basis B.
LP formulation and Graphical solution
1. Elucidate the procedure for formulating a LPP. Explain the advantages and Limitations of
Linear Programming? (N/D 2017) (16)
Solution:
Procedure for formulating a LPP:
Step1: Study the given situation, find the key decision to be made.
Step2: Identify the decision variables of interest to the decision maker and express as
Step3: State the feasible alternatives which generally are
Step4: Identify the constraints in the problem and express them as linear inequalities or equations.
Step5: Identify the objective function and express it as a linear function of the decision variables.
Advantages:
 The main advantage of LPP is its simplicity and easy way of understanding.
 LPP makes use of available resources.
 To solve many diverse combination problem.
 Helps in changing condition of the process or system.
 LPP is adaptive and more flexibility to analyze the problems.
 The better quality of decision is provided.
 It provides an insight and perspective in to the problem environment. This generally results in
clear picture of the true problem.
 It makes a scientific and mathematical analysis of the problem situations.
 It gives an opportunity to the decision maker to formulate his strategies consistent with the
constraints and the objectives.
 By using the linear programming the decision maker makes sure that he is considering the
nest solution.
Limitations:
 LPP works only with the variables that are linear. But it is not true in many real life
situations.
 The idea is static, it does not consider change and evolution of variables.
 LPP yields fractional valued answers for the decision variables.
 Long term objective of the management cannot be resolve with a single goal.
 The problem can be solved only when there is a clear representation of linear relationship
between different variables.
 The decision variables in some LPP would be meaningful only if they have integer values.
But sometimes we get fractional values to the optimal solution, where only integer values are
meaningful.
 All the parameters in the LP model are assumed to be known constants. But in real life they
may not be known completely or they may be probabilistic and they may be liable for
changes from time to time.
13
 The problems are complex if the number of variables and constraints are quite large.
LP deals with only single objective problems, whereas in real life situations, there may be
more than one objective.
2. An electronic company manufactures two TV models each on a separate production line. The
daily capacity of the first line is 120 TVs and that of the second is 150 TVs. Each unit of the
first model uses 10 pieces of a certain electronic component, whereas each unit of the second
model requires 8 pieces of the same component. The maximum daily availability of the special
component is 1600 pieces. The profits per unit of models 1 and 2 are Rs. 6000 and Rs. 4000
respectively. Determine he optimum daily production of each model using graphical method.
(8)
Solution:
Let be the number of TV sets of model 1;
Let be the number of TV sets of model 2;
Maximize
Subject to

Convert the given inequality constraints as equalities.

(i.e)

When equation (1) gives and

Put equation (1) gives
The solution space is given below with the shaded area with vertices
O( 0 , 0 ), A ( 120 , 0 ), B (120 , 50 ), C ( 40 , 150 ) and D ( 0, 150 ).

The values of Z at these vertices are given by

Vertices Value of Z
14
 O( 0 , 0 ) 0
A ( 120 , 0 ) 720000
B (120 , 50 ) 920000
C ( 40 , 150 ) 600000
D ( 0, 150 ) 600000
Since the problem is of Maximization type ,the optimum solution is
Maximum

3. Solve the following LPP by the graphical method (A/M 2017)(8)

Max
Subject to

Solution:
Convert the given inequality constraints as equalities.
(i.e)

The solution space is given below with the shaded area with vertices
O( 0 , 0 ), A ( 12 , 0 ), and B ( 0, 6 ).

The values of Z at these vertices are given by

Vertices Value of Z
O( 0 , 0 ) 0
A ( 12 , 0 ) 72
B(0,6) 48
Since the problem is of Maximization type, the optimum solution is
Maximum

4. Solve the following LPP by the graphical method (8)

Max
Subject to

15
 Solution:
Convert the given inequality constraints as equalities.

The solution space is given below with the shaded area with vertices
O( 0 , 0 ), A ( 2 , 0 ), B (2 , 1 ), C ( 2/3, 7/3 ) and D ( 0, 1 ).

The values of Z at these vertices are given by

Vertices Value of Z
O( 0 , 0 ) 0
A(2,0) 6
B(2,1) 8
C ( 2/3,7/3 ) 20/3
D ( 0, 1 ) 2
Since the problem is of Maximization type, the optimum solution is
Maximum

5. Apply graphical method to solve the LPP: (8)

Max
Subject to

Solution:
Convert the given inequality constraints as equalities.

16
 Solving eqn (1) and (2) we get the point of intersection is

By using graphical method, the solution space (feasible region) is given below with shaded area

ABCDE with vertices .

The values of Z at these vertices are given by

Vertices Value of Z

1
-3
-5
-4
Since the problem is of Maximization type, the optimum solution is
Maximum Z=1,

6. Solve by graphical method: (8)

Minimize
Subject to

Solution:
Convert the given inequality constraints as equalities.
17
 By using graphical method, the solution space is given below with the shaded area ABCD with
vertices

The values of Z at these vertices are given by

Vertices Value of Z

144
192
240
Since the problem is of Minimization type , the minimum value is obtained at the point B.
The optimum solution is Minimum

7. Solve by graphical method: (8)

Maximize
Subject to

Solution:
Convert the inequality constraints as equalities,

18
 By using graphical method, the solution space is given below with the shaded area OABCD with
vertices
The values of Z at these vertices are given by
Vertices Value of Z
18
24
24
18
Since the problem is of Maximization type, the maximum value is Maximum obtained at the
point B and C. It can be achieved not only at B and C but every point between B and C. Hence the
given problem has multiple optimum solutions.

8. Solve graphically (8)

Maximize
Subject to

Solution:
Convert the inequality constraints as equalities,

19
 There is no common feasible region generated by two constraints together i.e., we cannot
identify even a single point satisfying the constraints. Hence there is no optimal solution.

9. A manufacturer of furniture makes two products – chairs and tables. Processing of this
product is done on two machines A and B. A chair requires 2 hours on machine A and 6 hours
on machine B. A table requires 5 hours on machine A and no time on machine B. There are 16
hours of time per day available on machine A and 30 hours on machine B. Profit gained by the
manufacturer from a chair and a table is Rs. 2 and Rs. 10 respectively. What should be the
production of each of two products? Solve by graphical method. (8)
Solution:
Let be the number of Chairs
Let be the number of Tables
Hence the LPP is given by
Maximize
Subject to

Convert the given inequality constraints as equalities.

By using graphical method, the solution space is given below with the shaded area OABCD with
vertices

The values of Z at these vertices are given by

20
 Vertices Value of Z
32
22
10
Since the problem is of Maximization type , the maximum value is obtained at the point A.
The optimum solution is Maximum .
10. A company manufactures 2 types of printed circuits. The requirements of transistors, resistors
and capacitors for each type of printed circuits along with other data are given below:
(8)
Circuit Stock
available
A B
Transisto 15 10 180
r
Resistor 10 20 200
Capacito 15 20 210
r
Profit Rs. Rs.
5 8
How many circuits of each type should the company produce from the stock to earn maximum
profit?
Solution:
Let be the number of type A circuits and be the number of type B circuits to be
produces.
To produce these units of type A and Type B circuits, the company requires
Transistors =
Resistors =
Capacitors =
Since the availability of these transistors, resistors and capacitors are 180, 200 and 210 respectively.
The constraints are

Since the profit from type A is Rs. 5 and type B is Rs.8 per units. The total profit is
Therefore , the complete formulation of the LPP is

Maximize
Subject to

Convert the given inequality constraints as equalities.

21
 By using graphical method, the solution space is given below with the shaded area OABCD with
vertices

The values of Z at these vertices are given by

Vertices Value of Z
0
60
74
82
80
Since the problem is of Maximization type , the optimum solution is
Maximum
11. Solve by graphical method (8)
Maximize
Subject to

Solution:
Convert the inequality constraints as equalities,

22
 By using graphical method, the solution space is given below with the shaded area ABCD with
vertices
The values of Z at these vertices are given by
Vertices Value of Z
35
28
21
27
The values of objective function at corner points are 35, 28, 21 and 27. But there exists infinite
number of points in the feasible region which is unbounded. The value of objective function will be
more than the value of these four corner points. i.e the maximum value of the objective function
occurs at a point at . Hence the given problem has unbounded solution.

12. Solve the following LPP using graphical method. [N/D 2016] (8)
Maximize
Subject to

Solution:
Convert the inequality constraints as equalities,

23
 By using graphical method, the solution space is given below with the shaded area ABCD with
vertices
The values of Z at these vertices are given by
Vertices Value of Z
200
1000
640

The optimal solution is given by Max Z= 1000, .

Resource allocation problem & Simplex method

13. Describe the simplex algorithm of solving linear programming problem. (8)
Solution:
For the solution of any LPP by simplex method, the existence of an initial basic feasible
solution is assumed. The steps for computing the optimal solution is as follows:
Step 1: Check whether the objective function of the given LPP is to be maximized or minimized. If it
is to be minimized then convert it into a problem of maximization by
Minimum of Z = - Maximum (-Z)
Step 2: Check whether all are positive. If any of the is negative, multiply both sides of that
constraint by -1 so as to make its right hand side positive.
Step 3: By introducing slack or surplus variables, convert the inequality constraints into equations
and express the given LPP into its standard form.
Step 4: Find an initial basic feasible solution to the problem in the form and put it in the
first column of the simplex table.

Step 5: Compute the net evaluations by using the relation

.
Examine the sign of
a) If all , then the current basic feasible solution is optimal.

24
 b) If atleast one , then the current basic feasible solution is not optimal. Go to next
step.
Step 6: ( To find the entering variable )
The entering variable is the non-basic variable corresponding to the most negative value of
. Let it be for some . The entering variable column is known as the Key column(or)
pivot columnwhich is shown marked with an arrow at the bottom. If more than one variable has the
same most negative , any of these variables may be selected arbitrarily as the entering
variable.
Step 7: ( To find the leaving variable )

Compute the ratio (i.e) the ratio between the solution column and the
entering variable column by considering only the positive denominators)
a) If all , then there is an unbounded solution to the given LPP.
b) If atleast one , then the leaving variable is the basic variable corresponding to

the maximum ratio . If , then the basic variable leaves the basis. The
leaving variable row is called the Key row (or) pivot equation, and the element at the
intersection of the pivot column and pivot row called the pivot element (or) key
element (or) leading element.
Step 8: Drop the leaving variable and introduce the entering variable along with its associated value
under column. Convert the pivot element to unity by dividing the pivot equation by the pivot
element and all other elements in its column to zero by making use of
i. New pivot equation = old pivot equation / pivot element
ii. New equation (all other rows including row) = Old equation –
(Corresponding column co efficient) * (New pivot equation)
Step 9: Go to Step 5 and repeat the procedure until either optimum solution is obtained or there is an
indication of an unbounded solution.
14. Find the non negative values of and which (8)
Maximize
Subject to

Solution:
By introducing non-negative slack variables s1, s2 and s3 the standard form of the LPP becomes
Maximize
Subject to

Since there are 3 equations with 6 variables, the initial basic feasible solution is obtained by equating
(6-3) = 3 variables to zero.
25
 The initial basic feasible solution is

The initial simplex table is given by

Initial iteration:
Cj ( 3 2 5 0 0 0)
CB YB XB Θ
0 s1 420 1 4 0 1 0 0
-
0 s2 460 3 0 (2) 0 1 0
(Mini value)
0 s3 430 121 0 0 1

0 0 0 0 0 0 0
-3 -2 -5 0 0 0

Most –ve value

Since there are some the current basic feasible solution is not optimal.
Entering variable – , Leaving variable – , Pivot element = 2

First iteration:
Cj (3 2 5 0 0 0 )
CB YB XB Θ
0 s1 420 1 0 0 0

230 -
5 1 0

200
0 s3 0 1
(Mini value)

1150
0 5 0 0

-2 0 0 0

26
 Most –ve value
Since the current basic feasible solution is not optimal.
Entering variable – , Leaving variable – , Pivot element = 2

Second iteration:
Cj (3 2 5 0 0 0 )
CB YB XB

0 s1 20 2 0 0 1 -2

230
5 01 0
100
2 0

1350 7 2 5 0 2 1
1350 40 0 0 2 1

Since all the current basic feasible solution is optimal.

The optimal solution is given by Max Z= 1350,

15. A gear manufacturing company received an order for these specific types of gear for regular
supply. The management is considering to devote the available excess capacity to one or more
of the three types A,B and C. The available capacity on the machines which might limit output
and the number of machine hours required for each unit of the respective gear is also given
below.
Available Productivity in Machine hours/unit
Machine Type Machine
Hours/Week Gear A Gear B Gear C
Gear Hobbing
250 8 2 3
m/c
Gear Shaping
150 4 3 0
m/c
Gear grinding 50 2 - 1

The unit profit would be Rs. 20, Rs.6 and Rs.8 respectively for the Gears A,B and C. Find how
much of gear the company should produce in order to maximize profit? (8)
Solution:

27
 be the number of units of gears A, B and C produced respectively to maximize the
Let
profit. The mathematical formulation of the LPP is given by
Maximize

Subject to

By introducing non-negative slack variables s1, s2 and s3 the standard form of the LPP becomes
Maximize
Subject to

Since there are 3 equations with 6 variables, the initial basic feasible solution is obtained by equating
(6-3) = 3 variables to zero.
The initial basic feasible solution is
The initial simplex table is given by
Initial iteration:
Cj ( 20 6 8 0 0 0)
CB YB XB

0 s1 250 8 2 3 1 0 0

0 s2 150 4 3 0 0 1 0

0 s3 50 (2) 0 1 0 0 1
(Mini value)
0 0 0 0 0 0 0
-20 -6 -8 0 0 0

Most –ve value

Since there are some the current basic feasible solution is not optimal.
Entering variable – , Leaving variable – , Pivot element = 2

28
First iteration:
Cj ( 20 6 8 0 0 0)
CB YB XB Θ

0 s1 50 0 2 -1 0 -4

0s2 50
-2 -2
25 (Mini value)
20

50 20 0 10 0 0 10
0
0-6 2 0 10

Most –ve value

Since the current basic feasible solution is not optimal.
Entering variable – , Leaving variable – , Pivot element = 3

Second iteration:
Cj ( 20 6 8 0 0 0)
CB YB XB Θ

0 s1 0 0

6 -
0

29
 20
1 0 0 0 (Mini value)
600 20 6 10 0 2 6
0 -20 6
Most –ve value
Since the current basic feasible solution is not optimal.
Entering variable – , Leaving variable – , Pivot element = 1/2

Third iteration:
Cj ( 20 6 8 0 0 0)
CB YB XB

0 s1 0
0 0 -3
50
6 0 0

8 50 1

700 24 6 8 0 2 8
0 0 0 8

Since all the current basic feasible solution is optimal.

The optimal solution is given by Max Z= 700,
Hence the company should produce 50 units of gear B, 50 units of gear of C and none of gear A in
order to have a maximum profit Rs. 700.
16. Use Simplex method to solve the LPP (Apr’14) (8)

30
 Maximize
Subject to constraints

Solution:
By introducing non-negative slack variables s1, s2 and s3 the standard form of the LPP becomes
Maximize
Subject to

Since there are 3 equations with 5 variables, the initial basic feasible solution is obtained by equating
(5-3) = 2 variables to zero.
The initial basic feasible solution is
The initial simplex table is given by
Initial iteration:
Cj ( 4 10 0 0 0)

CB YB XB

0 s1 50 2 1 1 0 0

0 s2 100 2 (5) 0 1 0
(Mini value)
0 s3 90 2 3 0 0 1

0 0 0 0 0 0
-4 -10 0 0 0

Most –ve value

Since there are some the current basic feasible solution is not optimal.
Entering variable – , Leaving variable – , Pivot element = 5

31
 First iteration:
Cj (4 10 0 0 0)
CB YB XB
0 s1 30
0 0
20
10
1 0

30
0 s3
0 1

200 4 10 0 2 0
0 0 0 2 0

Since all the current basic feasible solution is optimal.

The optimal solution is given by Max Z= 200,

17. Solve the following: (8)

Maximize
Subject to

Solution:
By introducing non-negative slack variables s1, s2 and s3 the standard form of the LPP becomes
Maximize
Subject to

The initial basic feasible solution is

The initial simplex table is given by

Initial iteration:
32
 Cj ( 15 6 9 2 0 0 0 )
CB YB XB

0 s1 20 2 1 5 6 1 0 0

0 s2 24 (3) 1 3 25 0 1 0
Mini
0 s3 70 7 0 0 1 0 0 1

0 0 0 0 0 0 0 0
-15 -6 -9 -2 0 0 0

Most -ve
Since there are some the current basic feasible solution is not optimal.
Entering variable – , Leaving variable – , Pivot element = 3
First iteration:
Cj ( 15 6 9 2 0 0 0 )
CB YB XB Θ

0 s1 4 mini
0 3 1 0
15 x1 8
1 1 0 0

0 s3 14
0 -7 0 1 _

120 15 5 15 125 0 5 0
0 -1 6 123 0 5 0

Most -ve
Since the current basic feasible solution is not optimal.
Entering variable – , Leaving variable – , Pivot element = 1/3
Second iteration:
Cj ( 156 9 2 0 0 0 )
CB YB XB
6 x2 12 0 1 9 -32 3 -2 0

15 x1 4 1 0 -2 19-1 1 0

0 s3 42 0 0 14 -132 7 -7 1
132 15 6 24 93 3 3 0
0 0 15 91 3 3 0

Since all the current basic feasible solution is optimal.

33
 The optimal solution is given byMax Z= 132,

18. Solve the following LPP by Simplex method (8)

Minimize
Subject to

Solution:
Since the given objective function is of minimization type. We shall convert it into a
Maximization type as follows:
*
=
Maximize (-Z) = Maximize Z
Subject to

By introducing non-negative slack variables s1, s2 the standard form of the LPP becomes
Maximize
Subject to

and
The initial basic feasible solution is
The initial simplex table is given by

Initial iteration:
Cj ( -8 2 0 0 )
CB YB XB

0 s1 1 -4 (2) 1 0
Mini
0 s2 3 5 -4 0 1
-

0 0 0 0 0
8 -2 0 0

Most -ve

Since the current basic feasible solution is not optimal.

Entering variable – , Leaving variable – , Pivot element = 2

34
 First iteration:
Cj ( -8 2 0 0 )
CB YB XB
-2 1 1/2 0
2

5 -3 0 2 1
0 s2
1 -4 2 1 0
1 4 0 1 0

Since all the current basic feasible solution is optimal.

,
Maximize Z* = 1,
Min Z= -Max(-Z) = - Max Z* = - 1
The optimal solution is given by Minimum Z = - 1,

19. Solve the following LPP by simplex method. [N/D 2016] (8)
Maximize
Subject to

Solution:
Given LPP
Maximize
Subject to

By introducing non-negative slack variables s1, s2 and s3, the standard form of the LPP becomes
Maximize
Subject to

The initial basic feasible solution is

The initial simplex table is given by

Initial iteration:
35
 Cj ( 4 1 3 5 0 0 0)
CB YB XB
20 -4 65 -4 1 0 0 -
0

0 10 3 -2 4 1 0 1 0 10

20 8 -3 3 (2) 0 0 1 10 Mini
0
0 0 0 0 0 0 0 0
-4 -1 -3 -50 0 0
Most -ve
Since there are some the current basic feasible solution is not optimal.
Entering variable – , Leaving variable – , Pivot element = 2
First iteration:
Cj ( 4 1 3 5 0 0 0)
CB YB XB
60 12 011 0 1 0 2
0

0 0 -1 -1/2 5/2 0 0 1 -1/2

-
10 4 -3/2 3/2 1 0 0 1/2
5
-
50 20 -15/2 15/2 5 0 0 5/2
16 -17/2 9/2 50 0 5/2
Most -ve
Since there are some the current basic feasible solution is not optimal.

Since all , it is not possible to find the positive ratio

i.e., it is not possible to find the leaving variable.
Hence the solution of the given problem is unbounded.

20. Use Simplex method : (8)

Minimize
Subject to

Solution:
Since the given objective function is of minimization type. We shall convert it into a
Maximization type as follows:

36
 *
=
Maximize (-Z) = Maximize Z
Subject to

By introducing non-negative slack variables s1, s2 and s3 the standard form of the LPP becomes
Maximize Z* =
Subject to

The initial basic feasible solution is

The initial simplex table is given by
Initial iteration:
Cj ( -1 3 -2 0 0 0)
CB YB XB

0 s1 7 3 -1 2 1 0 0
-
0 s2 12 -2 (4) 0 0 1 0
Mini
0 s3 10 -4 3 8 0 0 1

0 0 0 0 0 0 0
1 -3 2 0 0 0
Most –ve
Since there are some the current basic feasible solution is not optimal.
Entering variable – , Leaving variable – , Pivot element = 4
First iteration:
Cj ( -1 3 -2 0 0 0)
CB YB XB Θ
0 s1 10
0 2 1 0 Mini
3
3
- 1 0 0 -
1
0 s3
0 8 0 1 -
9
3 0 0 0

0 2 0 0
Most –ve
37
 Since the current basic feasible solution is not optimal.
Entering variable – , Leaving variable – , Pivot element = 5/2
Second iteration:
Cj ( -1 3 -2 0 0 0)
CB YB XB

-1
1 0 0
3 5
0 1 0
0 s3 11
0 0 10 1 1

11
-1 3 0

0 0

Since all the current basic feasible solution is optimal.

,
Maximize Z* = 11,
Minimum Z= -Max (-Z) = -11
The optimal solution is given by Min Z= -11,

21. An manufacturer makes two components ,T and A,in a factory that is divided into two shops.
Shop I, which performs the basic assembly operation, must work 5 man-days on each
component T but only 2 man-days on each component A. Shop II, which performs finishing
operation must work 3 man-days for each of component T and A it produces. Because of men
and machine limitations, Shop I has 180 man-days per week available, while Shop II has 135
man-days per week. If the manufacturer makes a profit of Rs.300 on each component T and
Rs.200 on each component A, how many of each should he produce to maximize his profit. Use
simplex method. (N/D 2017) (8)
Solution:
Let and be units of components manufactured per week to maximize his profit.
Then the mathematical form of the given problem will be:
Maximize
Subject to constraints

By introducing non-negative slack variables s1, s2 the standard form of the LPP becomes
Maximize
Subject to

38
 The initial basic feasible solution is
The initial simplex table is given by
Initial iteration:
Cj ( 300 200 0 0)
CB YB XB

0 s1 180 (5) 2 1 0 Mini

0 s2 135 3 3 0 1
= 45
0 0 0 0 0
0 -300 -200 0 0
Most -ve
Since there are some the current basic feasible solution is not optimal.
Entering variable – , Leaving variable – , Pivot element = 5
First iteration:
Cj ( 300 200 0 0)
CB YB XB Θ
36
300
1 0 90
0 s2
27 Mini
0 1
10,800 1 120 60 0
0 -80 60 0
Most -ve
Since there are some the current basic feasible solution is not optimal.
Entering variable – , Leaving variable – , Pivot element = 9/5
Second iteration:
Cj ( 300 200 0 0)
CB YB XB
30
300
1
200 15
0 1

12000
300 200

0 0
Since all the current basic feasible solution is optimal.
The optimal solution is given by Max Z= 12000, .
The manufacturer should manufacture 30 and 15 components per week in order to get a
maximum profit of Rs. 12,000.

22. Solve by simplex method (8)

39
 Maximize
Subject to

Solution:
By introducing non-negative slack variables s1, s2 the standard form of the LPP becomes
Maximize
Subject to

The initial basic feasible solution is

The initial simplex table is given by
Initial iteration:
Cj ( 5 3 0 0)
CB YB XB
0 s1 15 3 5 1 0
=5
0 s2 10 (5) 2 0 1
Mini
0 0 0 0 0

-5 -3 0 0
Most -ve

Since there are some the current basic feasible solution is not optimal.
Entering variable – , Leaving variable – , Pivot element = 5

First iteration:
Cj (5 3 0 0)
CB YB XB Θ
0 s1 9
0 1 Mini

2 5
5 1 0
10 5 2 0 1

0 -1 0 1

Most -ve

Since there are some the current basic feasible solution is not optimal.
Entering variable – , Leaving variable – , Pivot element = 19/5

40
 Second iteration:
Cj (5 3 0 0)
CB YB XB

3 0 1

5 1 0

0 0
Since all the current basic feasible solution is optimal.

The optimal solution is given by Max Z = , .

23. Solve by simplex method: (8)

Maximize
Subject to

Solution:
By introducing non-negative slack variables s1, s2 and s3 the standard form of the LPP
becomes
Maximize
Subject to

Since there are 3 equations with 5 variables, the initial basic feasible solution is obtained by equating
(5-3) = 2 variables to zero.
The initial basic feasible solution is
The initial simplex table is given by
Initial iteration:
Cj ( 5 7 0 0 0)
CB YB XB Θ
0 s1 4 1 (1) 1 0 0 4 Mini

0 s2 24 3 -8 0 1 0 -

0 s3 35 10 7 0 0 1 5
0 0 0 0 0 0
-5 -7 0 0 0

41
 Most -ve
Since there are some the current basic feasible solution is not optimal.
Entering variable – , Leaving variable – , Pivot element = 19/5
First iteration:
Cj (5 7 0 0 0)
CB YB XB
4 1 1 0 0
7
56 11 0 8 1 0
0s2
7 3 0 -7 0 1
0 s3
28 7 7 7 0 0
2 0 7 0 0

Since all the current basic feasible solution is optimal.

The optimal solution is given by Max Z= 28, .

24. Solve by simplex method: (8)

Maximize
Subject to

Solution:
By introducing non-negative slack variables s1, s2 and s3 the standard form of the LPP
becomes
Maximize
Subject to

Since there are 3 equations with 6 variables, the initial basic feasible solution is obtained by equating
(6-3) = 3 variables to zero.
The initial basic feasible solution is
The initial simplex table is given by
Initial iteration:
Cj ( 2 -31 0 0 0)
CB YB XB Θ
0 s1 6 361 1 0 0

0 s2 4 (4) 21 0 1 0
Mini
0 s3 3 1 -1 1 0 0 1

42
 0 0 0 0 0 0 0
0 -2 3-1 0 0 0
Most -ve
Since there are some the current basic feasible solution is not optimal.
Entering variable – , Leaving variable – , Pivot element = 4
First iteration:
Cj ( 2 -31 0 0 0)
CB YB XB Θ

0 s1 3
0 0

2 1 4
1 0

0 s3 2 Mini
0 1
2 2 1 1/2 0 1/2 0
2
4- 0 0

Most -ve
Since the current basic feasible solution is not optimal.
Entering variable – , Leaving variable – , Pivot element = 3/4
Second iteration:
Cj ( 2 -3 1 0 0 0)
CB YB XB
0 s1
0 50
2
1 0

1
0 -2 1

2 0 1 0

0 30 0
Since all the current basic feasible solution is optimal.

The optimal solution is given by Max Z = , , , .

25. Use Simplex method : (8)
Maximize
Subject to

43
Solution:
By introducing non-negative slack variables s1, s2 and s3 the standard form of the LPP becomes
Maximize
Subject to

Since there are 3 equations with 5 variables, the initial basic feasible solution is obtained by equating
(5-3) = 2 variables to zero.
The initial basic feasible solution is
The initial simplex table is given by
Initial iteration:
Cj ( 3 50 0 0)
CB YB XB

0 s1 18 3 21 0 0
18/2 = 9
0 s2 4 1 00 1 0
4/0 = (neglect)
0 s3 6 0 (1) 0 0 1
6/1 = 6 Mini
0 0 0 0 0 0
0 -3-5 0 0 0

Most -ve
Since there are some the current basic feasible solution is not optimal.
Entering variable – , Leaving variable – , Pivot element = 1

First iteration:
Cj ( 350 0 0)
CB YB XB
0 s1 6 (3) 0 1 0 -2 6/3 = 2 Mini

4/1 = 4
0 s2 4 1 0 0 1 0

-
6 0 1 0 0 1
5
30 0 5 0 0 5

44
 -30 0 0 5

Most -ve
Since the current basic feasible solution is not optimal.
Entering variable – , Leaving variable – , Pivot element = 3

Second iteration:
Cj ( 3 5 0 0 0)
CB YB XB
2 10 1/3 0 -2/3
3

0 s2 2 0 0-1/3 1 2/3

6 0 10 0 1
5
36 3 5 1 0 3
00 1 0 3

Since all the current basic feasible solution is optimal.

The optimal solution is given by Max Z= , , , .

26. Use the simplex method to (8)

Maximize
Subject to

Solution:
By introducing non-negative slack variables s1, s2 and s3 the standard form of the LPP
becomes
Maximize
Subject to

Since there are 3 equations with 5 variables, the initial basic feasible solution is obtained by equating
(5-3) = 2 variables to zero.
The initial basic feasible solution is
The initial simplex table is given by
Initial iteration:
Cj ( 5 40 0 0)
CB YB XB

45
 0 s1 10 4 5 1 0 0
10/4
0 s2 9 3 2 0 1 0
9/3
0 s3 12 (8) 3 0 0 1
12/8 Mini
0 0 0 0 0 0
-5 -4 0 0 0
Most -ve
Since there are some the current basic feasible solution is not optimal.
Entering variable – , Leaving variable – , Pivot element = 8

First iteration:
Cj ( 5 4 0 0 0)
CB YB XB
4 0 (7/2) 0 -1/2 8/7 Mini
0
9/2 0 7/80 1 -3/8 36/7
0
3/2 1 3/180 0 1/8 9
5
15/2 5 15/18 0 0 5/8
0 -17/8 0 0 5/8
Most -ve
Since there are some the current basic feasible solution is not optimal.
Entering variable – , Leaving variable – , Pivot element = 7/2
Second iteration:
Cj ( 5 4 0 0 0)
CB YB XB
8/7 0 12/7 0 -1/7
4

0 7/2 0 0-1/4 1 -1/4

15/14 1 0 -3/28 0 5/28

5
139/1 5 4 17/28 0 9/28
4
0 0 17/28 0 9/28

Since all the current basic feasible solution is optimal.

The optimal solution is given by Max Z= 139/14, .
27. Solve the LPP
Maximize
Subject to

46
 (8)
Solution:
By introducing non-negative slack variables s1,s2and the artificial variable the standard
form of the LPP becomes

Maximize

Subject to

The initial basic feasible solution is

The initial simplex table is given by
Initial iteration:
Cj (107 1 2 0 0 0 -M)

CB YB XB

7 14 1-6 30 0 1
-M

0 5 161/2-6 01 00

0 (3) -1 -1 0 0 10
0 (Min value)
-7M -14M-M6M-3M 0 0 -M
0 -14M-107-M-16M-2 -3M0 0 0

Most –ve value

Since there are some the current basic feasible solution is not optimal.
Entering variable – , Leaving variable – , Pivot element = 3

47
First iteration:
Cj ( 107 120 0 0 -M)
CB YB XB
7 0 17/3-4/33 0 -14/31
-M

0 5 0(35/6)-2/301 -16/3 0
-
0 1-1/3-1/30 01/3 0
107

0 -3M 0 -M

0 -3M0 0
Most –ve
Since there are some the current basic feasible solution is not optimal.
Entering variable – , Leaving variable – , Pivot element = 35/6
Second iteration:
Cj ( 1071 2 0 0 0-M)
CB YB XB
15/7 0 0 -24/35(3) -34/3518/351
-M

-
1 6/7 0 1 -4/35 0 6/35-32/350

-
2/7 1 0-13/35 0 2/351/35 0
107

107 1 -3M -M

0 0 -3M 0
Most –ve
Since there are some the current basic feasible solution is not optimal.
Entering variable – , Leaving variable – , Pivot element = 3
Third iteration:
Cj ( 1071 2 0 0 0)
CB YB XB
5/7 0 0 (-8/35) 1-34/105 6/35 -
0
48
 6/7 0 1 -4/35 0 6/35 -32/35 -
1
2/7 1 0 -13/35 0 2/35 1/35 -
107

107 1 0 -M

0 0 0 0
Most –ve
Since there are some the current basic feasible solution is not optimal.Since there is no
positive element in the column. There exists an unbounded solutionto the given LPP.

28. Solve the following LPP using Big M Method: (8)

Maximize
Subject to

Solution:
By introducing non-negative surplus variables s1, s2 the standard form of the LPP becomes
Maximize

Subject to

To get the basic feasible solution, add the artificial variables and to the left hand side of the
constraint equation and assign – M to the artificial variable in the objective function. The canonical
form of the above standard form is
Maximize

Subject to

The initial basic feasible solution is

The initial simplex table is given by

Initial iteration:
Cj ( 10 15 20 00 -M - M)
CB YB XB

-MA1 24 246 -10 1 0

-MA2 30 3(9)60 -1 0 1
Mini
49
 -5M -13M -12M M M -M -M

-54M -5M-10-13M-15 -12M-20 M M 0 0

Most –ve

Since there are some the current basic feasible solution is not optimal.
Entering variable – , Leaving variable – , Pivot element = 9
First iteration:
Cj ( 10 1520 00 - M)
CB YB XB Θ

-M A1 32/3 2/30(10/3) -1 4/91

Mini
10/3 1/3 12/3 0 -1/9 0
15 5

15 M -M

0 -M 0
Most –ve
Since there are some the current basic feasible solution is not optimal.
Entering variable – , Leaving variable – , Pivot element = 10/3
Second iteration:
Cj ( 101520 00 )
CB YB XB Θ

16/5 1/50 1 -3/10 2/15 -

20
6/5 (1/5) 1 0 1/5 -1/5 6 Mini
15
82 7 15 20 -3 -1/3

82 -3 0 0 -3 -1/3

Most –ve

Since all the current basic feasible solution is optimal.

Entering variable – , Leaving variable – , Pivot element = 1/5
Third iteration:
Cj ( 10 15 20 00 )
CB YB XB Θ

2 0 -1 1 -1/2(1/3) 6 Mini
20
6 1 5 01 -1 -
50
 10
100 1030 20 0 -10/3

0 15 0 0 -10/3

Most –ve
Since all the current basic feasible solution is optimal.
Entering variable – , Leaving variable – , Pivot element = 1/3
Fourth iteration:
Cj ( 10 15 20 00 )
CB YB XB Θ

6 0 -3 3 -3/2 1 -
0
12 1 2 3 -1/2 0 -
10
100 10 20 30 -5 0

0 5 10 -5 0
Most –ve
Since all the current basic feasible solution is optimal.
The solution for the given problem is unbounded.

29. Use penalty method to solve (8)

Minimize
Subject to

Solution:
Convert the minimization problem into maximization as
Maximize Z* = - Minimize (-Z) =
By introducing non-negative surplus variables s1, s3 and slack variable s2 ,the standard form of the
LPP becomes
Maximize

Subject to

and
To get the basic feasible solution, add the artificial variables A 1 and A2 to the left hand side of the
constraint equation and assign – M to the artificial variable in the objective function. The canonical
form of the above standard form are
Maximize

51
 Subject to

The initial basic feasible solution is

The initial simplex table is given by

Initial iteration:
Cj ( -4-3 0 00 -M - M)
CB YB XB

-M A1 10 (2)1 -100 1 0 Mini

6 -3 2 0 1 0 0 0 --
0
6 1 1 0 0 -1 0 1
-M
-16M -3M -2M M 0 M -M-M
-3M+4 -2M+3 M0 M 0 0
Most –ve
Since there are some the current basic feasible solution is not optimal.
Entering variable – , Leaving variable – , Pivot element = 2
First iteration:
Cj ( -4-3 0 00 - M)
CB YB XB

5 1 1/2 -1/2 00 0 10
-4
21 0 7/2 -3/2 1 0 0 42/7
0
1 0 (1/2) 1/2 0 -1 1 2 Mini
-M
-M-20
0 0 M -M
0 (-M+2)/2 (-M+4)/20 M 0
Most –ve
Since there are some the current basic feasible solution is not optimal.
Entering variable – , Leaving variable – , Pivot element = 1/2
Second iteration:
Cj ( -4-30 00)
CB YB XB

52
 4 1 0 -1 01
-4
14 0 0 -5 1 7
0
2 0 1 1 0 -2
-3
-22 -4 -3 1 0 2

0 0 1 0 2

Since all the current basic feasible solution is optimal.

Max Z*= -22, But Min Z= -Maz(-Z)= -Max Z*= 22
The optimal solution is given by Min Z=22,
30. Use two phase simplex method to (16)

Maximize
Subject to

Solution:
By introducing non-negative slack variables s1, s2, surplus variable s3and artificial variable A1, the
standard form of the LPP becomes

Maximize
Subject to

The initial basic feasible solution is

Phase-I:
The objective function of the auxiliary LPP is
Max Z* = -A1
The initial simplex table for the auxiliary LPP is given by

Initial iteration:
Cj ( 0 0 0 0 0 0 -1 )
CB YB XB
8 4 (6)3 1 0 0 0
0
Mini

0 1 3 -6 -4 0 1 0 0
--

4 2 3 -5 0 0 -1 1
53
-1

-4 -2 -3 5 0 0 1 -1
-2 -3* 500 1 0

Most –ve

Since there are some the current basic feasible solution is not optimal.
Entering variable – , Leaving variable – , Pivot element = 6

First iteration:
Cj ( 0 0 0 0 0 0 -1 )
CB YB XB
4/3 2/3 11/2 1/6 0 0 0
0
9 7 0 -1 1 1 0 0
0

0 0 0 -13/2 -1/2 0 -1 1
-1
0 0 0 13/2 1/2 0 1 -1
0 0 13/2 1/20 1 0

Since there are some the current basic feasible solution is optimal for the auxiliary
LPP.
Phase-II:
Here, we consider the actual costs associated with the original variables and assign a cost 0 to the
artificial variable R1in the objective function. The objective function becomes

Maximize
The initial basic feasible solution for this phase is the one obtained at the end of Phase-I
Initial iteration:
Cj ( 21 1/4 0 0 0 0)
CB YB XB
4/3 2/3 11/2 1/6 0 0 0 4/2
1
9 (7) 0 -1 1 1 0 0 9/7 Mini
0
0 0 0 -13/2 -1/2 0 -1 1 --
0
4/3 2/3 1 1/4 1/6 0 0 0
-4/3 0 1/4 1/60 0 0
Most -ve
Since there are some the current basic feasible solution is not optimal.
Entering variable – , Leaving variable – , Pivot element = 7

54
 First iteration:
The non-basic variable enters into the basis and the basic variable leaves the basis.
Cj ( 21 1/4 0 0 0 0)
CB YB XB
10/2 0 1 25/42 1/14 -2/21 0 0
1
1

2 1 0 -1/7 1/7 1/7 0 0

9/7
0 0 -13/2 -1/2 0 -1 1
0 0
64/2 2 1 13/42 5/14 4/21 0 0
1
0 0 5/84 5/144/21 0 0

Since there are some the current basic feasible solution is optimal.

The optimal solution is given by Max Z= 64/21, .

31. Use two phase simplex method to solve (16)
Maximize
Subject to

Solution:
By introducing non-negative slack variables s1, s2, surplus variable s3and artificial variable A1, the
standard form of the LPP becomes
Maximize
Subject to

The initial basic feasible solution is

Phase-I:
The objective function of the auxiliary LPP is
Max Z* = -A1
The initial simplex table for the auxiliary LPP is given by
Initial iteration:
Cj ( 0 0 00 -1 )
CB YB XB
1 2 (1)1 0 0
0
Mini
6 1 4 0 -1 1
-1
-6 -1 -4 0 1 -1
-1 -4* 01 0
55
 Most –ve
Since there are some the current basic feasible solution is not optimal.
Entering variable – , Leaving variable– , Pivot element = 1
First iteration:
Cj ( 0 0 0 0 -1 )
CB YB XB
1 2 11 0 0
0
2 -7 0-4-1 1
-1
-2 7 0 41 -1
7 0 4 1 0

Since there are some the current basic feasible solution is optimal for the auxiliary LPP.
Since the artificial variables lies in the optimal basis at non-zero level with a positive value in the X B
column and the optimality condition is satisfied then the original problem has no feasible solution.

56