UNIT-I (OR)* Solve LPP using graphical method Minimize Z=2x1+3x2 Subject to constraints X1+X2 ≥ 5; X₁+2x2 ≥ 6; X1, X2 ≥

Business, Finance, Economics, Accounting, Operations Management, Computer Science, Electrical Engineering, Mechanical Engineering, Civil Engineering, Chemical Engineering, Algebra, Precalculus, Statistics and Probabilty, Advanced Math, Physics, Chemistry, Biology, Nursing, Psychology, Certifications, Tests, Prep, and more.
Post Reply
answerhappygod
Site Admin
Posts: 899603
Joined: Mon Aug 02, 2021 8:13 am

UNIT-I (OR)* Solve LPP using graphical method Minimize Z=2x1+3x2 Subject to constraints X1+X2 ≥ 5; X₁+2x2 ≥ 6; X1, X2 ≥

Post by answerhappygod »

Unit I Or Solve Lpp Using Graphical Method Minimize Z 2x1 3x2 Subject To Constraints X1 X2 5 X 2x2 6 X1 X2 1
Unit I Or Solve Lpp Using Graphical Method Minimize Z 2x1 3x2 Subject To Constraints X1 X2 5 X 2x2 6 X1 X2 1 (88.12 KiB) Viewed 20 times
UNIT-I (OR)* Solve LPP using graphical method Minimize Z=2x1+3x2 Subject to constraints X1+X2 ≥ 5; X₁+2x2 ≥ 6; X1, X2 ≥ 0 Solve the LPP Maximize Z=X₁+2X2+X3 Subject to constraints 2X1+X2-X3 ≤ 2; -2x1+x2-5x3 ≥ −6; 4x1+x2+X3 ≤ 6; and X₁, X2, X3 ≥ 0
Join a community of subject matter experts. Register for FREE to view solutions, replies, and use search function. Request answer by replying!
Post Reply