Math Problem Statement
Con el método simplex dual resuelva el siguiente problema. Minimizar z= 4x1 + x2 Sujeto a: 3x1 + x2 = 3 4x1 + 3x2 ≥ 6 x1 + 2x2 ≤ 4 x1, x2 ≥ 0
Solution
Ask a new question for Free
By Image
Drop file here or Click Here to upload
Math Problem Analysis
Mathematical Concepts
Linear Programming
Simplex Method
Dual Method
Formulas
-
Theorems
-
Suitable Grade Level
University Level