Consider a linear programming problem with the objective function $Z = 3x + 2y$ subject to constraints $x + y \leq 4$, $x \geq 0$, and $y \geq 0$. If the feasible region is bounded, where does the maximum value of $Z$ occur?

At the intersection of $x + y = 4$ and $y = 0$

At the intersection of $x + y = 4$ and $x = 0$

At the intersection of $x + y = 4$ and $y = 0$

At the intersection of $x = 0$ and $y = 0$

Consider a linear programming problem where the objective function is $Z = ax + by$. If the feasible region is bounded, where does the optimal value of the objective function occur?

At the center of the feasible region

At any point within the feasible region

At the midpoint of the longest side of the feasible region

In an unbounded feasible region, how can one determine if the maximum value of the objective function exists?

Check if the open half-plane $ax + by > M$ has no point in common with the feasible region.

Check if the open half-plane $ax + by

Verify if the feasible region is bounded.

Ensure that the objective function is linear.

In a linear programming problem, if no point satisfies all constraints simultaneously, what can be concluded about the feasible region and solution?

There is no feasible region and hence no feasible solution.

There is a feasible region but no optimal solution.

There is no feasible region and hence no feasible solution.

There is a feasible region with multiple optimal solutions.

There is a feasible region with a unique optimal solution.

Which of the following statements about the feasible region in a linear programming problem is correct?

It can be non-convex if the constraints are nonlinear.

StudyTunnel

by BhamuIntelli Systems LLP

StudyTunnel

Loading content...

Linear Programming

Action Plan Notes Questions Mock-Test

Study Action Plan (Sorted by Difficulty)

Bounded and Unbounded Regions

Accuracy: 0%

Total Attempted0

Total Correct0

Total Incorrect0

Difficulty Level:

High

Corner Point Method

Accuracy: 0%

Total Attempted0

Total Correct0

Total Incorrect0

Difficulty Level:

High

Corner Points and Boundary Lines

Accuracy: 0%

Learning Objectives

Top

Learning Objectives

Understand the concept of linear programming and its applications.
Formulate a linear programming problem mathematically.
Identify and define the objective function and constraints in a linear programming problem.
Solve linear programming problems using the graphical method.
Determine the feasible region for a linear programming problem.
Identify corner points of the feasible region and evaluate the objective function at these points.
Apply the Corner Point Method to find optimal solutions in linear programming problems.
Recognize the significance of bounded and unbounded feasible regions in linear programming.

Practice, Analyze & Improve 🚀

Dont just read—test your knowledge! Unlock the Student Workspace to take chapter tests and get instant performance insights.

Deep Analytics

Peer Comparison

Track Progress

Claim Free Account100% Free • No credit card required

Revision Notes & Summary

Top

Chapter 12: Linear Programming

12.1 Introduction

Linear programming involves optimizing a linear objective function subject to constraints.
Example: A furniture dealer wants to maximize profit from tables and chairs.
- Investment: Rs 50,000
- Storage: Maximum of 60 pieces
- Costs: Table = Rs 2500, Chair = Rs 500
- Profits: Table = Rs 250, Chair = Rs 75

12.2 Linear Programming Problem and its Mathematical Formulation

12.2.1 Mathematical Formulation

Let:
- x = number of tables
- y = number of chairs
Constraints:
1. Investment: 2500x + 500y ≤ 50000 (or 5x + y ≤ 100)
2. Storage: x + y ≤ 60
3. Non-negativity: x ≥ 0, y ≥ 0
Objective function: Z = 250x + 75y (maximize)

12.2.2 Graphical Method of Solving Linear Programming Problems

Graph the constraints:
1. 5x + y ≤ 100
2. x + y ≤ 60
3. x ≥ 0
4. y ≥ 0
Feasible Region: The area that satisfies all constraints.
Feasible Solutions: Points within or on the boundary of the feasible region.
Infeasible Solutions: Points outside the feasible region.

Important Theorems

Theorem 1: Optimal values occur at corner points of the feasible region.
Theorem 2: If the feasible region is bounded, both maximum and minimum values exist at corner points.

