onsider the following linear program in standard inequality form:

maximise

c

T

x

subject to

A

x

$<=$

b

$,$

x

$>=$

$0$

Suppose that this program is unbounded. Show that the dual of this program

must be infeasible. You may use any theorems and definitions from the lectures. $[$