# Solve the linear programming problem by applying the simplex method to the dual problem. Minimize subject to C = 4x1

## Question:

Minimize subject to

C = 4x1 + 8x2

2x1 + x2 ≥ 12

x1 + x2 ≥ 9

x2 ≥ 4

x1,x2 ≥ 0

## This problem has been solved!

Do you need an answer to a question different from the above? Ask your question!

## Step by Step Answer:

**Related Book For**

## College Mathematics for Business Economics Life Sciences and Social Sciences

**ISBN:** 978-0321614001

12th edition

**Authors:** Raymond A. Barnett, Michael R. Ziegler, Karl E. Byleen

**View Solution**

Create a free account to access the answer

**Cannot find your solution?**

Post a FREE question now and get an answer within minutes.
* Average response time.