Scribd
Upload
5 views1 page

Maximise/minimise Profit/loss Cost/revenue: Bounded vs. Unbounded Regions Type Meaning Optimal Solution Exists?

The document outlines key concepts in linear programming (LP), including the objective function, decision variables, constraints, feasible solutions, and optimal solutions. It explains the characteristics of bounded and unbounded regions, infeasible problems, and various types of solutions such as redundant and degenerate solutions. Additionally, it highlights the Fundamental Theorem of LP and the standard form of linear programming problems.

Uploaded by

Punk Boss
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
5 views1 page

Maximise/minimise Profit/loss Cost/revenue: Bounded vs. Unbounded Regions Type Meaning Optimal Solution Exists?

The document outlines key concepts in linear programming (LP), including the objective function, decision variables, constraints, feasible solutions, and optimal solutions. It explains the characteristics of bounded and unbounded regions, infeasible problems, and various types of solutions such as redundant and degenerate solutions. Additionally, it highlights the Fundamental Theorem of LP and the standard form of linear programming problems.

Uploaded by

Punk Boss
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 1

Monday, 2 June 2025 5:49 PM

Objective Function
• The linear function to maximise (profit) or minimise (cost).
• General form: Z = ax + by
• Keywords in questions: maximise/minimise, profit/loss, cost/revenue

Decision Variables
• Variables that decide output.
• Represent what to find.
• Example: Let x be chairs and y be tables produced.

Constraints
• Inequalities representing limited resources or conditions.
• Types:
○ Resource constraints (e.g., labor, materials)
○ Non-negativity constraints: x ≥ 0, y ≥ 0

Feasible Solution
• Any solution that satisfies all constraints, including non-negativity.
• Lies inside or on the boundary of the feasible region.
Feasible Region
• The intersection of all constraints.
• Graphically: Region of overlapping inequalities.
• Convex polygon in most standard LPs.

Bounded vs. Unbounded Regions


Type Meaning Optimal Solution Exists?
Bounded Feasible region is enclosed Always exists
Unbounded Region is open in some direction (e.g., infinitely big) Exists only if max/min is bounded

Infeasible LPP
• No solution satisfies all constraints simultaneously.
• Graph has no common region (intersection is null).
• Often due to conflicting constraints.

Optimal Solution
• A feasible solution where the objective function has the best (max/min) value.
• Always lies at a corner (vertex) of the feasible region (Fundamental Theorem of LP).
• If multiple corners give same value → Infinitely many optimal solutions.

Alternate (Multiple) Optimal Solutions


• Occurs when objective function line is parallel to a constraint forming one edge of the
feasible region.
• All points on that edge are optimal.

12. No Optimal Solution


• Happens in unbounded LPP if the objective function increases endlessly within the
feasible region.

9. Redundant Constraint
• A constraint that doesn't impact the feasible region.
• Graphically: Its removal doesn’t change the shape of the feasible region.

10. Degenerate Solution


• When two or more constraints intersect at the same vertex of feasible region.
• May cause multiple optimal solutions or ambiguity in solution.

13. Fundamental Theorem of LP


• If the feasible region is non-empty and bounded, the objective function always attains an
optimal value at one or more vertices.

14. Standard Form of LPP


• All constraints are of the form: ≤
• All variables: x ≥ 0, y ≥ 0
• Objective: maximise Z = ax + by

You might also like