Tutorial 4 - NATIONAL UNIVERSITY OF SINGAPORE Department of...

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

View Full Document Right Arrow Icon
NATIONAL UNIVERSITY OF SINGAPORE Department of Mathematics MA3252 Linear and Network Optimization Tutorial 4 1. Consider the standard form polyhedron P = { x R n | Ax = b , x 0 } . Suppose the matrix A has dimensions m × n and its rows are linearly independent. For each of the following statements, state whether it is true or false. If true, provide an argument, else, provide a counter example. (a) If n = m + 1, then P has at most two basic feasible solutions. (b) The set of all optimal solutions is bounded. (c) At every optimal solution, no more than m variables can be positive. (d) If there is more than one optimal solution, then there are uncountably many optimal solutions. (e) If there are several optimal solutions, then there exist at least two basic feasible solutions that are optimal. 2. Consider the following linear programming problem, where b and A i are 3 × 1 column matrices for i = 1 , 2 , 3 , 4. min
Background image of page 1

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

View Full DocumentRight Arrow Icon
Image of page 2
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 12/02/2011 for the course MATH 3252 taught by Professor Tanbanpin during the Spring '10 term at National University of Singapore.

Page1 / 2

Tutorial 4 - NATIONAL UNIVERSITY OF SINGAPORE Department of...

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

View Full Document Right Arrow Icon
Ask a homework question - tutors are online