{[ promptMessage ]}

Bookmark it

{[ promptMessage ]}

assignment10_ProblemSet

# assignment10_ProblemSet - ORIE 3300/5300 Individual work...

This preview shows pages 1–2. Sign up to view the full content.

ORIE 3300/5300 ASSIGNMENT 10 Fall 2008 Individual work. Due: 3 pm, Friday November 21. 1. We have spent much time on the idea of a “certiﬁcate of optimality,” which can be used to show that a proposed solution to a linear pro- gramming problem is optimal. In this question you will see how to produce a certiﬁcate that a linear programming problem is infeasible. Suppose the constraints of a linear programming problem in standard equality form are Ax = b, x 0 , where A is an m × n matrix. (a) Suppose there is a vector y ∈ < m satisfying A T y 0 , b T y < 0 . Show that the linear programming problem has no feasible solu- tion. (Hint: consider y T Ax = ( A T y ) T x for a feasible x .) Hence such a y can be viewed as a certiﬁcate of infeasibility. As with optimality, we want to show that whenever a linear program- ming problem is infeasible, such a certiﬁcate of infeasibility exists. (b) Suppose for simplicity that

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
This is the end of the preview. Sign up to access the rest of the document.

{[ snackBarMessage ]}

### Page1 / 2

assignment10_ProblemSet - ORIE 3300/5300 Individual work...

This preview shows document pages 1 - 2. Sign up to view the full document.

View Full Document
Ask a homework question - tutors are online