cornerpoint CP

oscpnf Cprft corner prints not in feasible region

e corner point feasible solutions m feasible region

I ne no of variables

m no of constraints

isoprilit live only a function

corner point will lie at the intersection of n lives

point will be called a corner point only if A would not lie

A corner

on a line segment joining any other two points in the same region

An isoprotit function will exit line segment when it is to

a parallel

any one constraint

Implication of this find Our search is confined to finite ports rather than

the
mfmite ponies in feasible region

Proof by contradiction

a L b T

use equality to proof by contradict

as b

If LP has
unique optimal so it will be a cpf True

let 2 such it is
unique optimal but not Cpf
Let 2 22 be the two other solutions

21 2 2222 2 not optimal X

i 22 C 2 L 21 A X
 2 I 29 22 not unique X

operators here show or represent relative optimality

e g a21 2 29 L 22 means 2 is less opined than 29 which is

lets optimal than 22

a lb

9 a s b not true

A corner point is a point which would be solved dgebrically

Henie now we move from graphical method to algebraic methods

we now locate corner points and save them for optimality

constraints when put to

Every pair of two equations will give a corner point

The only drawback of algebraic method is extra effort graphical method works
brilliantly in case of large no of constraints by reducing the
a
effort

n 50
m 50

m t w 100

r 50