Math Problem Statement
Maximize Z = 2x1 + 3x2 Subject to x1 + 2x2 <= 4 x1 + x2 =3 x1, x2 >=0
Gunakan metode big M dengan menambahkan artificial variable
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
Big M Method
Formulas
Z = 2x1 + 3x2 (Objective Function)
x1 + 2x2 + s1 = 4 (Constraint with Slack Variable)
x1 + x2 + a1 = 3 (Constraint with Artificial Variable)
Z = 2x1 + 3x2 - M*a1 (Big M Penalized Objective Function)
Theorems
Simplex Algorithm
Big M Method for Handling Artificial Variables
Suitable Grade Level
Undergraduate Level (Operations Research, Linear Programming)
Related Recommendation
Solve Linear Programming Problem using Big-M Method with Simplex Table
Maximization Problem in Linear Programming using Big-M Method
Linear Programming Problem Using Big M Method for Minimization
Linear Programming Problem: Solve Using the Big-M Method for Maximum Optimization
Linear Programming Minimization Using the Big M Method - Solve z=12x1+20x2