Answer Key > Answer key to Homework 10, Math 484, Linear Programming


University of California, San Diego ANS 6 These are just answer keys. The students should provide more details in their home work. Chapter 4.5, Problem 1 (a) The dual: Minimize 3y1 + 3y2 subject to 2y1 + y2 ≥ 1, y1 + 2y2 ≥ 2, y1, y2 ≥ 0. (b) First, we verify that X∗ is feasible, with slack u = (0, 0). Then we verify that Y ∗ is both feasible, with slack w = (0, 0). ...[Show More]

Preview 1 out of 4 pages
Purchase this document to unlock the blurred part and the rest of the document

Unlock Now

Reviews( 0 )

Unlock this Document

Purchase the document to unlock it.

$5.00

Unlock Now

3
2

Category:
Number of pages: 4
Language: English
Last updated: 5 months ago
Downloads: 2
Views: 3

Can't Find what you want?

PLACE CUSTOM WRITING ORDER

Related documents

Get more on Answer Key »