Criteria of LP & Standard Form

Duration: 12 min

This video lesson is available to enrolled students.

Enroll to watch — Coal India Management Trainee (CS) Recruitment 2026

AI Summary

An AI-generated summary of this video lecture.

This video is a lecture on Linear Programming, focusing on the criteria for a General Linear Programming Problem (G.L.P.P.) and the process of converting a general problem into its standard form. The instructor begins by outlining the three main criteria for a G.L.P.P.: the objective function must be linear, the constraints must be linear, and all decision variables must be non-negative. He then introduces the concept of standard form, which requires the objective function to be of maximization type and all constraints to be of equal type. To illustrate this, he presents a general linear programming problem with a maximization objective (Max Z = 2x + 3y) and two inequality constraints (x + 2y ≤ 6 and 2x + y ≤ 8). The core of the lecture demonstrates how to convert this problem into standard form by introducing slack variables (S1 and S2) to transform the inequalities into equalities. Finally, the instructor addresses a special case where a decision variable has no sign restriction, showing how to represent it as the difference of two non-negative variables (y = y' - y''). The video is structured as a step-by-step guide for students to understand the foundational concepts and transformations in linear programming.

Chapters

  1. 0:00 – 2:00 00:00-02:00

    The video opens with the instructor introducing the topic of Linear Programming. He writes on a whiteboard, stating the title of the unit and chapter. He then begins to list the criteria for a General Linear Programming Problem (G.L.P.P.). The first criterion written is 'The objective fn are linear.' He then writes the second criterion, 'The constraints should be linear.' The on-screen text confirms the topic is 'Unit-1: Discrete Structures and Optimization' and 'Chapter-7: Optimization'.

  2. 2:00 – 5:00 02:00-05:00

    The instructor continues to write the criteria for a G.L.P.P. on the whiteboard. He writes the third criterion: 'All the decision variables are non-negative.' He then introduces the concept of 'Standard form' and begins to list its requirements. The first requirement for standard form is written as '1) The objective function is of Maximization type.' He then writes the second requirement: '2) The constraints are of equal type.' The on-screen text remains consistent, showing the course title.

  3. 5:00 – 10:00 05:00-10:00

    The instructor transitions to a worked example. He writes 'General Linear Programming Problem' at the top of the board. He then presents a specific problem: 'Prob: Max Z = 2x + 3y' with the constraints 'x + 2y ≤ 6' and '2x + y ≤ 8', and 'x, y ≥ 0'. He explains that to convert this into standard form, the inequalities must be changed to equalities. He introduces slack variables S1 and S2, writing the transformed constraints as 'x + 2y + S1 = 6' and '2x + y + S2 = 8'. He labels S1 and S2 as 'Slack Variables' and notes that all variables (x, y, S1, S2) are non-negative.

  4. 10:00 – 11:56 10:00-11:56

    The instructor addresses a special case where a decision variable has no sign restriction. He writes 'y' on the board and explains that if 'y' can be positive or negative, it can be represented as the difference of two non-negative variables: 'y = y' - y'''. He then substitutes this into the objective function, changing 'Max Z = 2x + 3y' to 'Max Z = 2x + 3(y' - y'')'. He also updates the constraints accordingly. He concludes by stating that all variables (x, y', y'', S1, S2) must be non-negative, which is written as 'x, y', y'', S1, S2 ≥ 0'. The on-screen text remains visible throughout.

The video provides a comprehensive, step-by-step tutorial on the fundamentals of Linear Programming. It begins by establishing the core criteria for a General Linear Programming Problem (G.L.P.P.), emphasizing the linearity of the objective function and constraints, and the non-negativity of decision variables. The lecture then progresses to the concept of standard form, which is a necessary format for solving these problems using methods like the Simplex algorithm. The instructor demonstrates this transformation using a concrete example, showing how to convert inequality constraints into equalities by adding slack variables. The final part of the video addresses a more advanced topic: handling variables with no sign restrictions by decomposing them into the difference of two non-negative variables. This synthesis of concepts provides a solid foundation for students to understand and solve linear programming problems.