Use app×
Join Bloom Tuition
One on One Online Tuition
JEE MAIN 2025 Foundation Course
NEET 2025 Foundation Course
CLASS 12 FOUNDATION COURSE
CLASS 10 FOUNDATION COURSE
CLASS 9 FOUNDATION COURSE
CLASS 8 FOUNDATION COURSE
–2 votes
209 views
in Linear Programming by (82 points)
Find all the basic solutions of the following LP problem Maximize \( Z =2 x_{1}-4 x_{2}+5 x_{3}-6 x_{4} \) Such that, \[ \begin{array}{c} x_{1}+4 x_{2}-2 x_{3}+8 x_{4}=2 \\ x_{1}+2 x_{2}+x_{3}+2 x_{4}=4 \\ x_{1}, x_{2}, x_{3}, x_{4} \geq 0 \end{array} \] Classify them in the following four categories (A) Basic degenerate feasible solutions are. (B) Basic non degenerate feasible solutions are (C) Basic degenerate infeasible solutions are. (D) Basic non degenerate infeasible solutions are.

Please log in or register to answer this question.

Related questions

Welcome to Sarthaks eConnect: A unique platform where students can interact with teachers/experts/students to get solutions to their queries. Students (upto class 10+2) preparing for All Government Exams, CBSE Board Exam, ICSE Board Exam, State Board Exam, JEE (Mains+Advance) and NEET can ask questions from any subject and get quick answers by subject teachers/ experts/mentors/students.

Categories

...