Scribd
Upload
9 views3 pages

Unit 1 Two Marks

Linear programming (LP) is a mathematical technique used to optimize performance under resource constraints. Key components of LP include decision variables, objective functions, and constraints, with applications in areas like product mix and manpower planning. The document also discusses feasible vs. non-feasible solutions, special cases in LP, and the significance of the simplex method in finding optimal solutions.

Uploaded by

RAMESH BABU EEE
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
9 views3 pages

Unit 1 Two Marks

Linear programming (LP) is a mathematical technique used to optimize performance under resource constraints. Key components of LP include decision variables, objective functions, and constraints, with applications in areas like product mix and manpower planning. The document also discusses feasible vs. non-feasible solutions, special cases in LP, and the significance of the simplex method in finding optimal solutions.

Uploaded by

RAMESH BABU EEE
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 3

UNIT 1 Linear programming Two Marks

1. Define linear programming or what do you mean by linear programming?


Linear programming is a mathematical programming technique to optimize performance
(eg. profit or cost) under a set of resource constraints (e.g. machine-hours, man-hours,
money, materials, etc.) as specified by an organization.

2. List any four applications of LPP.

1. Product mix problem

2. Diet planning problem

3. Cargo loading problem

4. Capital budgeting problem

5. Manpower planning problem.


3. What are the components of LPP?

The model of any linear programming problem will contain: Decision variables, objective function,
set of constraints and non-negativity restrictions.

4, Distinguish between feasible and non-feasible solution.

Feasible Solution:
A feasible solution in Linear Programming Problem (LPP) is a solution that satisfies all the
given constraints, including non-negativity conditions.

Non-Feasible Solution:
A non-feasible solution is a solution that violates one or more of the constraints and hence
does not lie within the feasible region.

5.
6. Name the Special Cases in Linear Programming Problems (LPP):

1. Infeasible Solution
2. Unbounded Solution
3. Multiple (Infinite) Solutions
4. Degenerate Solution

7. State the Limitations of the Graphical Method:

1. It is applicable only to Linear Programming Problems with two decision variables.


2. It is not suitable for involving more than two variables.

8. Define basic variables and artificial variables

Basic Variables:
Basic variables are the variables in a linear programming solution that are assigned non-zero
values in a basic feasible solution.

Artificial Variables:
Artificial variables are temporarily added to constraints (especially ≥ or = type) to obtain an
initial basic feasible solution for applying the simplex method.

9. What is the role of slack variables and surplus variables in LPP?

Slack Variables:
Slack variables are added to ‘≤’ constraints to convert them into equalities in LPP.

Surplus Variables:
Surplus variables are subtracted from ‘≥’ constraints to convert them into equalities in LPP.

10. What are the Major Assumptions in Linear Programming Problems (LPP):

1. Linearity: The objective function and constraints are linear.


2. Additivity and Divisibility: Total effect is the sum of individual effects, and
variables can take fractional values.

11. Identify the requirements of LPP?

1. A linear objective function to be maximized or minimized.


2. A set of linear constraints including inequality or equality conditions and non-
negativity restrictions.

12. What is decision making in LPP?

Choosing the best solution from many options to maximize or minimize a goal while following
certain limits.

13. State Significance of solving Simplex Method in LPP:


It helps find the optimal solution efficiently for problems with multiple variables and constraints,
ensuring the best use of resources.
14. What are the applications Operations Research in finance functions?

 Portfolio optimization to maximize returns and minimize risk.

 Budgeting and financial planning for effective resource allocation.

 Risk analysis and management to reduce financial losses.

 Cash flow and investment decision-making to improve profitability.

15. What is OR?

Operation Research:
It is a scientific approach that uses mathematical models and analytical methods to help make better
decisions and solve complex problems in organizations.

You might also like