Scribd
Upload
1 views1 page

Chapter 1 Notes

Uploaded by

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

Chapter 1 Notes

Uploaded by

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

Chapter 1 - Basic Concepts of Linear Programming

Introduction
Linear Programming (LP) is a mathematical optimization technique used to maximize or
minimize a linear objective function subject to linear constraints and non-negativity
conditions.

Key Concepts
Decision variables, objective function, constraints, feasible region, optimal solution, non-
negativity.

Mathematical Form
Max/Min Z = c1x1 + c2x2 ... subject to linear constraints.

Example
Max Z=3x+2y
Subject to: x+y<=4, x<=2, y<=3, x,y>=0.
Optimal solution can be obtained graphically or by simplex.

Practice Questions
1. Explain Basic Concepts of Linear Programming concept with suitable example.

2. Explain Basic Concepts of Linear Programming concept with suitable example.

3. Explain Basic Concepts of Linear Programming concept with suitable example.

4. Explain Basic Concepts of Linear Programming concept with suitable example.

5. Explain Basic Concepts of Linear Programming concept with suitable example.

You might also like