Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Scribd
Upload
22 views

Linear Programming - The Graphical Method

This document discusses linear programming problems and their graphical solutions. It defines linear programming problems, describes finding maximum and minimum values, and provides examples of sketching feasible regions and finding optimal objective function values given constraint inequalities.

Uploaded by

Troy
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
22 views

Linear Programming - The Graphical Method

This document discusses linear programming problems and their graphical solutions. It defines linear programming problems, describes finding maximum and minimum values, and provides examples of sketching feasible regions and finding optimal objective function values given constraint inequalities.

Uploaded by

Troy
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 12

Linear Programming The Graphical Method

Most problems that rely on solutions through linear


programming
ward problems
are
by nature
optimalvalue of a function
These problems involvefinding the
subject to various constraints or restrictions on the
variables

Def A linearprogramming problem in two variables is


defined
by a linear expression 2 ax
by
called the objective function subject to conditions
expressed as linear inequalities called constraints

Thegoal of solving a linear


programming problem is to find
the maximum or minimum value of Z that satisfies
the constraints

Def A maximum in linearprogramming problem is the


a

greatest 2 that can be obtained for 2 ax


subject to the constraints on the by
system
Similarly a minimum is the smallest Z value

Themaximum on minimum occurs for particular values


of x in the solution
y space
Graphical Solutions of Linear Programming Problems
Small linear programming problems lend themselves nicely
to solutions by graphing the constraint linear
inequalities and matching the objective function
The linear inequalities can either enclose bound
an area on a
graph or leave the area on the
graph
unbounded

The bounded area defined by constraints is the set ofpoints in


the region of feasible solutions
Cornerpoints are the vertices of the boundaries
thevertices are the intersection points of the boundary lines
of the inequalities alongthe edgeof the region
basically
the corners of the shaded region

It is possible to showthat optimal solutions


always occur
at vertices of the region of feasible solutions so
the
optimal solution is the corner that
point yields the optimal
value for the objective function
ex Sketch the feasible region for the following set of constraints
E ZX t 3
y 132
E X t
Y
X ZO Z O
y
Then find the maximum and minimum values of the objective
function Z Gx
2g
ex Sketch the feasible region for the following set of constraints

X Z Z
y
Xt e 4
y
2 3 E IO
y
X Zo 20
y
Then find the maximum and minimum values of the objective
function Z X t
Sy
ex Find the maximum and minimumvalues of the objectivefunction
Z 2x Sy subject to the following constraints

3x E
t
2g G
2x t 4 E 8
y
X t
g I l
X Zo Z
y O
ex Sketch the feasible region for the following set of constraints

3y 2x 2 O
t 8x Z 52
y
2x E Z
y
X Z3

Then findthe maximum and minimumvalues of the objective function


Z Sx t
2g
ex Solvethe following linear programming problem

Minimize 2 Xt
2g
subject to Xt
y E lo
3 2 ZG
y
X Zo O
y

You might also like