Linear Programming
It is a mathematical technique for determining optimal allocation of resources.
- Objective Function: Clearly identifiable and measurable in quantity e.g. maximization of profit.
- Constraints: These are limited resources with in which we have to make the objective function maximum
z = c1x1 + c2x2 + …
a11 x1 + a12 x2 + … ≥ b1
Cj = profit coefficient
bi = resource value
aij = technological coefficient
xj = variable
- Special Cases: Linear programming problems can be solved by– Graphical method
- Infinite Solution: Objective function slope equals to one of the constrain which forms the boundary.
- No Solution: It is not possible to find feasible solution which satisfy all the constrain.
- Unbounded Solution: The greatest value of objective function occurs at infinite and it simply means the common feasible region is not bounded by limit on constrain.
<< Previous | Next >>
Must Read: What is Industrial Engineering?
Dear Aspirants,
Your preparation for GATE, ESE, PSUs, and AE/JE is now smarter than ever — thanks to the MADE EASY YouTube channel.
This is not just a channel, but a complete strategy for success, where you get toppers strategies, PYQ–GTQ discussions, current affairs updates, and important job-related information, all delivered by the country’s best teachers and industry experts.
If you also want to stay one step ahead in the race to success, subscribe to MADE EASY on YouTube and stay connected with us on social media.
MADE EASY — where preparation happens with confidence.
MADE EASY is a well-organized institute, complete in all aspects, and provides quality guidance for both written and personality tests. MADE EASY has produced top-ranked students in ESE, GATE, and various public sector exams. The publishing team regularly writes exam-related blogs based on conversations with the faculty, helping students prepare effectively for their exams.