Example of Corner Points and Values

Corner Point	Corresponding value of Z
(0, 0)	0
(30, 0)	120 (Maximum)
(20, 30)	110
(0, 50)	50

Conclusion

Linear programming is crucial for optimizing resources in various fields such as industry and management.

Do you belong in the Top 10%?

Our analytics show that most students struggle with specific concepts in Linear Programming. Take a free diagnostic test to generate your personal Learning DNA profile.

Practice Test – MCQs, True/False

Top

Multiple Choice Questions

5x + y \leq 100

x + y \leq 60

2500x + 500y \leq 50000

x \geq 0, y \geq 0

Correct Answer: B

Solution:

The constraint

x + y \leq 60

represents the storage limitation, as the dealer can store at most 60 pieces.

Chapter Concept:

Mathematical Formulation Steps in LPP

Z = 50x + 40y

Z = 3x + 2y

Z = 2x + y

Z = 240x + 160y

Correct Answer: A

Solution:

The objective function is to maximize profit, given by

Z = 50x + 40y

, where

x

and

y

are the units of products A and B, respectively.

Experience the StudyTunnel Method

We do not just give you mock tests. We guide you through a gamified, AI-driven learning path designed to guarantee mastery.

Step 1: Chapter Practice

Linear Programming

Step 2: Term Boss Exam

Locked • Full Phase Assessment

Step 3: Redemption Arena

Locked • AI Weakness Tracker

True or False

Correct Answer: True

Solution:

According to Theorem 1, when the objective function has an optimal value, it must occur at a corner point of the feasible region.

Chapter Concept :

Theorems on Optimal Solutions

Correct Answer: True

Solution:

A linear programming problem involves maximizing or minimizing a linear objective function subject to constraints in the form of linear inequalities, and the decision variables must be non-negative.

Chapter Concept :

Linear Programming Problem Formulation

Correct Answer: False

Solution:

AI Learning Assistant

StudyTunnel Methodology

1

Master the Concepts

2

Conquer Boss Exams

3

The Redemption Arena

Linear Programming

Study Action Plan (Sorted by Difficulty)

Bounded and Unbounded Regions

High

Corner Point Method

High

Corner Points and Boundary Lines

Learning Objectives

Learning Objectives

Practice, Analyze & Improve 🚀

Revision Notes & Summary

Chapter 12: Linear Programming

12.1 Introduction

12.2 Linear Programming Problem and its Mathematical Formulation

12.2.1 Mathematical Formulation

12.2.2 Graphical Method of Solving Linear Programming Problems

Important Theorems

Example of Corner Points and Values

Conclusion

Do you belong in the Top 10%?

Practice Test – MCQs, True/False

Multiple Choice Questions

Q1.In the context of linear programming, which constraint represents the storage limitation for the furniture dealer?

Correct Answer: B

Correct Answer: A

Experience the StudyTunnel Method

Step 1: Chapter Practice

Step 2: Term Boss Exam

Step 3: Redemption Arena

True or False

Q1.The optimal value of the objective function in a linear programming problem always occurs at a corner point of the feasible region.

Correct Answer: True

Q2.In a linear programming problem, the objective function is a linear function of decision variables subject to non-negative constraints and linear inequalities.

Correct Answer: True

Q3.The Corner Point Method guarantees that the optimal value of the objective function occurs at a corner point of the feasible region, even if the region is unbounded.

Correct Answer: False

High

Decision Variables in LPP

High

Evaluating Objective Function at Vertices

High

Feasible and Infeasible Regions

High

Feasible Solution and Infeasible Solution

High

Graphical Method for Linear Programming

High

Graphing Linear Inequalities for LPP

High

Linear Constraints from Word Problems

High

Linear Objective Function

High

Linear Programming Problem Formulation

High

Mathematical Formulation Steps in LPP

High

Maximise vs Minimise LPP

High

Multiple Optimal Solutions

High

No Feasible Region and No Solution

High

Non-Negative Restrictions

High

Objective Function and Constraints

High

Optimal Feasible Solution

High

Optimisation Problem and Linear Programming

High

Resource Allocation Problems