Scribd
Upload
161 views7 pages

Canonical and Standard Forms of LLP

The document discusses the canonical and standard forms of linear programming problems (LPPs), highlighting their differences and applications. Canonical form is a maximization problem with equality constraints, while standard form can be either maximization or minimization with inequality constraints. Both forms are essential for solving various optimization problems in fields like business and engineering.

Uploaded by

kum9748ar
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
161 views7 pages

Canonical and Standard Forms of LLP

The document discusses the canonical and standard forms of linear programming problems (LPPs), highlighting their differences and applications. Canonical form is a maximization problem with equality constraints, while standard form can be either maximization or minimization with inequality constraints. Both forms are essential for solving various optimization problems in fields like business and engineering.

Uploaded by

kum9748ar
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/ 7

CAMELLIA INSTITUTE OF TECHNOLOGY

Canonical and standard


forms of LPP
OBJECTIVE
Linear programming problems (LPPs) can be formulated in two ways: canonical form and standard form. In canonical form, an LPP is a maximization
problem where all of the constraints are equalities and all of the variables are non-negative. This form is often used to solve LPPs using simplex
algorithms. In standard form, an LPP is a maximization or minimization problem where all of the constraints are inequalities and all of the variables
are non-negative. This form is often used to solve LPPs using interior point methods.Canonical and standard forms are two important forms of LPPs.
They are used to solve LPPs using different algorithms and have different applications. Canonical form is often used for problems where the
constraints are all equalities, such as production planning problems. Standard form is often used for problems where the constraints are inequalities,
such as financial portfolio management problems.By understanding canonical and standard forms of LPPs, you can better understand LPPs and how
to solve them. These forms are used in a variety of fields, such as business, engineering, and economics.

Here are some additional details about canonical and standard forms of LPPs:

Canonical form:

● A maximization problem
● All constraints are equalities
● All variables are non-negative
● Often used to solve LPPs using simplex algorithms

Standard form:

● Can be a maximization or minimization problem


● All constraints are inequalities
● All variables are non-negative
● Often used to solve LPPs using interior point methods
SYNOPSIS

Linear programming problems (LPPs) are a type of mathematical optimization problem that can be used to find the best solution to a
given set of constraints. LPPs can be formulated in a variety of ways, but the canonical and standard forms are two of the most common.

Canonical form: In canonical form, an LPP is a maximization problem where all of the constraints are equalities and all of the variables
are non-negative. This form is often used to solve LPPs using simplex algorithms .A canonical LPP can be expressed in the following
general form:

● z is the objective function


● c1, c2, ..., cn are the coefficients of the objective function
● x1, x2, ..., xn are the decision variables
● a, b, ..., c are the coefficients of the constraints
● d is the right-hand side of the constraints
SYNOPSIS

Standard form :In standard form, an LPP can be a maximization or minimization problem where all of the constraints are inequalities and
all of the variables are non-negative. This form is often used to solve LPPs using interior point methods.A standard LPP can be expressed
in the following general form:

where:The meaning of the symbols is the same as in canonical form

Canonical and standard forms are two important forms of LPPs. They are used to solve LPPs using different algorithms and have
different applications. Canonical form is often used for problems where the constraints are all equalities, such as production planning
problems. Standard form is often used for problems where the constraints are inequalities, such as financial portfolio management
problems.

By understanding canonical and standard forms of LPPs, you can better understand LPPs and how to solve them. These forms are used in
a variety of fields, such as business, engineering, and economics.
APPLICATION

Canonical and standard forms of linear programming problems (LPPs) are used to solve a variety of optimization problems in
business, engineering, and other fields.

In canonical form, the objective function is to maximize profit and all constraints are equalities. This form is often used for
problems with equalities, such as production planning.

In standard form, the objective function can be to maximize or minimize profit and all constraints are inequalities. This form is
often used for problems with inequalities, such as financial portfolio management.

One example of an application of canonical form is in production planning. A company may want to determine the optimal
production levels for a set of products given a limited amount of resources. The company can formulate this problem as a
canonical LPP, with the objective function being to maximize profit and the constraints being the limited availability of
resources.

Another example of an application of standard form is in financial portfolio management. An investor may want to determine
the optimal allocation of their investment portfolio given a set of risk and return constraints. The investor can formulate this
problem as a standard LPP, with the objective function being to maximize return and the constraints being the risk and return
requirements.

Canonical and standard forms of LPPs are powerful tools that can be used to solve a variety of optimization problems. By
understanding these forms, you can better understand LPPs and how to use them to solve real-world problems.
CONCLUSION

Canonical and standard forms of linear programming problems (LPPs) are two common ways to formulate LPPs. Canonical form is a
maximization problem with all constraints as equalities and all variables non-negative. Standard form can be a maximization or
minimization problem with all constraints as inequalities and all variables non-negative. Canonical form is often used for problems with
equalities, such as production planning, while standard form is often used for problems with inequalities, such as financial portfolio
management.

Canonical and standard forms of LPPs are powerful tools that can be used to solve a variety of optimization problems. By understanding
these forms, you can better understand LPPs and how to use them to solve real-world problems.

Here are some additional thoughts on canonical and standard forms of LPPs:

● Canonical form is often easier to solve than standard form, but it can only be used for problems with equalities.
● Standard form can be used for problems with both equalities and inequalities, but it can be more difficult to solve.
● There are a variety of algorithms that can be used to solve LPPs, and the best algorithm to use depends on the form of the LPP.
● Canonical and standard forms of LPPs are just two of the many ways to formulate LPPs. There are other forms that can be used,
depending on the specific problem being solved.
References

1. Hillier, F. S., & Lieberman, G. J. (2010). Introduction to linear programming (9th ed.). New York, NY: McGraw-Hill.
2. Luenberger, D. G. (1984). Linear programming and economic analysis (2nd ed.). New York, NY: Addison-Wesley.
3. Nocedal, J., & Wright, S. J. (2006). Numerical optimization (2nd ed.). New York, NY: Springer.
4. Taha, H. A. (2007). Operations research: An introduction (9th ed.). Upper Saddle River, NJ: Pearson Prentice Hall.
5. Vanderbei, R. J. (2010). Linear programming: Foundations and extensions (3rd ed.). New York, NY: Springer.
6. GOOGLE.COM
7. WIKIPEDIA.COM
8. TUTORIALSPOINT.COM

You might also like