Practice question
Question
Consider the following Linear Programming Problem (LPP). Maximise Z = x₁ + 2x₂ Subject to: x₁ ≤ 2 x₂ ≤ 2 x₁ + x₂ ≤ 2 x₁, x₂ ≥ 0 (i.e. +ve decision variables) What is the optimal solution to the above LPP?
Explanation
Look at it this way: complete solution: write formula, plug data, do arithmetic. Final value matches 0, 2. Simple and accurate.
Related blogs
Guides and insights connected to this topic
Rhizospheric microorganisms and effects, PGPR and Mycorrhiza
What is Rhizosphere? The rhizosphere is the narrow region of soil around the plant root that is influenced by several factors like the root...
Microbial degradation of cellulose (Enzymes, Steps, Mechanisms)
What is cellulose? Cellulose is an organic polysaccharide composed of a linear chain of hundreds of β-linked D-glucose units. Cellulos...
Microbial degradation of pectin (Enzymes, Steps, Mechanisms)
What is pectin? Pectin is a complex heteropolysaccharide composed of linear chains of α-D-galacturonic acid or other similar sugar derivativ...
Discussion
Comments
Please log in to join the discussion.
Login to commentNo comments yet. Be the first to start the discussion.