Scribd
Upload
10 views1 page

Linear Programming

Linear programming is a method for optimizing a linear function subject to constraints, with all decision variables being non-negative. The objective function is a linear equation that needs to be maximized or minimized, while the feasible region is defined by the constraints. The optimal solution occurs at the corner points of the feasible region, particularly when it is bounded.

Uploaded by

aayush.pathak2702
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
10 views1 page

Linear Programming

Linear programming is a method for optimizing a linear function subject to constraints, with all decision variables being non-negative. The objective function is a linear equation that needs to be maximized or minimized, while the feasible region is defined by the constraints. The optimal solution occurs at the corner points of the feasible region, particularly when it is bounded.

Uploaded by

aayush.pathak2702
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/ 1

LINEAR PROGRAMMING

IMPORTANT Definitions & Results

1. Linear programming is a technique for finding the optimum (maximum or


minimum) solution to a linear function (objective function) of two or more
variables (linear constraints).
2. All decision variables are restricted to be non-negative quantities.
3. Objective function. Linear function Z = ax + by, where a and b are constants,
which has to be maximized or minimized is called a linear objective function.
4. Constraints. The linear inequalities or inequations or restrictions on the
variables of a linear programming problem are called constraints.
5. Optimization problem. A problem which seeks to maximize or minimize a
linear function inequalities is called an optimization problem.
6. Feasible region. It is defined as a set of points which satisfy all the constraints
including non-negative constraints x ≥ 0, y ≥ 0.
7. Linear Programming Model. It is a set of algebraic statements of linear
programming, i.e., it comprises of optimum or objective function and the linear
constraints.
8. Theorem. Let R be the feasible region for a linear programming problem and
let Z = ax + by be the objective function. when Z has an optimal value
(maximum or minimum) where the variables x and y are subject to constraints
described by linear inequalities, this optimal value must occur at corner point
(vertex) of the feasible region.
9. Theorem. Let R be the feasible region for a linear programming problem and
let Z = ax + by be the objective function. If R is bounded (region can be
enclosed within a circle) then the objective function Z has both maximum and a
minimum value on R and each of these occur at a corner point (vertex of R).

You might also like