• Practice Mathematical Algorithm
  • Mathematical Algorithms
  • Pythagorean Triplet
  • Fibonacci Number
  • Euclidean Algorithm
  • LCM of Array
  • GCD of Array
  • Binomial Coefficient
  • Catalan Numbers
  • Sieve of Eratosthenes
  • Euler Totient Function
  • Modular Exponentiation
  • Modular Multiplicative Inverse
  • Stein's Algorithm
  • Juggler Sequence
  • Chinese Remainder Theorem
  • Quiz on Fibonacci Numbers

Related Articles

  • Solve Coding Problems
  • CBSE Class 12 Maths Notes

Chapter 1: Relations and Functions

  • Types of Functions
  • Composite functions - Relations and functions
  • Invertible Functions
  • Composition of Functions
  • Inverse Functions
  • Verifying Inverse Functions by Composition

Chapter 2: Inverse Trigonometric Functions

  • Inverse Trigonometric Functions
  • Graphs of Inverse Trigonometric Functions - Trigonometry | Class 12 Maths
  • Properties of Inverse Trigonometric Functions
  • Inverse Trigonometric Identities

Chapter 3: Matrices

  • Types of Matrices
  • Matrix Operations
  • Matrix Addition
  • Matrix Multiplication
  • Transpose of a Matrix
  • Symmetric and Skew Symmetric Matrices
  • Elementary Operations on Matrices
  • Inverse of a Matrix by Elementary Operations - Matrices | Class 12 Maths
  • Invertible Matrix

Chapter 4: Determinants

  • Determinant of a Matrix
  • Properties of Determinants
  • Area of a Triangle using Determinants
  • Minors and Cofactors
  • Adjoint of a Matrix
  • Applications of Matrices and Determinants

Chapter 5: Continuity and Differentiability

  • Continuity and Discontinuity in Calculus - Class 12 CBSE
  • Differentiability of a Function | Class 12 Maths
  • Derivatives of Inverse Functions
  • Derivatives of Implicit Functions - Continuity and Differentiability | Class 12 Maths
  • Derivatives of Composite Functions
  • Derivatives of Inverse Trigonometric Functions | Class 12 Maths
  • Derivative of Exponential Functions
  • Logarithmic Differentiation - Continuity and Differentiability
  • Proofs for the derivatives of eˣ and ln(x) - Advanced differentiation
  • Rolle's Theorem and Lagrange's Mean Value Theorem
  • Derivative of Functions in Parametric Forms
  • Second Order Derivatives in Continuity and Differentiability | Class 12 Maths
  • Mean Value Theorem
  • Algebra of Continuous Functions - Continuity and Differentiability | Class 12 Maths

Chapter 6: Applications of Derivatives

  • Critical Points
  • Derivatives as Rate of Change
  • Increasing and Decreasing Functions
  • Increasing and Decreasing Intervals
  • Tangents and Normals
  • Equation of Tangents and Normals
  • Relative Minima and Maxima
  • Absolute Minima and Maxima
  • Concave Function
  • Inflection Point
  • Curve Sketching
  • Approximations & Maxima and Minima - Application of Derivatives | Class 12 Maths
  • Higher Order Derivatives

Chapter 7: Integrals

  • Integration by Substitution
  • Integration by Partial Fractions
  • Integration by Parts
  • Integration of Trigonometric Functions
  • Functions Defined by Integrals
  • Definite Integral
  • Computing Definite Integrals
  • Fundamental Theorem of Calculus
  • Finding Derivative with Fundamental Theorem of Calculus
  • Evaluating Definite Integrals
  • Properties of Definite Integrals
  • Definite Integrals of Piecewise Functions
  • Improper Integrals
  • Riemann Sum
  • Riemann Sums in Summation Notation
  • Trapezoidal Rule
  • Definite Integral as the Limit of a Riemann Sum
  • Antiderivatives
  • Indefinite Integrals
  • Particular Solutions to Differential Equations
  • Integration by U-substitution
  • Reverse Chain Rule
  • Partial Fraction Expansion
  • Trigonometric Substitution

Chapter 8: Applications of Integrals

  • Area under Simple Curves
  • Area Between Two Curves - Calculus
  • Area between Polar Curves
  • Area as Definite Integral

Chapter 9: Differential Equations

  • Differential Equations
  • Homogeneous Differential Equations
  • Separable Differential Equations
  • Exact Equations and Integrating Factors
  • Implicit Differentiation
  • Implicit differentiation - Advanced Examples
  • Advanced Differentiation
  • Disguised Derivatives - Advanced differentiation | Class 12 Maths
  • Derivative of Inverse Trig Functions
  • Logarithmic Differentiation

Chapter 10: Vector Algebra

  • Vector Algebra
  • Dot and Cross Products on Vectors
  • How to Find the Angle Between Two Vectors?
  • Section Formula - Vector Algebra

Chapter 11: Three-dimensional Geometry

  • Direction Cosines and Direction Ratios
  • Equation of a Line in 3D
  • Angles Between two Lines in 3D Space
  • Shortest Distance Between Two Lines in 3D Space | Class 12 Maths
  • Points, Lines and Planes

Chapter 12: Linear Programming

Linear programming, graphical solution of linear programming problems, chapter 13: probability.

  • Conditional Probability and Independence - Probability | Class 12 Maths
  • Multiplication Theorem
  • Dependent and Independent Events
  • Bayes' Theorem
  • Probability Distribution
  • Binomial Distribution in Probability
  • Binomial Mean and Standard Deviation - Probability | Class 12 Maths
  • Bernoulli Trials and Binomial Distribution
  • Discrete Random Variable
  • Expected Value
  • NCERT Solutions for Class 12 Maths -Chapter Wise with PDF
  • RD Sharma Class 12 Solutions for Maths

Linear programming is the simplest way of optimizing a problem. Through this method, we can formulate a real-world problem into a mathematical model. There are various methods for solving Linear Programming Problems and one of the easiest and most important methods for solving LPP is the graphical method. In Graphical Solution of Linear Programming, we use graphs to solve LPP.

We can solve a wide variety of problems using Linear programming in different sectors, but it is generally used for problems in which we have to maximize profit, minimize cost, or minimize the use of resources. In this article, we will learn about Solutions of Graphical solutions of linear programming problems, their types, examples, and others in detail.

Table of Content

Graphical Solution of a Linear Programming Problems

Corner point methods, iso-cost methods.

  • Solved Examples

Linear programming is a mathematical technique employed to determine the most favorable solution for a problem characterized by linear relationships. It is a valuable tool in fields such as operations research, economics, and engineering, where efficient resource allocation and optimization are critical.

Now let’s learn about types of linear programming problems

Types of Linear Programming Problems

There are mainly three types of problems based on Linear programming they are,

Manufacturing Problem: In this type of problem, some constraints like manpower, output units/hour, and machine hours are given in the form of a linear equation. And we have to find an optimal solution to make a maximum profit or minimum cost.

Diet Problem: These problems are generally easy to understand and have fewer variables. Our main objective in this kind of problem is to minimize the cost of diet and to keep a minimum amount of every constituent in the diet. 

Transportation Problem: In these problems, we have to find the cheapest way of transportation by choosing the shortest route/optimized path.

Some commonly used terms in linear programming problems are,

Objective function: The direct function of form Z = ax + by, where a and b are constant, which is reduced or enlarged is called the objective function. For example, if Z = 10x + 7y. The variables x and y are called the decision variable.

Constraints: The restrictions that are applied to a linear inequality are called constraints.

  • Non-Negative Constraints: x > 0, y > 0 etc.
  • General Constraints: x + y > 40, 2x + 9y ≥ 40 etc.

Optimization problem: A problem that seeks to maximization or minimization of variables of linear inequality problem is called optimization problems.

Feasible Region: A common region determined by all given issues including the non-negative (x ≥ 0, y ≥ 0) constrain is called the feasible region (or solution area) of the problem. The region other than the feasible region is known as the infeasible region.

Feasible Solutions: These points within or on the boundary region represent feasible solutions of the problem. Any point outside the scenario is called an infeasible solution.

Optimal(Most Feasible) Solution: Any point in the emerging region that provides the right amount (maximum or minimum) of the objective function is called the optimal solution.

  • If we have to find maximum output, we have to consider the innermost intersecting points of all equations.
  • If we have to find minimum output, we consider the outermost intersecting points of all equations.
  • If there is no point in common in the linear inequality, then there is no feasible solution.

We can solve linear programming problems using two different methods are,

To solve the problem using the corner point method you need to follow the following steps:

Step 1: Create mathematical formulation from the given problem. If not given.

Step 2: Now plot the graph using the given constraints and find the feasible region.

Step 3: Find the coordinates of the feasible region(vertices) that we get from step 2.

Step 4: Now evaluate the objective function at each corner point of the feasible region. Assume N and n denotes the largest and smallest values of these points.

Step 5: If the feasible region is bounded then N and n are the maximum and minimum value of the objective function. Or if the feasible region is unbounded then:

  • N is the maximum value of the objective function if the open half plan is got by the ax + by > N has no common point to the feasible region. Otherwise, the objective function has no solution.
  • n is the minimum value of the objective function if the open half plan is got by the ax + by < n has no common point to the feasible region. Otherwise, the objective function has no solution.

Examples on LPP using Corner Point Methods

Example 1: Solve the given linear programming problems graphically: 

Maximize: Z = 8x + y

Constraints are,

  • 2x + y ≤ 60
  • x ≥ 0, y ≥ 0

Step 1: Constraints are,

Step 2: Draw the graph using these constraints. 

Graph for Z = 8x + y

Here both the constraints are less than or equal to, so they satisfy the below region (towards origin). You can find the vertex of feasible region by graph, or you can calculate using the given constraints:

 x + y = 40 …(i)

2x + y = 60 …(ii)

Now multiply eq(i) by 2 and then subtract both eq(i) and (ii), we get

Now put the value of y in any of the equations, we get

x = 20 

So the third point of the feasible region is (20, 20)

Step 3: To find the maximum value of Z = 8x + y. Compare each intersection point of the graph to find the maximum value

So the maximum value of Z = 240 at point x = 30, y = 0.

Example 2: One kind of cake requires 200 g of flour and 25g of fat, and another kind of cake requires 100 g of flour and 50 g of fat Find the maximum number of cakes that can be made from 5 kg of flour and 1 kg of fat assuming that there is no shortage of the other ingredients, used in making the cakes.

Solution: 

Step 1: Create a table like this for easy understanding (not necessary).

Step 2: Create linear equation using inequality

  • 200x + 100y ≤ 5000 or 2x + y ≤ 50
  • 25x + 50y ≤ 1000 or x + 2y ≤ 40
  • Also, x > 0 and y > 0

Step 3: Create a graph using the inequality (remember only to take positive x and y-axis)

Corner Point Method Example 2

Step 4: To find the maximum number of cakes (Z) = x + y. Compare each intersection point of the graph to find the maximum number of cakes that can be baked.

Clearly, Z is maximum at co-ordinate (20, 10). So the maximum number of cakes that can be baked is Z = 20 + 10 = 30.

The term iso-cost or iso-profit method provides the combination of points that produces the same cost/profit as any other combination on the same line. This is done by plotting lines parallel to the slope of the equation.

To solve the problem using Iso-cost method you need to follow the following steps:

Step 3: Now find the coordinates of the feasible region that we get from step 2.

Step 4: Find the convenient value of Z(objective function) and draw the line of this objective function.

Step 5: If the objective function is maximum type then draw a line which is parallel to the objective function line and this line is farthest from the origin and only has one common point to the feasible region. Or if the objective function is minimum type then draw a line which is parallel to the objective function line and this line is nearest from the origin and has at least one common point to the feasible region.

Step 6: Now get the coordinates of the common point that we find in step 5. Now, this point is used to find the optimal solution and the value of the objective function.

Linear Programming Graphical Solution of Linear Inequalities

Solved Examples of Graphical Solution of LPP

Maximize: Z = 50x + 15y

  • 5x + y ≤ 100

Step 1: Finding points 

We can also write as 

5x + y = 100….(i)

x + y = 50….(ii)

Now we find the points 

so we take eq(i), now in this equation

When x = 0, y = 100

When y = 0, x = 20

So, points are (0, 100) and (20, 0)

Similarly, in eq(ii)

When x = 0, y = 50

When y = 0, x = 50

So, points are (0, 50) and (50, 0)

Step 2: Now plot these points in the graph and find the feasible region.

Solved Example 1: Z = 50x + 15y

Step 3: Now we find the convenient value of Z(objective function) 

So, to find the convenient value of Z, we have to take the lcm of coefficient of 50x + 15y, i.e., 150. So, the value of Z is the multiple of 150, i.e., 300. Hence, 

50x + 15y = 300

Put x = 0, y = 20

Put y = 0, x = 6

draw the line of this objective function on the graph:

Solved Example 1 Z = 50x + 15y Step 3

Step 4: As we know that the objective function is maximum type then we draw a line which is parallel to the objective function line and farthest from the origin and only has one common point to the feasible region.

Solved Example 1: Z = 50x + 15y Step 4

Step 5: We have a common point that is (12.5, 37.5) with the feasible region. So, now we find the optimal solution of the objective function:

Z = 50x + 15y

Z = 50(12.5) + 15(37.5)

Z = 625 + 562.5

Thus, maximum value of Z with given constraint is, 1187

Example 2: Solve the given linear programming problems graphically: 

Minimize: Z = 20x + 10y

  • x + 2y ≤ 40
  • 3x + y ≥ 30
  • 4x + 3y ≥ 60

l 1 = x + 2y = 40 ….(i)

l 2 = 3x + y = 30 ….(ii)

l 3 = 4x + 3y = 60 ….(iii)

So we take eq(i), now in this equation

When x = 0, y = 20

When y = 0, x = 40

So, points are (0, 20) and (40, 0)

When x = 0, y = 30

When y = 0, x = 10

So, points are (0, 30) and (10, 0)

Similarly, in eq(iii)

When y = 0, x = 15

So, points are (0, 20) and (15, 0)

Solved Example 2: Z = 20x + 10y Step 2

So let us assume z = 0

20x + 10y = 0

Solved Example 2: Z = 20x + 10y Step 3

Step 4: As we know that the objective function is minimum type then we draw a line which is parallel to the objective function line and nearest from the origin and has at least one common point to the feasible region.

Solved Exanple 2: Z = 20x + 10y Step 4

This parallel line touch the feasible region at point A. So now we find the coordinates of point A:

As you can see from the graph at point A l2 and l3 line intersect so we find the coordinate of point A by solving these equations:

l 2 = 3x + y = 30 ….(iv)

l 3 = 4x + 3y = 60 ….(v)

Now multiply eq(iv) with 4 and eq(v) with 3, we get

12x + 4y = 120 

12x + 9y = 180 

Now subtract both the equation we get coordinates (6, 12)

Step 5: We have a common point that is (6, 12) with the feasible region. So, now we find the optimal solution of the objective function:

Z = 20x + 10y

Z = 20(6) + 10(12)

Z = 120 + 120

Thus, the minimum value of Z with the given constraint are 240

FAQs on Graphical Solution of LPP

1. what is linear programming problems(lpp).

Linear Programming Problems are the mathematical problems that are used to solve or optimize the mathematical problems. We can solve Linear Programming Problems to maximize and minimize the special linear condition.

2. What are Types of Linear Programming Problems(LPP) Solution?

There are various types of Solution to Linear Programming Problems that are, Linear Programming Problems Solution by Simplex Method Linear Programming Problems Solution by R Method Linear Programming Problems Solution by Graphical Method

3. What are Types of Graphical Solution of Linear Programming Problems(LPP)?

There are various types of graphical solution of linear programming problems that are, Corner Points Methods Iso-Cost Methods

Please Login to comment...

  • Linear Equations
  • Mathematical
  • School Learning
  • School Mathematics
  • satyam_sharma

Improve your Coding Skills with Practice

 alt=

What kind of Experience do you want to share?

  • Graphical Method of Solving Linear Programming Problems

Graphical Method: Owing to the importance of linear programming models in various industries , many types of algorithms have been developed over the years to solve them. Some famous mentions include the Simplex method, the Hungarian approach, and others. Here we are going to concentrate on one of the most basic methods to handle a linear programming problem i.e. the graphical method.

In principle, this method works for almost all different types of problems but gets more and more difficult to solve when the number of decision variables and the constraints increases. Therefore, we’ll illustrate it in a simple case i.e. for two variables only. So let’s get started with the graphical method!

Suggested Videos

The graphical method.

We will first discuss the steps of the algorithm :

Step 1: Formulate the LP (Linear programming) problem

We have already understood the mathematical formulation of an LP problem in a previous section. Note that this is the most crucial step as all the subsequent steps depend on our analysis here.

Browse more Topics under Linear Programming

  • Different Types of Linear Programming Problems
  • Linear Programming Problem and Its Mathematical Formulation

Step 2: Construct a graph and plot the constraint lines

The graph must be constructed in ‘n’ dimensions , where ‘n’ is the number of decision variables. This should give you an idea about the complexity of this step if the number of decision variables increases.

One must know that one cannot imagine more than 3-dimensions anyway! The constraint lines can be constructed by joining the horizontal and vertical intercepts found from each constraint equation.

Step 3: Determine the valid side of each constraint line

This is used to determine the domain of the available space, which can result in a feasible solution. How to check? A simple method is to put the coordinates of the origin (0,0) in the problem and determine whether the objective function takes on a physical solution or not. If yes, then the side of the constraint lines on which the origin lies is the valid side. Otherwise it lies on the opposite one.

Step 4: Identify the feasible solution region

The feasible solution region on the graph is the one which is satisfied by all the constraints. It could be viewed as the intersection of the valid regions of each constraint line as well. Choosing any point in this area would result in a valid solution for our objective function.

Step 5: Plot the objective function on the graph

It will clearly be a straight line since we are dealing with linear equations here. One must be sure to draw it differently from the constraint lines to avoid confusion. Choose the constant value in the equation of the objective function randomly, just to make it clearly distinguishable.

Step 6: Find the optimum point

Optimum points.

An optimum point always lies on one of the corners of the feasible region. How to find it? Place a ruler on the graph sheet, parallel to the objective function. Be sure to keep the orientation of this ruler fixed in space. We only need the direction of the straight line of the objective function. Now begin from the far corner of the graph and tend to slide it towards the origin.

  • If the goal is to minimize the objective function, find the point of contact of the ruler with the feasible region, which is the closest to the origin. This is the optimum point for minimizing the function.
  • If the goal is to maximize the objective function, find the point of contact of the ruler with the feasible region, which is the farthest from the origin. This is the optimum point for maximizing the function.

Download Linear Programming Problem Cheat Sheet PDF by clicking on the download button below

linear programming cheat sheet

Step 7: Calculate the coordinates of the optimum point.

This is the last step of the process. Once you locate the optimum point, you’ll need to find its coordinates. This can be done by drawing two perpendicular lines from the point onto the coordinate axes and noting down the coordinates.

Otherwise, you may proceed algebraically also if the optimum point is at the intersection of two constraint lines and find it by solving a set of simultaneous linear equations. The Optimum Point gives you the values of the decision variables necessary to optimize the objective function.

To find out the optimized objective function, one can simply put in the values of these parameters in the equation of the objective function. You have found your solution! Worried about the execution of this seemingly long algorithm? Check out a solved example below!

Solved Examples for You

Question 1: A health-conscious family wants to have a very well controlled vitamin C-rich mixed fruit-breakfast which is a good source of dietary fibre as well; in the form of 5 fruit servings per day. They choose apples and bananas as their target fruits, which can be purchased from an online vendor in bulk at a reasonable price.

Bananas cost 30 rupees per dozen (6 servings) and apples cost 80 rupees per kg (8 servings). Given: 1 banana contains 8.8 mg of Vitamin C and 100-125 g of apples i.e. 1 serving contains 5.2 mg of Vitamin C.

Every person of the family would like to have at least 20 mg of Vitamin C daily but would like to keep the intake under 60 mg. How much fruit servings would the family have to consume on a daily basis per person to minimize their cost?

Answer : We begin step-wise with the formulation of the problem first. The constraint variables – ‘x’ = number of banana servings taken and ‘y’ = number of servings of apples taken. Let us find out the objective function now.

  • Cost of a banana serving = 30/6 rupees = 5 rupees. Thus, the cost of ‘x’ banana servings = 5x rupees
  • Cost of an apple serving = 80/8 rupees = 10 rupees. Thus the cost of ‘y’ apple servings = 10y rupees

Total Cost C = 5x + 10y

Constraints: x ≥ 0; y ≥ 0 (non-negative number of servings)

Total Vitamin C intake: 8.8x + 5.2y  ≥ 20            (1) 8.8x + 5.2y  ≤ 60            (2)

Now let us plot a graph with the constraint equations-

graphical method of solving lp problems

To check for the validity of the equations, put x=0, y=0 in (1). Clearly, it doesn’t satisfy the inequality. Therefore, we must choose the side opposite to the origin as our valid region. Similarly, the side towards origin is the valid region for equation 2)

Feasible Region: As per the analysis above, the feasible region for this problem would be the one in between the red and blue lines in the graph! For the direction of the objective function; let us plot 5x+10y = 50.

graphical method of solving lp problems

Now take a ruler and place it on the straight line of the objective function. Start sliding it from the left end of the graph. What do we want here? We want the minimum value of the cost i.e. the minimum value of the optimum function C. Thus we should slide the ruler in such a way that a point is reached, which:

1) lies in the feasible region 2) is closer to the origin as compared to the other points

This would be our Optimum Point. I’ve marked it as P in the graph. It is the one which you will get at the extreme right side of the feasible region here. I’ve also shown the position in which your ruler needs to be to get this point by the line in green.

graphical method of solving lp problems

Now we must calculate the coordinates of this point. To do this, just solve the simultaneous pair of linear equations:

y = 0 8.8x + 5.2y = 20

We’ll get the coordinates of ‘P’ as (2.27, 0). This implies that the family must consume 2.27 bananas and 0 apples to minimize their cost and function according to their diet plan.

Question 2: What is the purpose of a graphical method?

Answer: We use a graphical method of linear programming for solving the problems by finding out the maximum or lowermost point of the intersection on a graph between the objective function line and the feasible region.

Question 3: How do you solve the LPP with the help of a graphical method?

Answer: We can solve the LPP with the graphical method by following these steps:

1st Step: First of all, formulate the LP problem.

2nd Step: Then, make a graph and plot the constraint lines over there.

3rd Step: Determine the valid part of each constraint line.

4th Step: Recognize the possible solution area.

5thStep: Place the objective function in the graph.

6th Step: Finally, find out the optimum point.

Question 4: Define the graphical method for the simultaneous equations?

Answer: For graphically solving a pair of simultaneous equations, firstly we have to draw a graph of both the equations simultaneously. We have 2 straight lines crossing each other at a common point which provides the solution of this pair of equations.

Question 5: What is a graphical interpretation?

Answer: A graphical interpretation proposes a number of valuable problem-solving methods. For example, finding the greatest value of a nonstop differentiable function ‘f(x)’ defined in some interval ‘an ≤ x ≤ b’.

Customize your course in 30 seconds

Which class are you in.

tutor

Linear Programming

  • Types of Linear Programming Problems

Leave a Reply Cancel reply

Your email address will not be published. Required fields are marked *

Download the App

Google Play

Talk to our experts

1800-120-456-456

  • Graphical Method Linear Programming

ffImage

Graphical Method of Solving Linear Programming Problems

It is not hidden that the simplex method is a well-studied and widely used method for solving Linear Programming problems. But as far as non-Linear Programming is concerned, such a universal method does not exist. With graphical methods, any optimization programming problems consisting of only two variables can easily be solved. These variables can be referred as x₁ and x₂ and with the help of these variables, most of the analysis can be done on a two-dimensional graph. Although we cannot generalize a large number of variables using a graphical approach, the basic concepts of Linear Programming in a two-variable context can be easily demonstrated. We can always turn to two-variable problems if the problems seem to be complicated and we find ourselves in a pool of questions. And we can always search for answers in a two-variable case using graphs, that is solving Linear Programming problems graphically. 

The graphical approach wraps itself with another advantage and that is its visual nature. It provides us with a picture to get along with the algebra of Linear Programming. This picture can quench our thirst for understanding the basic definitions and possibilities. These reasons are proof that the graphical approach works smoothly with Linear Programming concepts.

Now, for solving Linear Programming problems graphically, we must two things:

Inequality constraints

And the objective function.

The Graphical Method of Solving Linear Programming problems is based on a well-defined set of logical steps. With the help of these steps, we can master the graphical solution of Linear Programming problems.

Methods used for Solving Linear Programming

Following two methods used for Graphical Method of Solving Linear Programming:

Extreme point solution method 

Iso-profit (cost) performance line method to find the perfect solution to the LP problem.

Important Points

A set of variable values ​​xj (j = 1, 2,3..., N) that satisfies the issues of the LP problem is said to form the solution to that LP problem.

Potential Solution Set of variable values ​​xj (j = 1, 2,3.., N) that satisfies all the barriers and non-negative conditions of the LP problem at the same time is said to form a possible solution to that LP problem.

Unlikely solution A set of variable values ​​xj (j = 1, 2,3..., N) that do not satisfy all the barriers and non-negative conditions of the LP problem at one time is said to form an impossible solution for that. LP problem.

With an m-group of simultaneous n (n> m) variables in the LP problem, the solution obtained by placing (n - m) zero-equal variables and solving the remaining m-variables of m is called the basic solution. of that LP problem. Variables (n - m) whose value did not appear in the basic solution are called non-core variables and the remaining variables of m are called the base variables.

A possible basic solution A possible solution to the LP problem and a basic solution is called a possible basic solution. That is, all basic changes take non-negative values. 

The Basic Solution is two Types

Degenerate A basic solution that is possible is called degenerate if the value of at least one basic element is zero. 

Non-degradable The basic practical solution is called non-degenerate if the value of all the basic variables is zero and positive.

Ways to Solve the LP Problem Law

Point Method

To resolve the issue using the existing point method you need to follow these steps:

Step 1: Create statistical design from a given problem. If not provided.

Step 2: Now plan the graph using the given obstacles and find a region that you can use.

Step 3: Find the possible location links (vertices) that we found in step 2.

Step 4: Now check the objective function in each of the possible location areas. Assume that N and n represent the largest and smallest values ​​in these points.

Step 5: If the possible region is bound then N and n are the maximum and minimum values of the objective function. Or if the area is likely to have no boundaries then:

N is the highest value of the target function if the open half system is obtained with an ax + by> N without a common point in the possible area. If not, purpose work has no solution.

n a small amount of objective work if the open half system is found by the ax + by <n does not have a common point in the probable location. If not, purpose work has no solution. 

Iso-Cost Method

The term iso-cost or iso-profit method provides a combination of points that produce the same cost/profit as any other combination in the same line. This is done by arranging the lines corresponding to the slope of the equation.

Follow the following steps for the Iso-cost method solution:

Step 1: Create a statistical design from a given problem. If not provided.

Step 3: Now find the possible location links we found in step 2.

Step 4: Find the correct Z (objective function) and draw a line for this objective activity.

Step 5: If the objective function is high type, draw a line corresponding to the objective performance line and this line is farther from the root and has only one common point in the possible area. Or if the target function is a small type then draw a line that corresponds to the target performance line and this line is very close to the source and has one common point in the possible position.

Step 6: Now find the links to the common point we find in step 5. Now, this point is used to find the right solution and the amount of objective work.

Information for the Wooden Tables and Chairs Linear Programming Problem

Table 1 gives us the information for the Linear Programming problem. We can go step-by-step for solving the Linear Programming problems graphically.

Step 1) The aforementioned table can help us to formulate the problem. The bottom row will serve the objective function. The objective function of the company is to maximize unit profit. The woods and the laborers are the constraint set. The nonnegativity conditions are also stated.

Maximize Z = 6x 2 +8x 2 (is the objective function)

Subject to: 30x 1 +20x 2 ≤ 300      (300 bf available) 

5x 1 +10x 2 ≤ 110        (110 hours available)

x 1 +x 2 ≥ 0                (non - negative conditions)

The two variables (wood and labor) in this problem, can be solved graphically. 

Step 2) This is the graph plotting step. With the x-axis as the number of tables and y-axis as the number of chairs, we can find the two constraint lines. This can be found if we find the x and y-intercepts for the two constraint equations. But before that, we have to rewrite the constraint inequalities as equalities. 

30x 1 +20x 2 = 300 

Setting x₂ = 0 to solve x₁         

30x₁ = 300   

x₁ =300/30 = 10 tables      (Wood used to make tables) 

Next: 

Setting x₁ = 0 to solve x₂  

20x₂ = 300  

x₂ =300/20  = 15 chairs (Wood used to make chairs)

50x 1 +10x 2 = 110

Setting x₂ = 0 to solve x₁

x₁ = 110/5= 22 tables(labors used to make tables)

Setting x₁ = 0 to solve x₂ 

x₂ = 110/10= 11 chairs (labors used to make chairs)

Now, plot the wood constraint line (x 1 = 10 and x 2 =15) and labor constraint line (x 1 =22

and x 2 =11)

(Image will be uploaded soon)

Step 3) To check the valid side for both constraint lines use the origin (0,0).

30(0) + 20(0) < 300 is the valid side of the wood constraint line. In the same way  5(0) + 10(0) < 110 also is a valid side of the labor constraint line. Now, draw the arrows indicating the valid side of each constraint line. 

Step 4) Identify the feasible region which is the area on the valid side of both constraint lines. 

Step 5) Find x 1 and x 2 using Z = 48 and 72.

In the first case, the values will be x 1 = 8 and x2= 12

In the second case, the values will be x 1 = 6 and x 2 = 9

Plot the objective function lines when Z = 48 and Z = 72.

The two objective function lines move away from the origin (0,0), Z increases.

Step 6) Find the most attractive corner. 

Step 7) Calculate the coordinates and find the values of x and y. 

Therefore, according to the company’s optimal solution four tables and nine chairs can be manufactured.

Step 8) finally, determine the value of the objective function for the optimal solution by plugging in the number of tables and chairs and solve for Z: 

Z = $ 6(4) + $ 8(9) = $ 96 

Thus, by producing four tables and nine chairs we can achieve the maximum profit of $ 96.

arrow-right

FAQs on Graphical Method Linear Programming

1. How does the graphical approach solve successive planning problems?

Graphical approach solution stepwise

Step 1: Create a LP (Linear Programming) problem. ...

Step 2: Create a graph and edit the blocking lines. ...

Step 3: Find the right side of each boundary line. ...

Step 4: Locate the potential solution. ...

Step 5: Arrange the objective activity on the graph. ...

Step 6: Identify the best point.

2. What is the problem with the editing line for example?

The oldest example of a consecutive planning problem is related to a company that has to allocate its time and money to create two separate products. Products require different amounts of time and money, which are limited resources, and are sold at different prices.

3. If you are using a graphic solution to a line editing problem the right solution would be in a place known as?

Consecutive planning problems are solved using graphic representations of all given barrier functions. A potential region is found in the crosshairs of all issues and the right solution is within the Feasible range.

4. What is the graphical approach to performance research?

Graphical method represents an efficient algorithm for problem solving a line system that contains two resolutions (x 1 and x 2 ). It is one of the most popular ways to solve simple system line problems.

5. What is the graphical approach to measurement techniques?

The Linear Programming (LPP) problem-solving method helps to see the process more clearly. It is also helpful to understand the different terms associated with the LPP solution. Linear editing problems with two variants can be represented and solved with drawings easily.

6. What is the Use of the Graphical Method?

A graphical method of Linear Programming is used for solving the problems by finding out the maximum or minimum point of the intersection between the objective function line and the feasible region on a graph.

7. What are Graphical Methods?

Graph is a powerful tool for data evaluation as they provide us with quick and visual summaries of essential data characteristics. Examples of graphs can be a box plot or a histogram. Graphical methods are basically used for qualitative statistical evaluations.

8. What is Linear Programming Used for?

Linear Programming is used for analyzing the supplies in the manufacturing industries. It is used for shelf space optimization. Linear Programming is also used for optimizing daily routes. It is used in machine learning.

Library homepage

  • school Campus Bookshelves
  • menu_book Bookshelves
  • perm_media Learning Objects
  • login Login
  • how_to_reg Request Instructor Account
  • hub Instructor Commons
  • Download Page (PDF)
  • Download Full Book (PDF)
  • Periodic Table
  • Physics Constants
  • Scientific Calculator
  • Reference & Cite
  • Tools expand_more
  • Readability

selected template will load here

This action is not available.

Mathematics LibreTexts

3.3: Graphical Solutions

  • Last updated
  • Save as PDF
  • Page ID 67113

Wouldn’t it be nice if we could simply produce and sell infinitely many units of a product and thus make a never-ending amount of money? In business (and in day-to-day living) we know that some things are just unreasonable or impossible. Instead, our hope is to maximize or minimize some quantity, given a set of constraints.

In order to have a linear programming problem, we must have:

  • Constraints, represented as inequalities
  • An objective function , that is, a function whose value we either want to be as large as possible (want to maximize it) or as small as possible (want to minimize it).

Consider this extension of the example from the end of the last section.

Example \(\PageIndex{1}\)

A company produces a basic and premium version of its product.  The basic version requires 20 minutes of assembly and 15 minutes of painting.  The premium version requires 30 minutes of assembly and 30 minutes of painting.  If the company has staffing for 3,900 minutes of assembly and 3,300 minutes of painting each week.  They sell the basic products for a profit of $30 and the premium products for a profit of $40.  How many of each version should be produced to maximize profit?

Let \(b-\) the number of basic products made, and \(p=\) the number of premium products made.  Our objective function is what we’re trying to maximize or minimize.  In this case, we’re trying to maximize profit.  The total profit, \(P\), is

\[P = 30b + 40p\nonumber \]

In the last section, the example developed our constraints.  Together, these define our linear programming problem:

Objective function: \[P = 30b + 40p\nonumber \]

Constraints:

\[\begin{array}{*{20}{c}}  20b + 30p \leq 3900 \\ 15b + 30p \leq 3300 \end{array}\nonumber \]

\[b \geq 0, \quad p \geq 0\nonumber \]

In this section, we will approach this type of problem graphically.  We start by graphing the constraints to determine the feasible region – the set of possible solutions.  Just showing the solution set where the four inequalities overlap, we see a clear region.

clipboard_e9b56343c8cc66317a9fb7ce2a1029fbd.png

To consider how the objective function connects, suppose we considered all the possible production combinations that gave a profit of \(P = \$3000\), so that \(3000 = 30b + 40p\). That set of combinations would form a line in the graph.  Doing the same for a profit of $5000 and $6500 would give additional lines.  Graphing those on top of our feasible region, we see a pattern:

clipboard_e660fbc1d9a2f4f1b917f19ea9af10ee3.png

Notice that all the constant-profit lines are parallel, and that in general the profit increases as we move up to upper right.  Notice also that for a profit of $5000 there are some production levels inside the feasible region for that profit level, but some are outside.  That means we could feasibly make $5000 profit by producing, for example, 167 basic items and no premium items, but we can’t make $5000 by producing 125 premium items and no basic items because that falls outside our constraints. 

The solution to our linear programming problem will be the largest possible profit that is still feasible.  Graphically, that means the line furthest to the upper-right that still touches the feasible region on at least point.  That solution is the one below:

clipboard_e42e7ac4245351a61572216332126adfc.png

This profit line touches the feasible region where \(b = 195\) and \(p = 0\), giving a profit of

\[P = 30(195) + 40(0) = \$ 5850. \nonumber \]

Notice that this is slightly larger than the profit that would be made by completely utilizing all staffing at \(b = 120, p = 50\), where the profit would be $5600.

The objective function along with the four corner points above forms a bounded linear programming problem. That is, imagine you are looking at three fence posts connected by fencing (black point and lines, respectively). If you were to put your dog in the middle, you could be sure it would not escape (assuming the fence is tall enough). If this is the case, then you have a bounded linear programming problem. If the dog could walk infinitely in any one direction, then the problem is unbounded.

In the past example, you can see that the line of maximum profit will always touch the boundary of the feasible region.  That observation inspires the fundamental theorem of linear programming.

Fundamental Theorem of Linear Programming

  • If a solution exists to a bounded linear programming problem, then it occurs at one of the corner points.
  • If a feasible region is unbounded, then a maximum value for the objective function does not exist.
  • If a feasible region is unbounded, and the objective function has only positive coefficients, then a minimum value exists.

In the last example we solve the problem somewhat intuitively by “sliding” the profit line up.  Typically we use a more procedural approach.

Solving a Linear Programming Problem Graphically

  • Define the variables to be optimized. The question asked is a good indicator as to what these will be.
  • Write the objective function, first in words, then convert to a mathematical equation
  • Write the constraints, first in words, then convert to mathematical inequalities
  • Graph the constraints inequalities, and shade the feasible region
  • Identify the corner points by solving systems of linear equations whose intersection represents a corner point.
  • Test all corner points in the objective function. The “winning” point is the point that optimizes the objective function (biggest if maximizing, smallest if minimizing)

Exercise \(\PageIndex{1}\)

Maximize \(P = 14x + 9y\nonumber \) subject to the constraints:

 \[\begin{align*}  x + y &\leq 9  \\  3x + y &\leq 15  \\  x \geq 0, & \; y \geq 0  \\ \end{align*} \nonumber \]

Graphing the feasible region, we see there are three corner points of potential interest:  (0, 9), (5, 0), and the intersection of the two lines at (3, 6).  We then evaluate the objective function at each corner point.

clipboard_e54dc0725524b19e0d7f1f5dbbf1a9959.png

\(P\) is maximized when \(x = 3, y = 6\).

Example \(\PageIndex{2}\)

A health-food business would like to create a high-potassium blend of dried fruit in the form of a box of 10 fruit bars. It decides to use dried apricots, which have 407 mg of potassium per serving, and dried dates, which have 271 mg of potassium per serving. The company can purchase its fruit through in bulk for a reasonable price. Dried apricots cost $9.99/lb. (about 3 servings) and dried dates cost $7.99/lb. (about 4 servings). The company would like the box of bars to have at least the recommended daily potassium intake of about 4700 mg, and contain at least 1 serving of each fruit. In order to minimize cost, how many servings of each dried fruit should go into the box of bars?

We begin by defining the variables. Let

\(x =\) number of servings of dried apricots

\(y =\) number of servings of dried dates

We next work on the objective function.

For apricots, there are 3 servings in one pound. This means that the cost per serving is $9.99/3 = $3.33. The cost for \(x\) servings would thus be 3.33\(x\).

For dates, there are 4 servings per pound. This means that the cost per serving is \(\$ 7.99 / 4=\$ 2.00 .\) The cost for \(y\) servings would thus be \(2.00 y.\)

The total cost, \(C\), for apricots and dates would be

\[C=3.33 x+2.00 y \nonumber\]

Normally we would have constraints \(x \geq 0\) and \(y \geq 0\) since negative servings can't be used. But in this case, we re further restricted. In words:

  • There must be at least 1 serving of each fruit
  • The product must contain at least \(4700 \mathrm{mg}\) of potassium

Mathematically,

  • Since there must be at least 1 serving of each fruit, \(x \geq 1\) and \(v \geq 1\)
  • There are \(407 x\) mg of potassium in \(x\) servings of apricots and \(271 y\) mg of potassium in \(y\) servings of dates. The sum should be greater than or equal to \(4700 \mathrm{mg}\) of potassium, or \(407 x+271 y \geq 4700\)

Thus we have.

Objective function:

\[\begin{align*}407 x+271 y \geq 4700 \\ x \geq 1, \quad y \geq 1\end{align*}\]

We graph the constraints and shade the feasible region:

clipboard_e6d7da3457f025f1034e2e57a3a8134a3.png

The region is unbounded, but we will be able to find a minimum still.  We can see there are two corner points.

The one in the upper left is the intersection of the lines \(407x + 271y = 4700\) and \(x=1\).  Solving for the intersection using substitution:

\[\begin{align*} 407(1) + 271y &= 4700  \\ y &\approx 15.8  \\ \end{align*} \nonumber \]

Point:  \((1, 15.8)\)

The one in the lower right is the intersection of the lines \(407x + 271y = 4700\) and \(y = 1\). 

\[\begin{align*}  407x + 271(1) &= 4700  \\ x &\approx 10.9 \end{align*}  \]

Point:  \((10.9, 1)\)

Testing the objective function at each of these corner points:

The company can minimize cost by using 1 serving of apricots and 15.8 servings of dates.

Exercise \(\PageIndex{2}\)

A company makes two products.  Product A requires 3 hours of manufacturing and 1 hour of assembly.  Product B requires 4 hours of manufacturing and 2 hours of assembly.  There are a total of 84 hours of manufacturing and 32 hours of assembly available.  Determine the production to maximize profit if the profit on product A is $50 and the profit on product B is $60.

Let \(a\) be the number of product A produced, and \(b\) be the number of product B.

Our goal is to maximize profit:  \(P = 50a + 60b\).

clipboard_e3fac00a6013d67c03fb2e1872083390b.png

From manufacturing we get the constraint:

\[3a + 4b \leq 84\nonumber \]

From assembly we get the constraint:

\[1a + 2b \leq 32\nonumber \]

We have corner points at (0, 16), (28, 0).  The third is at the intersection of the two lines.  To find that we could multiply the second equation by -2 and add:

\[\begin{array}{rc} 3a + 4b &= 84 \\ - 2a - 4b &=  - 64 \\ \hline  a&= 20  \end{array} \nonumber \]

The third corner point is at (20, 6).

Evaluating the objective function at each of these points:

Profit will be maximized by producing 28 units of product A and 0 units of product B.

Example \(\PageIndex{3}\)

A factory manufactures chairs and tables, each requiring the use of three operations: Cutting, Assembly, and Finishing. The first operation can be used at most 40 hours; the second at most 42 hours; and the third at most 25 hours. A chair requires 1 hour of cutting, 2 hours of assembly, and 1 hour of finishing; a table needs 2 hours of cutting, 1 hour of assembly, and 1 hour of finishing.  If the profit is $20 per unit for a chair and $30 for a table, how many units of each should be manufactured to maximize profit?

\(c  =\) number of chairs made

\(t =\) number of tables made

The profit, \(P\), will be \(P = 20c + 30t\).

For cutting, \(c\) chairs will require \(1c\) hours and \(t\) tables will require \(2t\) hours.  We can use at most 40 hours, so

\[c + 2t \leq 40\nonumber \].

For assembly, \(c\) chairs will require \(2c\) hours and t tables will require \(1t\) hours.  We can use at most 42 hours, so

\[2c + t \leq 42\nonumber \].

For finishing, c chairs will require \(1c\) hours and \(t\) tables will require \(1t\) hours.  We can use at most 25 hours, so

\[c + t \leq 25\nonumber \].

Since we can’t produce negative items, \(c \geq 0,\quad t \geq 0\).

Graphing the constraints, we can see the feasible region.

clipboard_e0d82e3160f536ab85c364888806d2691.png

There are five corner points for this region.

Point 1 : 

In the lower left, where \(t = 0\) crosses \(c = 0\).    Point: (0, 0)

Point 2 : 

In the upper left, where \(c = 0\) crosses \(c + 2t = 40 \).   

Using substitution, \(0 + 2t = 40 \), so \(t = 20\).

Point: \((0, 20)\)

Point 3 : 

In the lower right, where \(t = 0\) crosses \(2c + t = 42 \).   

Using substitution, \(2c + 0 = 42 \), so \(c = 21\).

Point: \((21, 0)\)

Point 4 : 

Where \(c + 2t = 40\) crosses \(c + t = 25\).

We can solve this as a system using any techniques we know. We could solve the second equation for \(c\), giving \(c = 25 - t\), then substitute into the first equation:

\[\begin{align*} (25 - t) + 2t &= 40  \\ 25 + t &= 40  \\ t &= 15  \end{align*} \nonumber \]

Then \(c = 25 – 15 = 10\).

Point:  \((10, 15)\)

Point 5 : 

Where \(2c + t = 42\) crosses \(c + t = 25\).

We can solve this as a system using any techniques we know.  Using a different technique this time, we could multiply the bottom equation by -1 then add it to the first:

\[\begin{array}{rc}  2c + t &= 42  \\  - c - t &=  - 25  \\ \hline c = 17 \end{array} \nonumber \]

Then using \(c + t = 25 \), we have \(17 + t = 25\), so \(t = 8\).

Point:  \((17, 8)\)

The profit will be maximized by producing 10 chairs and 15 tables.

Important Topics of this Section

Objective function

Constraint equations

Feasible region

Corner points

Solving a linear programming problem using a graph

Logo for Alaska Digital Texts

Want to create or adapt books like this? Learn more about how Pressbooks supports open publishing practices.

4.2 Graphical Solutions of Linear Programming

Wouldn’t it be nice if we could simply produce and sell infinitely many units of a product and thus make a never-ending amount of money? In business (and in day-to-day living) we know that some things are just unreasonable or impossible. Instead, our hope is to maximize or minimize some quantity, given a set of constraints.

In order to have a linear programming problem, we must have:

  • Constraints, represented as inequalities
  • An  objective function , which is a function whose value we either want to be a large as possible (want to maximize it) or as small as possible (want to minimize it).

Let’s consider an extension of the example from the end of the last section:

Example of Linear Programming

A company produces a basic and premium version of its product.  The basic version requires 20 minutes of assembly and 15 minutes of painting.  The premium version requires 30 minutes of assembly and 30 minutes of painting.  If the company has staffing for 3,900 minutes of assembly and 3,300 minutes of painting each week.  They sell the basic products for a profit of $30 and the premium products for a profit of $40.  How many of each version should be produced to maximize profit?

P=30b+40p

In the last section, the example developed our constraints. Together, these define our linear programming problem:

\begin{array}{l} 20b+30p \leq 3900\\ 15b+30p \leq 3300\\ b \geq 0, p \geq 0 \end{array}

In this section, we will approach this type of problem graphically. We start by graphing the constraints to determine the feasible region – the set of possible solutions. Just showing the solution set where the four inequalities overlap, we see a clear region.

Feasible Region for Example Solution set of constraint inequalities

Notice that all the constant-profit lines are parallel, and that in general the profit increases as we move up to upper right. Notice also that for a profit of $5000 there are some production levels inside the feasible region for that profit level, but some are outside. That means we could feasibly make $5000 profit by producing, for example, 167 basic items and no premium items, but we can’t make $5000 by producing 125 premium items and no basic items because that falls outside our constraints.

The solution to our linear programming problem will be the largest possible profit that is still feasible. Graphically, that means the line furthest to the upper-right that still touches the feasible region on at least point. That solution is the one below:

Feasible Region with Highest Profit Function Line

The objective function along with the four corner points above forms a bounded linear programming problem. That is, imagine you are looking at three fence posts connected by fencing (black point and lines, respectively). If you were to put your dog in the middle, you could be sure it would not escape (assuming the fence is tall enough). If this is the case, then you have a bounded linear programming problem. If the dog could walk infinitely in any one direction, then the problem is unbounded.

In the past example, you can see that the line of maximum profit will always touch the boundary of the feasible region. That observation inspires the fundamental theorem of linear programming.

Fundamental Theorem of Linear Programming

  • If a solution exists to a bounded linear programming problem, then it occurs at one of the corner points.
  • If a feasible region is unbounded, then a maximum value for the objective function does not exist.
  • If a feasible region is unbounded, and the objective function has only positive coefficients, then a minimum value exists.

In the last example we solve the problem somewhat intuitively by “sliding” the profit line up.  Typically we use a more procedural approach.

Solving a Linear Programming Problem Graphically

  • Define the variables
  • Define the variable to be optimized. The question asked is a good indicator as to what this will be: Profit, Revenue, Cost are popular choices.
  • Write the objective function, as a mathematical equation, like P=10x+15y or C=200a+300b.
  • Write the constraints as a system of mathematical inequalities
  • Graph the constraint system of inequalities and shade the feasible region
  • Identify the corner point by solving systems of linear equation whose intersection represents a corner point.
  • Test each corner point in the objective function. The “winning” point is the point that optimizes the objective function (greatest if maximizing, least if minimizing.)

Take Note

Try it Now 1

P=14x+9y

Another Linear Programming Example

A health-food business would like to create a high-potassium blend of dried fruit in the form of a box of 10 fruit bars. It decides to use dried apricots, which have 407 mg of potassium per serving, and dried dates, which have 271 mg of potassium per serving. The company can purchase its fruit through in bulk for a reasonable price. Dried apricots cost $9.99/lb. (about 3 servings) and dried dates cost $7.99/lb. (about 4 servings). The company would like the box of bars to have at least the recommended daily potassium intake of about 4700 mg, and contain at least 1 serving of each fruit. In order to minimize cost, how many servings of each dried fruit should go into the box of bars?

x=

Step 2: We next work on the objective function.

x

  • There just be at least 1 serving of each fruit
  • The product must contain at least 4700 mg of potassium

Mathematically,

x \geq 1, y \geq 1

Thus, we have,

Subject to:

\begin{array}{l}  407x+271y \geq 4700\\  x \geq 1\\  y \geq 1 \end{array}

Step 5: We graph the constraints and shade the feasible region:

Graph for the fruit Linear programming example

Step 6: The region is unbounded, but we will be able to find a minimum still. We can see there are two corner points.

407x+271y=4700

Step 7: Testing the objective function at each of these corner points:

The company can minimize cost by using 1 serving of apricots and 15.8 servings of dates.

Try it Now 2

A company makes two products.  Product A requires 3 hours of manufacturing and 1 hour of assembly.  Product B requires 4 hours of manufacturing and 2 hours of assembly.  There are a total of 84 hours of manufacturing and 32 hours of assembly available.  Determine the production to maximize profit if the profit on product A is $50 and the profit on product B is $60.

Yet another Example of Linear Programming

20 per unit for a chair and

We begin by defining the variables. Let c  = number of chairs made t = number of tables made

The profit, P , will be P = 20 c + 30 t .

c+2t \leq 42

There are five corner points for this region.

Point 1:  In the lower left, where t = 0 crosses c = 0.    Point: (0, 0)

c+2t=40

Testing the objective function at each of these corner points:

The profit will be maximized by producing 10 chairs and 15 tables.

Graphing is not the only way to do Linear Programming and Optimization. There is another method, called The Simplex Method . It is included in the source material for this chapter. Most people use technology for these problems as well and many can be found online. While this books gives only an introduction to Linear Programming, it is used in many business applications.

Try it Now Answers

x+y \leq 9

Graphing the feasible region, we see there are three corner points of potential interest: (0, 9), (5, 0), and the intersection of the two lines at (3, 6). We then evaluate the objective function at each corner point.

Try it Now 1 Graph

2. Let a be the number of product A produced, and b be the number of product B.

P=50a+60b

Evaluating the objective function at each of these points:

Profit will be maximized by producing 28 units of product A and 0 units of product B.

Media Attributions

  • linearprogexample1
  • linearprogexample2
  • linearprogexample3
  • takenote is licensed under a Public Domain license
  • linearprogexample4
  • linearprogexample5

College Algebra for the Managerial Sciences Copyright © by Terri Manthey is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License , except where otherwise noted.

Share This Book

Book cover

Thermal System Design and Optimization pp 249–281 Cite as

Linear Programming and Dynamic Programming

  • C. Balaji 2  
  • First Online: 30 January 2021

900 Accesses

This chapter considers Linear Programming (LP) and Dynamic Programming (DP). The formulation of an LP problem is introduced, followed by a presentation of the graphical method and the introduction of slack variables to solve LP problems. The simplex method is then elaborately presented, followed by a presentation of Integer programming with an exposition of the Gomory’s fractional cut algorithm. The chapter ends with a discussion on Dynamic programming (DP) followed by a fully worked example.

  • Simplex method
  • Integer programming
  • Graphical method
  • Sensitivity analysis
  • Gomory’s fractional cut algorithm
  • Dynamic programming

This is a preview of subscription content, log in via an institution .

Buying options

  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
  • Available as EPUB and PDF
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
  • Durable hardcover edition

Tax calculation will be finalised at checkout

Purchases are for personal use only

Srinivasan, G. (2010). Operations Research- Principles and Applications . New Delhi, India: Prentice Hall India.

Google Scholar  

Stoecker, W. F. (1989). Design of Thermal Systems . Singapore: Mc Graw Hill.

Download references

Author information

Authors and affiliations.

Department of Mechanical Engineering, Indian Institute of Technology Madras, Chennai, Tamil Nadu, India

You can also search for this author in PubMed   Google Scholar

Corresponding author

Correspondence to C. Balaji .

Rights and permissions

Reprints and permissions

Copyright information

© 2021 The Author(s)

About this chapter

Cite this chapter.

Balaji, C. (2021). Linear Programming and Dynamic Programming. In: Thermal System Design and Optimization. Springer, Cham. https://doi.org/10.1007/978-3-030-59046-8_7

Download citation

DOI : https://doi.org/10.1007/978-3-030-59046-8_7

Published : 30 January 2021

Publisher Name : Springer, Cham

Print ISBN : 978-3-030-59045-1

Online ISBN : 978-3-030-59046-8

eBook Packages : Engineering Engineering (R0)

Share this chapter

Anyone you share the following link with will be able to read this content:

Sorry, a shareable link is not currently available for this article.

Provided by the Springer Nature SharedIt content-sharing initiative

  • Publish with us

Policies and ethics

  • Find a journal
  • Track your research

Linear Programming

Linear programming is a process that is used to determine the best outcome of a linear function. It is the best method to perform linear optimization by making a few simple assumptions. The linear function is known as the objective function. Real-world relationships can be extremely complicated. However, linear programming can be used to depict such relationships, thus, making it easier to analyze them.

Linear programming is used in many industries such as energy, telecommunication, transportation, and manufacturing. This article sheds light on the various aspects of linear programming such as the definition, formula, methods to solve problems using this technique, and associated linear programming examples.

What is Linear Programming?

Linear programming, also abbreviated as LP, is a simple method that is used to depict complicated real-world relationships by using a linear function . The elements in the mathematical model so obtained have a linear relationship with each other. Linear programming is used to perform linear optimization so as to achieve the best outcome.

Linear Programming Definition

Linear programming can be defined as a technique that is used for optimizing a linear function in order to reach the best outcome. This linear function or objective function consists of linear equality and inequality constraints. We obtain the best outcome by minimizing or maximizing the objective function .

Linear Programming Examples

Suppose a postman has to deliver 6 letters in a day from the post office (located at A) to different houses (U, V, W, Y, Z). The distance between the houses is indicated on the lines as given in the image. If the postman wants to find the shortest route that will enable him to deliver the letters as well as save on fuel then it becomes a linear programming problem. Thus, LP will be used to get the optimal solution which will be the shortest route in this example.

Example of Linear Programming

Linear Programming Formula

A linear programming problem will consist of decision variables , an objective function, constraints, and non-negative restrictions. The decision variables, x, and y, decide the output of the LP problem and represent the final solution. The objective function, Z, is the linear function that needs to be optimized (maximized or minimized) to get the solution. The constraints are the restrictions that are imposed on the decision variables to limit their value. The decision variables must always have a non-negative value which is given by the non-negative restrictions. The general formula of a linear programming problem is given below:

  • Objective Function: Z = ax + by
  • Constraints: cx + dy ≤ e, fx + gy ≤ h. The inequalities can also be "≥"
  • Non-negative restrictions: x ≥ 0, y ≥ 0

How to Solve Linear Programming Problems?

The most important part of solving linear programming problem is to first formulate the problem using the given data. The steps to solve linear programming problems are given below:

  • Step 1: Identify the decision variables.
  • Step 2: Formulate the objective function. Check whether the function needs to be minimized or maximized.
  • Step 3: Write down the constraints.
  • Step 4: Ensure that the decision variables are greater than or equal to 0. (Non-negative restraint)
  • Step 5: Solve the linear programming problem using either the simplex or graphical method.

Let us study about these methods in detail in the following sections.

Linear Programming Methods

There are two main methods available for solving linear programming problem. These are the simplex method and the graphical method. Given below are the steps to solve a linear programming problem using both methods.

Linear Programming by Simplex Method

The simplex method in lpp can be applied to problems with two or more decision variables. Suppose the objective function Z = 40\(x_{1}\) + 30\(x_{2}\) needs to be maximized and the constraints are given as follows:

\(x_{1}\) + \(x_{2}\) ≤ 12

2\(x_{1}\) + \(x_{2}\) ≤ 16

\(x_{1}\) ≥ 0, \(x_{2}\) ≥ 0

Step 1: Add another variable, known as the slack variable, to convert the inequalities into equations. Also, rewrite the objective function as an equation .

- 40\(x_{1}\) - 30\(x_{2}\) + Z = 0

\(x_{1}\) + \(x_{2}\) + \(y_{1}\) =12

2\(x_{1}\) + \(x_{2}\) + \(y_{2}\) =16

\(y_{1}\) and \(y_{2}\) are the slack variables.

Step 2: Construct the initial simplex matrix as follows:

\(\begin{bmatrix} x_{1} & x_{2} &y_{1} & y_{2} & Z & \\ 1&1 &1 &0 &0 &12 \\ 2& 1 & 0& 1 & 0 & 16 \\ -40&-30&0&0&1&0 \end{bmatrix}\)

Step 3: Identify the column with the highest negative entry. This is called the pivot column. As -40 is the highest negative entry, thus, column 1 will be the pivot column.

Step 4: Divide the entries in the rightmost column by the entries in the pivot column. We exclude the entries in the bottom-most row.

12 / 1 = 12

The row containing the smallest quotient is identified to get the pivot row. As 8 is the smaller quotient as compared to 12 thus, row 2 becomes the pivot row. The intersection of the pivot row and the pivot column gives the pivot element.

Thus, pivot element = 2.

Step 5: With the help of the pivot element perform pivoting, using matrix properties , to make all other entries in the pivot column 0.

Using the elementary operations divide row 2 by 2 (\(R_{2}\) / 2)

\(\begin{bmatrix} x_{1} & x_{2} &y_{1} & y_{2} & Z & \\ 1&1 &1 &0 &0 &12 \\ 1& 1/2 & 0& 1/2 & 0 & 8 \\ -40&-30&0&0&1&0 \end{bmatrix}\)

Now apply \(R_{1}\) = \(R_{1}\) - \(R_{2}\)

\(\begin{bmatrix} x_{1} & x_{2} &y_{1} & y_{2} & Z & \\ 0&1/2 &1 &-1/2 &0 &4 \\ 1& 1/2 & 0& 1/2 & 0 & 8 \\ -40&-30&0&0&1&0 \end{bmatrix}\)

Finally \(R_{3}\) = \(R_{3}\) + 40\(R_{2}\) to get the required matrix.

\(\begin{bmatrix} x_{1} & x_{2} &y_{1} & y_{2} & Z & \\ 0&1/2 &1 &-1/2 &0 &4 \\ 1& 1/2 & 0& 1/2 & 0 & 8 \\ 0&-10&0&20&1&320 \end{bmatrix}\)

Step 6: Check if the bottom-most row has negative entries. If no, then the optimal solution has been determined. If yes, then go back to step 3 and repeat the process. -10 is a negative entry in the matrix thus, the process needs to be repeated. We get the following matrix.

\(\begin{bmatrix} x_{1} & x_{2} &y_{1} & y_{2} & Z & \\ 0&1 &2 &-1 &0 &8 \\ 1& 0 & -1& 1 & 0 & 4 \\ 0&0&20&10&1&400 \end{bmatrix}\)

Writing the bottom row in the form of an equation we get Z = 400 - 20\(y_{1}\) - 10\(y_{2}\). Thus, 400 is the highest value that Z can achieve when both \(y_{1}\) and \(y_{2}\) are 0.

Also, when \(x_{1}\) = 4 and \(x_{2}\) = 8 then value of Z = 400

Thus, \(x_{1}\) = 4 and \(x_{2}\) = 8 are the optimal points and the solution to our linear programming problem.

Linear Programming by Graphical Method

If there are two decision variables in a linear programming problem then the graphical method can be used to solve such a problem easily.

Suppose we have to maximize Z = 2x + 5y.

The constraints are x + 4y ≤ 24, 3x + y ≤ 21 and x + y ≤ 9

where, x ≥ 0 and y ≥ 0.

To solve this problem using the graphical method the steps are as follows.

Step 1: Write all inequality constraints in the form of equations.

x + 4y = 24

3x + y = 21

Step 2: Plot these lines on a graph by identifying test points.

x + 4y = 24 is a line passing through (0, 6) and (24, 0). [By substituting x = 0 the point (0, 6) is obtained. Similarly, when y = 0 the point (24, 0) is determined.]

3x + y = 21 passes through (0, 21) and (7, 0).

x + y = 9 passes through (9, 0) and (0, 9).

Step 3: Identify the feasible region. The feasible region can be defined as the area that is bounded by a set of coordinates that can satisfy some particular system of inequalities.

Any point that lies on or below the line x + 4y = 24 will satisfy the constraint x + 4y ≤ 24.

Similarly, a point that lies on or below 3x + y = 21 satisfies 3x + y ≤ 21.

Also, a point lying on or below the line x + y = 9 satisfies x + y ≤ 9.

The feasible region is represented by OABCD as it satisfies all the above-mentioned three restrictions.

Step 4: Determine the coordinates of the corner points. The corner points are the vertices of the feasible region.

B = (6, 3). B is the intersection of the two lines 3x + y = 21 and x + y = 9. Thus, by substituting y = 9 - x in 3x + y = 21 we can determine the point of intersection.

C = (4, 5) formed by the intersection of x + 4y = 24 and x + y = 9

Linear Programming by Graphical Method

Step 5: Substitute each corner point in the objective function. The point that gives the greatest (maximizing) or smallest (minimizing) value of the objective function will be the optimal point.

33 is the maximum value of Z and it occurs at C. Thus, the solution is x = 4 and y = 5.

Applications of Linear Programming

Linear programming is used in several real-world applications. It is used as the basis for creating mathematical models to denote real-world relationships. Some applications of LP are listed below:

  • Manufacturing companies make widespread use of linear programming to plan and schedule production.
  • Delivery services use linear programming to decide the shortest route in order to minimize time and fuel consumption.
  • Financial institutions use linear programming to determine the portfolio of financial products that can be offered to clients.

Related Articles:

  • Introduction to Graphing
  • Linear Equations in Two Variables
  • Solutions of a Linear Equation
  • Mathematical Induction

Important Notes on Linear Programming

  • Linear programming is a technique that is used to determine the optimal solution of a linear objective function.
  • The simplex method in lpp and the graphical method can be used to solve a linear programming problem.
  • In a linear programming problem, the variables will always be greater than or equal to 0.

Linear programming Example

As the minimum value of Z is 127, thus, B (3, 28) gives the optimal solution. Answer: The minimum value of Z is 127 and the optimal solution is (3, 28)

Linear Programming Problem

  • Example 3: Using the simplex method in lpp solve the linear programming problem Minimize Z = \(x_{1}\) + 2\(x_{2}\) + 3\(x_{3}\) \(x_{1}\) + \(x_{2}\) + \(x_{3}\) ≤ 12 2\(x_{1}\) + \(x_{2}\) + 3\(x_{3}\) ≤ 18 \(x_{1}\), \(x_{2}\), \(x_{3}\) ≥ 0 Solution: Convert all inequalities to equations by introducing slack variables. -\(x_{1}\) - 2\(x_{2}\) - 3\(x_{3}\) + Z = 0 \(x_{1}\) + \(x_{2}\) + \(x_{3}\) + \(y_{1}\) = 12 2\(x_{1}\) + \(x_{2}\) + 3\(x_{3}\) + \(y_{2}\) = 18 Expressing this as a matrix we get, \(\begin{bmatrix} x_{1} & x_{2} & x_{3} & y_{1} & y_{2} & Z & \\ 1 & 1 & 1 & 1 & 0 & 0 & 12\\ 2 & 1 & 3 & 0 & 1 & 0 & 18\\ -1 & -2 & -3 & 0 & 0 & 1 & 0 \end{bmatrix}\) As -3 is the greatest negative value thus, column 3 is the pivot column. 12 / 1 = 12 18 / 3 = 6 As 6 is the smaller quotient thus, row 2 is the pivot row and 3 is the pivot element. By applying matrix operations we get, \(\begin{bmatrix} x_{1} & x_{2} & x_{3} & y_{1} & y_{2} & Z & \\ 0.33 & 0.667 & 0 & 1 & -0.33 & 0 & 6\\ 0.667 & 0.33 & 1 & 0 & 0.33 & 0 & 6\\ 1 & -1 & 0 & 0 & 1 & 1 & 18 \end{bmatrix}\) Now -1 needs to be eliminated. Thus, by repreating the steps the matrix so obtained is as follows \(\begin{bmatrix} x_{1} & x_{2} & x_{3} & y_{1} & y_{2} & Z & \\ 0.5 & 1 & 0 & 1.5 & 0.5 & 0 & 9\\ 0.5 & 0 & 1 & -0.5 & 0.5 & 0 & 3\\ 1.5 & 0 & 0 & 1.5 & 0.5 & 1 & 27 \end{bmatrix}\) We get the maximum value of Z = 27 at \(x_{1}\) = 0, \(x_{2}\) = 9 \(x_{3}\) = 3 Answer: Maximum value of Z = 27 and optimal solution (0, 9, 3)

go to slide go to slide go to slide

graphical method of solving lp problems

Book a Free Trial Class

Practice Questions on Linear Programming

go to slide go to slide

FAQs on Linear Programming

What is meant by linear programming.

Linear programming is a technique that is used to identify the optimal solution of a function wherein the elements have a linear relationship.

What is Linear Programming Formula?

The general formula for a linear programming problem is given as follows:

What is the Objective Function in Linear Programming Problems?

The objective function is the linear function that needs to be maximized or minimized and is subject to certain constraints. It is of the form Z = ax + by.

How to Formulate a Linear Programming Model?

The steps to formulate a linear programming model are given as follows:

  • Identify the decision variables.
  • Formulate the objective function.
  • Identify the constraints.
  • Solve the obtained model using the simplex or the graphical method.

How to Find Optimal Solution in Linear Programming?

We can find the optimal solution in a linear programming problem by using either the simplex method or the graphical method. The simplex method in lpp can be applied to problems with two or more variables while the graphical method can be applied to problems containing 2 variables only.

How to Find Feasible Region in Linear Programming?

To find the feasible region in a linear programming problem the steps are as follows:

  • Draw the straight lines of the linear inequalities of the constraints.
  • Use the "≤" and "≥" signs to denote the feasible region of each constraint.
  • The region common to all constraints will be the feasible region for the linear programming problem.

What are Linear Programming Uses?

Linear programming is widely used in many industries such as delivery services, transportation industries, manufacturing companies, and financial institutions. The linear program is solved through linear optimization method, and it is used to determine the best outcome in a given scenerio.

PM Calculator - Logo

Graphical Method Calculator – Linear Programming 🥇

Do you often find yourself confused by linear programming problems that you can't solve? Maybe it's time to get some help. Well… You're in luck! Solving optimization exercises with the graphical method will be easier with our graphical method calculator for linear programming problems.

Graphical Method Calculator - Linear Programming

Objective function:, constraints.

Constraint 1:

Constraint 2:

X 1 , X 2 ≥ 0

Members-Only Content

Do you already have a membership, get membership.

The above application is a simplified version of our graphing method calculator available to students who have a membership with us; however, it has all the basic functionality required to graph most linear programming exercises in your school.

This free version, like other available free linear programming calculators, only shows the final result (optimal solution and graph) of the problem. Since many students cannot adequately understand how the graphs were generated, we have developed a version with detailed step-by-step explanations of the solution of the problem.

Advanced Functions of the Graphical Method of Linear Programming Calculator

Our membership aims to help you improve your problem solving skills and perform better in your school. That is why we include a series of online resources, where linear programming is a must. In this application you will find the following:

  • Calculation of the intersections with the axes to graph each constraint.
  • Explanation of the area to shade depending on the type of inequality.
  • Determination of the feasible region.
  • Location of the objective function on the graph, if applicable.
  • Determination of special cases such as unbounded, unbounded or infeasible solutions.
  • Solve exercises with inequalities or equations.
  • You can enter a maximum of 10 restrictions and 2 variables.

You can find complete examples of how the application works in this link .

How to use the Online Graphical Method Calculator

The use of our calculator is very simple and intuitive, however, we will explain its use step by step:

  • Before starting, you must have made the approach of the model to be optimized. Remember that for the graphical method we normally work with 2 decision variables.
  • You must enter the coefficients of the objective function and the constraints. You can enter integer values, fractions and decimals. Likewise, you must also select the sign of the inequalities.
  • To enter the coefficients of the objective function and the constraints, you can use integer values as well as fractions and decimals. You must also select the sign of the inequalities.
  • Click on “Solve / Graph” .
  • If you are in the free version, you will immediately get the final graph and results. In the full version, you will be able to see the step by step from the creation of the graphs to the final result.

Next we will see some images of the operation of the calculator:

graphical method calculator

This calculator facilitates your learning of the graphical method and combines well with our simplex method application (two phases) and our Big M Method calculator .

Final Reflection

We know that the best way to learn something is to have the right tools to do it. At PM Calculators we are working to bring you the best tools gathered in one place. If you have any recommendation to improve our calculator, write us to our contact form.

Geektonight

Linear Programming: Graphic Solution

  • Post last modified: 22 July 2022
  • Reading time: 13 mins read
  • Post category: Operations Research

In the previous article, you studied that linear programming is a method of achieving the optimum outcome for a maximum or a mini- mum equation with linear constraints.

Once the mathematical model of a linear programming problem has been formulated, the next phase in applying linear programming to a decision-making problem is to find the solution of the model.

An LP problem can be solved by using multiple methods, with graphical and simplex methods being the most popular. An LP problem that involves two variables in a linear relationship can be easily solved with the help of graphical method. When there are only two variables in the problem, most of the analysis can be performed on a two-dimensional graph.

Table of Content

  • 1.1 Graphical Method
  • 2.1 Extreme Point Enumeration Approach
  • 2.2 ISO-profit (Cost) Function Line Approach
  • 3 Important Terms of Linear Programming for Graphic Solution

Graphical method helps in showing all the feasible solutions that are present within the feasible area on the graph. The feasible area’s corner points are tested by putting these values in the objective function for determining the optimal solution.

A major advantage of using the graphical approach is its visual nature. It helps us gain a visual representation of the algebra of LP, which in turn supports our understanding of the key concepts. But when an LP problem involves three or more variables, trying to solve the problem by drawing its graph is very difficult. In such cases, the simplex method developed the simplex method is used, developed by G.B. Dantzig is used.

Methods for Solving Linear Programming Problems

As you might recall from the last article, a linear programming problem is one where you need to optimise (maximise or minimise) a linear objective function, subject to constraints in the form of linear inequalities or equations. In this section of the article, you are going to discuss how you can solve such LP problems.

Graphical Method

The graphical method is used to solve a linear program involving only two decision variables that can be represented on a graph of two dimensions. While it is not impossible to graph LP models with three decision variables in three dimensions, it is a very difficult and complicated task to perform, and LP models with four or more decision variables are impossible to graph at all. Despite the limitation of being useful for only two decision variables, the graphical method is still very valuable as it enables the visualisation of the algebra of LP and how a solution is obtained in LP.

When the graphical method is used to determine the optimal solution to the LP problem, the fundamental theorem of linear programming is applied, which states that:

  • The set of all feasible solutions to an LP problem is represented by a convex polygon whose extreme points correspond to the basic feasible solutions. In case this, a convex polygon is a convex polyhedron, then at least one of the extreme points gives an optimal solution.
  • The number of basic feasible solutions within the feasible area is finite.
  • If more than one extreme point corresponds to the optimal solution, then the value of the objective function will be the same for all these extreme points.
  • The maximum value for the objective function does not exist for an unbounded feasible region.
  • A minimum value for an unbounded feasible region exists if the objective function has only positive coefficients.

For LP problems involving more than two variables or those involving a large number of constraints, graphical methods are not suited. In such cases, solution methods that are adaptable to computers are more appropriate.

The simplex method is one such approach. This method presents a systematic approach for evaluating the vertices of a feasible region, which then allows you to figure out the optimal value of the objective function. You will study more about the simplex method in the next article.

Graphical Solution of a Linear Programming Problem

The graphical solution of an LP problem involves the following steps:

  • Represent the problem in a mathematical form by formulating the mathematical model. For this, decode the given situations or constraints into equations or inequalities.
  • Draw x1 and x2 axes. The values of x1 and x2 variables can only lie in the first quadrant because of the non-negativity constraints x1 ≥ 0 and x2 ≥ 0. Infeasible alternatives that lie in the 2nd, 3rd and 4th quadrants are thus removed.
  • Plot each of the problem constraints, whether equations or inequalities, as equations on the graph. For each of the constraints, obtain the value of one variable by assigning an arbitrary value to the other variable. Then, assign a different arbitrary value to the first variable and obtain the value of the other variable. Now plot these two points and join them with a straight line. Each constraint is thus plotted as a line in the first quadrant.
  • Identify the feasible solution area that satisfies all the constraints simultaneously. The feasible region is the area common to all the constraints and is usually depicted as a shaded region. Any point that lies within or on the boundary of this shaded region depicts a feasible solution. The feasible region is a convex polygon formed by the intersection of a finite number of half-planes.
  • Plot the objective function by assuming Z = 0. This is a line passing through the origin. Increasing the value of Z moves the line parallelly to the right. For a maximisation problem, draw a line parallel to this line till it is farthest from the origin. For a minimisation problem, draw a line parallel to this line till the line is closest to the origin. The optimal point is the point where this line passes through the feasible region.

Now, you know the basic steps of the graphical method to solve an LP problem. Know that graphical methods can be classified into two types as

Extreme Point Enumeration Approach

Iso-profit (cost) function line approach.

An extreme point or vertex is a unique point where a hyperplane inter- sects. The extreme point enumeration approach of graphically solving an LP problem is based on the principle of extreme value theorem which states that if f is a continuous function over a closed, bounded interval, then there is a point in the interval at which f has an absolute maximum and there is also a point at which f has an absolute minimum value.

The various steps involved in this approach are as follows:

  • Identify the decision variables, constraints and objective of the problem.
  • Formulate the mathematical model of the problem.
  • Plot each of the problem constraints as an equation on the graph Each one will geometrically represent a straight line.
  • Identify the common region that satisfies all the constraints simultaneously. It is a convex polygon formed by the intersection of a finite number of half-planes.
  • Determine the vertices of the convex polygon. These vertices are called the extreme points of the feasible region.
  • Find the coordinates of each extreme point/vertex of the feasible region. Determine the values of the objective function at each extreme point. The optimal point is the extreme point at which the value of the objective function is optimum (maximum or mini- mum) and its coordinates give us the optimal solution.

The Iso-profit (cost) function line method is another approach to find the optimum point in a graphic linear programming problem. After graphing the feasible region, the point lying in the feasible region that produces the highest profit is the optimal solution to the problem. The term Iso-profit (cost) implies that any combination of points generates the same profit (cost) as any other combination on the same line.

  • Plot a graph taking in all the constraint equations of the problem and identify the feasible region. The feasible region is the intersection of the regions satisfying all the constraints. As you read earlier, it is restricted to the first quadrant only. The feasible region obtained in this step may be bounded or unbounded.
  • Determine the corner points of the feasible region.
  • Calculate the coordinates of all the corner points of the feasible region.
  • Give a suitable value k to the objective function Z and draw the corresponding straight line in the xy plane so that it lies within the feasible region. This is the iso-profit (iso-cost) function line.
  • Draw the iso-profit (iso-cost) function line parallel to itself till the line is farthest from the origin (for highest possible profit) or closest to the origin (for lowest possible cost). Each such line for which the value of the objective function remains the same is called an iso-profit line for maximisation problems, or an iso-cost line for minimisation problems.
  • Determine the optimum solution with the coordinates of the point where the highest possible iso-profit or lowest possible cost line passes on the feasible region.

Important Terms of Linear Programming for Graphic Solution

  • Solution of LPP : The solution of the LPP is a set of values of the variables xl, x2…., xn that satisfies the constraints.
  • Basic feasible solution: A basic feasible solution is a set of values of the variables xl, x2…., xn that satisfies all constraints along with the non-negativity restrictions.
  • Optimum basic feasible solution: A basic feasible solution becomes optimum if it also optimises the objective function.
  • Feasible region : The region in the graph that satisfies all the constraints is known as the feasible region.
  • Corner point: A corner point is a point that falls along the corner of a feasible region.
  • Bounded set: A set which consists of a boundary around the feasible set is referred as the bounded set. An LP problem (with a bounded set) always has an optimal solution. In other words, a bounded set has a maximum value as well as a minimum value.
  • Unbounded set: A set that has no boundary and continues indefinitely is known as an unbounded set. An optimal solution for an LP problem with an unbounded set may or may not be possible, but in case an optimal solution does exist, it occurs at a corner point.
  • Unbounded solution : Those solutions where the objective function’s value can be increased or decreased indefinitely are called unbounded solutions.
  • Fundamental extreme point theorem : The fundamental extreme point theorem states that if an optimum solution for an LP problem exists, it occurs at one of the extreme points or corner points of the convex polygon of the set of all feasible solutions.
  • If there is a solution to a bounded LP problem, it occurs at one of the corner points of the convex polygon of the set of all feasible solutions.

You Might Also Like

Simulation in operation research, linear programming: artificial variable technique, duality in linear programming, transportation problem: finding an optimal solution, linear programming: simplex method, project network analysis with critical path method, transportation problem: initial basic feasible solution, replacement models in operation research, what is linear programming assumptions, properties, advantages, disadvantages, what is operations research (or) definition, concept, characteristics, tools, advantages, limitations, applications and uses, operation research models and modelling, project network analysis methods, leave a reply cancel reply.

You must be logged in to post a comment.

World's Best Online Courses at One Place

We’ve spent the time in finding, so you can spend your time in learning

Digital Marketing

Personal growth.

graphical method of solving lp problems

Development

graphical method of solving lp problems

Accounting Simplified

Linear Programming Graphical Method

Introduction.

Graphical method of linear programming is used to solve problems by finding the highest or lowest point of intersection between the objective function line and the feasible region on a graph.

This process can be broken down into 7 simple steps explained below .

Step 1: Define Constraints

All constraints relevant to a linear programming problem need to be defined in the form of inequalities.

What are inequalities?

Inequalities are mathematical expressions similar to equations except for 1 difference. Unlike equations which state what is equal to something (e.g. x = y) , inequalities express what is greater or lesser than something (e.g. x > y).

Inequalities are stated using the following symbols:

>  Greater than ≥  Greater or equal to <  Lesser than ≤  Lesser or equal to

Step 2: Define the Objective Function

The objective of solving a problem is expressed in the form of a mathematical equation.

For example, if the objective is to maximize contribution from the sale of Products A and B having contribution per unit of $10 and $5 respectively, the objective function shall be:

10A   +   5B   =   Maximum Contribution

What this means is that the objective of solving the problem is to maximize the total contribution of the business by selling the optimum mix of products A and B.

The problem with the above equation is that we cannot simply plot it on a graph (as required in step 5). To work around this problem, we define a random number in place of ‘Maximum Contribution’. Since we only require the slope (gradient) of the objective function, we can plot the Objective Function on a graph using any random value in place of maximum contribution.

Using the earlier example, the objective function could be re-written as:

10A   +   5B   =   100

Note that the 100 above is just a random number. Any other value could also be used instead.

Step 3: Plot the constraints on a graph paper

Constraint inequalities, as defined in Step 1, should be plotted on a graph.

You may plot the constraints in the same manner as you would plot an equation.

Constraint : 1A + 2B ≤ 100

For the purpose of plotting the above constraint on a graph, you may convert the inequality into an equation:

1A + 2B = 100

Now you need the co-ordinates of any 2 points from the above equation.

How do we find co-ordinates of a point from an equation?

In order to find the co-ordinates, simply insert a random value for either A or B. Solving the equation after inserting the random values could then be used to find the value of the other coordinate.

For example, we can find the value of B when A = 0 by inserting zero in place of A and solving the equation as follows:

1(0) + 2B = 100     0 + 2B = 100           2B = 100             B = 50

So the coordinates of the first point are A = 0 and B = 50 which can be written as (0, 50).

Similarly, inserting zero as the value of B can give us the value of A for the second point as follows:

1A + 2(0) = 100     1A + 0 = 100           1A = 100             A = 100 

Therefore, the coordinates of the second point are A = 100 and B = 0 or (100, 0).

Once you have determined the coordinates of any 2 points from the equation, you simply mark them on the graph and draw a straight line across them as shown below.

graphical method of solving lp problems

Step 4: Highlight the feasible region on the graph

Once you have plotted the constraint inequalities on the graph, you need to shade the area of the graph which is outside the constraint limits, i.e. which is not feasible.

For example, the constraint 1A + 2B ≤ 100 will be shaded as follows:

graphical method of solving lp problems

The area on graph which lies on or below the constraint limit line is feasible and therefore left un-shaded. Once all constraint limit lines have been similarly shaded, the non-shaded portion of the graph will represent the feasible region.

It can be confusing at times knowing which side of a constraint line to shade. In such cases, it is useful to consider whether a specific combination (e.g. 0 units of A, 0 units of B) above or below the line is possible or not considering that constraint only. If the combination is feasible, you must shade the opposite side of the line and vice versa.

Step 5: Plot the objective function on the graph

Objective Function line may be drawn on the graph in the same way as the constraint lines except that you may choose to differentiate it from constraint lines, e.g. by drawing a dotted line instead of the usual line.

Objective function line of 10A + 5B = 100 will be drawn as follows:

graphical method of solving lp problems

10(0) + 5B = 100

B = 100 ÷ 5

10(A) + 5(0) = 100

A = 100 ÷ 10

Step 6: Find the optimum point

Optimum point of a linear programming problem always lies on one of the corner points of the graph’s feasible region.

To find the optimum point, you need to slide a ruler across the graph along the gradient of objective function. Where the objective is to maximize (e.g. contribution), you must slide the ruler up to the point within the feasible region which is furthest away from the origin. Conversely, where the objective is to minimize (e.g. cost) you must slide the ruler up to the point within the feasible region that is nearest to the origin. In both cases, you must remember to slide the ruler along the gradient of the objective function line.

graphical method of solving lp problems

Note that the ruler is parallel to the dotted line (i.e. the objective function line). The red point marked on the graph (100, 0) is the last point that the ruler touches while still remaining in the feasible region and is therefore the optimum point.

Step 7: Find the coordinates of the optimum point

In the above example, the co-ordinates of the optimum point can be identified easily because the point lies on the X-Axis.

If the optimum point of a linear programming problem does not lie on either x or y axis, you can find its co-ordinates by drawing vertical and horizontal lines from the optimum point towards the two axis.

Share This Post

Related posts, linear programming equation method, linear programming graphical method example, linear programming in accounting, limiting factor analysis in management accounting.

Welcome to maxusknowledge.com

logo

Linear Programming Graphical method- Slope of a line

Linear Programming Graphical method - Infeasible solution

Linear Programming Graphical method - Infeasible solution

Linear Programming Graphical method - Multiple optimal solutions

Linear Programming Graphical method - Multiple optimal solutions

Linear Programming Graphical method - Redundant constraints

Linear Programming Graphical method - Redundant constraints

Linear Programming Graphical method - Unbounded Solution

Linear Programming Graphical method - Unbounded Solution

Linear Programming Graphical method - Example 1 (Maximization objective)

Linear Programming Graphical method - Example 1 (Maximization objective)

Linear Programming Graphical method - Example 2 (Maximization objective)

Linear Programming Graphical method - Example 2 (Maximization objective)

Linear Programming Graphical method - Example 3 (Maximization objective)

Linear Programming Graphical method - Example 3 (Maximization objective)

Linear Programming Graphical method - Example 4 (Minimization objective)

Linear Programming Graphical method - Example 4 (Minimization objective)

Linear Programming Graphical method - Example 5 (Minimization objective)

Linear Programming Graphical method - Example 5 (Minimization objective)

Linear Programming Graphical method - Example 6 (Unbounded solution)

Linear Programming Graphical method - Example 6 (Unbounded solution)

Linear Programming Graphical method - Example 7 (Infeasible solution)

Linear Programming Graphical method - Example 7 (Infeasible solution)

Linear programming graphical method is a powerful tool for solving optimization problems in mathematics. Not only does it require minimal calculations, it also helps visualize the problem and gives you an easy-to-understand answer. In our video lectures, you’ll learn the basics of LP and how to use it to find solutions to your mathematical problems.

What is Linear Programming? Linear programming (LP) is a mathematical technique used to find optimal solutions for problems where multiple constraints and objectives are given. It involves finding an optimum solution that maximizes or minimizes a certain objective or set of objectives, while subject to certain constraints. LP can have both, lp graphical solutions and mathematical algorithms.

Using the lpp graphical method, a linear programming problem can be solved by graphing the constraints depicting the boundaries of the feasible solution. The objective function can then be plotted on this graph to find the optimal solution. This is done by finding points on the graph that represent feasible solutions and plotting them in terms of their various objectives. The optimal solution will be found at one of these points, where all objectives are either maximized or minimized simultaneously.

The graphical method of linear programming is effective because it allows the user to easily find the various points which represent feasible solutions, as well as giving them an intuitive way to visualize the boundaries of their constraints. This can be done by graphing each constraint equation and looking for the region on the graph where they all overlap. In addition, when graphing these constraints, it is easy to spot any areas that are restricted or not feasible, thus preventing any wasted time in finding a non-existent solution. Essentially, the graphical method gives you a good understanding of both constraining forces and objectives so that you can work your way towards achieving an optimal solution.

While solving linear programming problems using graphical methods is the most commonly used form of linear programming, there are some disadvantages to be aware of. The main downfall of the graphical method is that it becomes computationally difficult to find a solution when a large number of constraints and objectives need to be taken into account. In these cases, linear programming graphical method solvers can provide a more reliable way to determine an optimal solution. By using these alternative approaches, linear programming can help make important decisions about how resources should be allocated for maximum advantage for any problem.

Solving linear programming problems graphically is an optimal solution to a given problem by using mathematical models. Rather than using trial and error to come up with solutions, linear programming uses mathematical formulas and graphical methods in order to find the best solution. With this approach, constraints and objectives are clearly established, allowing for more precise decision-making. The graphical approach is the most widely used, as it visually represents different scenarios of the problem and helps provide a more comprehensive understanding of all potential solutions.

  • Math Article

Linear Programming

In Mathematics, linear programming is a method of optimising operations with some constraints. The main objective of linear programming is to maximize or minimize the numerical value. It consists of linear functions which are subjected to the constraints in the form of linear equations or in the form of inequalities.  Linear programming is considered an important technique that is used to find the optimum resource utilisation. The term “linear programming” consists of two words as linear and programming. The word “linear” defines the relationship between multiple variables with degree one. The word “programming” defines the process of selecting the best solution from various alternatives.

Linear Programming is widely used in Mathematics and some other fields such as economics, business, telecommunication, and manufacturing fields. In this article, let us discuss the definition of linear programming, its components, and different methods to solve linear programming problems.

Table of Contents:

  • Characteristics
  • Linear programming Problems
  • Simplex Method

Graphical Method

  • Applications
  • Practice Problems

What is Linear Programming?

Linear programming (LP)   or Linear Optimisation may be defined as the problem of maximizing or minimizing a linear function that is subjected to linear constraints. The constraints may be equalities or inequalities. The optimisation problems involve the calculation of profit and loss.   Linear programming problems  are an important class of optimisation problems, that helps to find the feasible region and optimise the solution in order to have the highest or lowest value of the function.

In other words, linear programming is considered as an optimization method to maximize or minimize the objective function of the given mathematical model with the set of some requirements which are represented in the linear relationship. The main aim of the linear programming problem is to find the optimal solution.

Linear programming is the method of considering different inequalities relevant to a situation and calculating the best value that is required to be obtained in those conditions.  Some of the assumptions taken while working with linear programming are:

  • The number of constraints should be expressed in the quantitative terms
  • The relationship between the constraints and the objective function should be linear
  • The linear function (i.e., objective function) is to be optimised

Components of Linear Programming

The basic components of the LP are as follows:

  • Decision Variables
  • Constraints
  • Objective Functions

Characteristics of Linear Programming

The following are the five characteristics of the linear programming problem:

Constraints – The limitations should be expressed in the mathematical form, regarding the resource.

Objective Function – In a problem, the objective function should be specified in a quantitative way.

Linearity – The relationship between two or more variables in the function must be linear. It means that the degree of the variable is one.

Finiteness –  There should be finite and infinite input and output numbers. In case, if the function has infinite factors, the optimal solution is not feasible. 

Non-negativity – The variable value should be positive or zero. It should not be a negative value.

Decision Variables – The decision variable will decide the output. It gives the ultimate solution of the problem. For any problem, the first step is to identify the decision variables.

Linear Programming Problems

The Linear Programming Problems (LPP) is a problem that is concerned with finding the optimal value of the given linear function. The optimal value can be either maximum value or minimum value. Here, the given linear function is considered an objective function. The objective function can contain several variables, which are subjected to the conditions and it has to satisfy the set of linear inequalities called linear constraints. The linear programming problems can be used to get the optimal solution for the following scenarios, such as manufacturing problems, diet problems, transportation problems, allocation problems and so on.

Methods to Solve Linear Programming Problems

The linear programming problem can be solved using different methods, such as the graphical method, simplex method, or by using tools such as R, open solver etc. Here, we will discuss the two most important techniques called the simplex method and graphical method in detail.

Linear Programming Simplex Method

The simplex method is one of the most popular methods to solve linear programming problems. It is an iterative process to get the feasible optimal solution. In this method, the value of the basic variable keeps transforming to obtain the maximum value for the objective function. The algorithm for linear programming simplex method is provided below:

Step 1 : Establish a given problem. (i.e.,) write the inequality constraints and objective function.

Step 2: Convert the given inequalities to equations by adding the slack variable to each inequality expression.

Step 3 : Create the initial simplex tableau. Write the objective function at the bottom row. Here, each inequality constraint appears in its own row. Now, we can represent the problem in the form of an augmented matrix, which is called the initial simplex tableau.

Step 4 : Identify the greatest negative entry in the bottom row, which helps to identify the pivot column. The greatest negative entry in the bottom row defines the largest coefficient in the objective function, which will help us to increase the value of the objective function as fastest as possible.

Step 5 : Compute the quotients. To calculate the quotient, we need to divide the entries in the far right column by the entries in the first column, excluding the bottom row. The smallest quotient identifies the row. The row identified in this step and the element identified in the step will be taken as the pivot element.

Step 6: Carry out pivoting to make all other entries in column is zero.

Step 7: If there are no negative entries in the bottom row, end the process. Otherwise, start from step 4.

Step 8: Finally, determine the solution associated with the final simplex tableau.

The graphical method is used to optimize the two-variable linear programming. If the problem has two decision variables, a graphical method is the best method to find the optimal solution. In this method, the set of inequalities are subjected to constraints. Then the inequalities are plotted in the XY plane. Once, all the inequalities are plotted in the XY graph, the intersecting region will help to decide the feasible region. The feasible region will provide the optimal solution as well as explains what all values our model can take.  Let us see an example here and understand the concept of linear programming in a better way.

Calculate the maximal and minimal value of z = 5x + 3y for the following constraints.

x + 2y ≤ 14

3x – y ≥ 0

x – y ≤ 2

The three inequalities indicate the constraints. The area of the plane that will be marked is the feasible region.

The optimisation equation (z) = 5x + 3y. You have to find the (x,y) corner points that give the largest and smallest values of z.

To begin with, first solve each inequality.

x + 2y ≤ 14 ⇒  y ≤ -(1/2)x + 7

3x – y ≥ 0 ⇒  y ≤ 3x

x – y ≤ 2 ⇒ y  ≥ x – 2

Here is the graph for the above equations.

Linear Programming - Graph

Now pair the lines to form a system of linear equations to find the corner points.

y = -(½) x + 7

Solving the above equations, we get the corner points as (2, 6)

y = -1/2 x + 7

y = x – 2

Solving the above equations, we get the corner points as (6, 4)

Solving the above equations, we get the corner points as (-1, -3)

For linear systems, the maximum and minimum values of the optimisation equation lie on the corners of the feasibility region. Therefore, to find the optimum solution, you only need to plug these three points in z = 3x + 4y

z = 5(2) + 3(6) = 10 + 18 = 28

z = 5(6) + 3(4) = 30 + 12 = 42

z = 5(-1) + 3(-3) = -5 -9 = -14

Hence, the maximum of z = 42 lies at (6, 4) and the minimum of z = -14 lies at (-1, -3)

Linear Programming Applications

A real-time example would be considering the limitations of labours and materials and finding the best production levels for maximum profit in particular circumstances. It is part of a vital area of mathematics known as optimisation techniques. The applications of LP in some other fields are

  • Engineering – It solves design and manufacturing problems as it is helpful for doing shape optimisation
  • Efficient Manufacturing – To maximise profit, companies use linear expressions
  • Energy Industry – It provides methods to optimise the electric power system.
  • Transportation Optimisation – For cost and time efficiency.

Importance of Linear Programming

Linear programming is broadly applied in the field of optimisation for many reasons. Many functional problems in operations analysis can be represented as linear programming problems. Some special problems of linear programming are such as network flow queries and multi-commodity flow queries are deemed to be important to have produced much research on functional algorithms for their solution.

Linear Programming Video Lesson

Linear programming problem.

graphical method of solving lp problems

Linear Programming Practice Problems

Solve the following linear programming problems:

  • A doctor wishes to mix two types of foods in such a way that the vitamin contents of the mixture contain at least 8 units of vitamin A and 10 units of vitamin C. Food ‘I’ contains 2 units/kg of vitamin A and 1 unit/kg of vitamin C. Food ‘II’ contains 1 unit/kg of vitamin A and 2 units/kg of vitamin C. It costs Rs 50 per kg to purchase Food ‘I’ and Rs 70 per kg to purchase Food ‘II’. Formulate this problem as a linear programming problem to minimise the cost of such a mixture
  • One kind of cake requires 200g of flour and 25g of fat, and another kind of cake requires 100g of flour and 50g of fat.  Formulate this problem as a linear programming problem to find the maximum number of cakes that can be made from 5kg of flour and 1 kg of fat assuming that there is no shortage of the other ingredients used in making the cakes.

Frequently Asked Questions on Linear Programming

Linear programming is a process of optimising the problems which are subjected to certain constraints. It means that it is the process of maximising or minimizing the linear functions under linear inequality constraints. The problem of solving linear programs is considered as the easiest one.

Mention the different types of linear programming.

The different types of linear programming are: Solving linear programming by Simplex method Solving linear programming using R Solving linear programming by graphical method Solving linear programming with the use of an open solver.

What are the requirements of linear programming?

The five basic requirements of linear programming are: Objective function Constraints Linearity Non-negativity Finiteness

Mention the advantages of Linear programming

The advantages of linear programming are: Linear programming provides insights to the business problems It helps to solve multi-dimensional problems According to the condition change, LP helps in making the adjustments By calculating the cost and profit of various things, LP helps to take the best optimal solution

What is meant by linear programming problems?

The linear programming problems (LPP) helps to find the best optimal solution of a linear function (also, known as the objective function) which are placed under certain constraints (set of linear inequality constraints)

To learn all concepts in Maths in a more engaging way, register at BYJU’S. Also, watch interesting videos on various Maths topics by downloading BYJU’S– The Learning App.

Leave a Comment Cancel reply

Your Mobile number and Email id will not be published. Required fields are marked *

Request OTP on Voice Call

Post My Comment

graphical method of solving lp problems

Thank you so much for clearly explained notes. I benefited a lot from them

Thank you very much for this material.

graphical method of solving lp problems

  • Share Share

Register with BYJU'S & Download Free PDFs

Register with byju's & watch live videos.

close

Wolfram|Alpha

Wolfram|Alpha Widgets Overview Tour Gallery Sign In

Share this page.

  • StumbleUpon
  • Google Buzz

Output Type

Output width, output height.

To embed this widget in a post, install the Wolfram|Alpha Widget Shortcode Plugin and copy and paste the shortcode above into the HTML source.

To embed a widget in your blog's sidebar, install the Wolfram|Alpha Widget Sidebar Plugin , and copy and paste the Widget ID below into the "id" field:

Save to My Widgets

Build a new widget.

We appreciate your interest in Wolfram|Alpha and will be in touch soon.

IMAGES

  1. LP Graphical Method (Multiple/Alternative Optimal Solutions)

    graphical method of solving lp problems

  2. Solving LPP using graphical method

    graphical method of solving lp problems

  3. Graphical LP solution for minimization problem with 2 variables

    graphical method of solving lp problems

  4. [Solved] Solve the given LP problem using graphical method. A company

    graphical method of solving lp problems

  5. Solution of LPP by graphical method

    graphical method of solving lp problems

  6. Graphical Method for Solving LPP

    graphical method of solving lp problems

VIDEO

  1. Pair of Linear Equations in 2 Variables l Class 10 Maths Chapter-3 l Solution by Graphical Method

  2. Linear Programming

  3. Numerical analysis

  4. Graphical Method

  5. Linear Programming Big- M Method

  6. LPP –Linear Programming Problem| Formulation of LPP| Solved Example Part

COMMENTS

  1. Graphical Solution of Linear Programming Problems

    In Graphical Solution of Linear Programming, we use graphs to solve LPP. We can solve a wide variety of problems using Linear programming in different sectors, but it is generally used for problems in which we have to maximize profit, minimize cost, or minimize the use of resources.

  2. PDF Section 2.1

    Solving Linear Programming Problems - The Graphical Method Graph the system of constraints. This will give the feasible set. Find each vertex (corner point) of the feasible set. Substitute each vertex into the objective function to determine which vertex optimizes the objective function. State the solution to the problem.

  3. Graphical Method for Linear Programming Problems

    Step 1: Formulate the LP (Linear programming) problem We have already understood the mathematical formulation of an LP problem in a previous section. Note that this is the most crucial step as all the subsequent steps depend on our analysis here. Browse more Topics under Linear Programming Different Types of Linear Programming Problems

  4. How to Solve a Linear Programming Problem Using the Graphical Method

    4.2K 762K views 9 years ago Linear Programming In this lesson we learn how to solve a linear programming problem using the graphical method with an example. We also see an example for an...

  5. Graphical Method Linear Programming

    The Graphical Method of Solving Linear Programming problems is based on a well-defined set of logical steps. With the help of these steps, we can master the graphical solution of Linear Programming problems. Methods used for Solving Linear Programming Following two methods used for Graphical Method of Solving Linear Programming:

  6. 3.3: Graphical Solutions

    This means that the cost per serving is $9.99/3 = $3.33. The cost for x servings would thus be 3.33 x. For dates, there are 4 servings per pound. This means that the cost per serving is $7.99/4 = $2.00. The cost for y servings would thus be 2.00y. The total cost, C, for apricots and dates would be. C = 3.33x + 2.00y.

  7. Graphical Method of Solving Linear Programming Problems

    Maths Math Article Graphical Method Linear Programming Linear Programming Problems - Graphical Method We already know how to plot the graph of any linear equation in two variables. The process involves plotting the points that satisfy the equation on the coordinate axis and joining them.

  8. 4.2 Graphical Solutions of Linear Programming

    The one in the upper left is the intersection of the lines and . Solving for the intersection using substitution: Point: (1, 15.8) The one in the lower right is the intersection of the lines and . Point: (10.9,1) Step 7: Testing the objective function at each of these corner points: Point. Cost, C = 3.33 x + 2.00 y.

  9. Graphical Methods in Linear Programming

    Graphical Methods in Linear Programming. We can use graphical methods to solve linear optimization problems involving two variables. When there are two variables in the problem, we can refer to them as x1 and x2, and we can do most of the analysis on a two-dimensional graph. Although the graphical approach does not generalize to a large number ...

  10. Linear Programming and Dynamic Programming

    7.2.5 Graphical Method of Solving an LP Problem. We now look at the graphical method of solving an LP problem. Though the graphical method has limited scope as only two-variable problems can be handled, all the features of an LP problem can be elegantly brought out using the graphical solution itself. Example 7.1

  11. PDF Linear Programming: Model Formulation and Solution

    Step 1 : Clearly define the decision variables Step 2 : Construct the objective function Step 3 : Formulate the constraints LP Model Formulation Illustration 1: A Maximization Example (1 of 4) Product mix problem - Beaver Creek Pottery Company How many bowls and mugs should be produced to maximize profits given labor and materials constraints?

  12. Linear Programming

    Linear Programming Formula A linear programming problem will consist of decision variables, an objective function, constraints, and non-negative restrictions. The decision variables, x, and y, decide the output of the LP problem and represent the final solution.

  13. Graphical Method Calculator

    Solving optimization exercises with the graphical method will be easier with our graphical method calculator for linear programming problems. Graphical Method Calculator - Linear Programming Objective: Objective Function: X + X Constraints Constraint 1: X + X Constraint 2: X + X X 1, X 2 ≥ 0 + − Graph Reset Members-Only Content

  14. Lecture 3: Graphical Method of Solving Linear Programming ...

    Graphical Method explains how to solve a Linear Programming optimization manually (Graphically) without the use of any software. The optimization problem mus...

  15. Linear Programming with Spreadsheets

    You learned what linear programming is, basic concepts, and terminologies used in LP, LP-problem formulation, solving LP problems using the graphical method, and use cases of the LP problem. Hopefully, you can now utilize the linear programming concepts to make decisions in your organization or optimize your results for decision makers.

  16. Linear Programming Using Graphic Solution

    An LP problem that involves two variables in a linear relationship can be easily solved with the help of graphical method. When there are only two variables in the problem, most of the analysis can be performed on a two-dimensional graph. Table of Content 1 Methods for Solving Linear Programming Problems 1.1 Graphical Method

  17. Linear Programming For Optimization

    Graphical Method Basic Problem. We will start with the graphical method as thats the simplest to understand and gives us real intuition behind LP. ... The simplex algorithm was invented to solve LP problems by George Dantzig during the second world war. The general flow of the algorithm is to go to every vertex of the convex polygon and ...

  18. Linear Programming Graphical Method

    Introduction. Graphical method of linear programming is used to solve problems by finding the highest or lowest point of intersection between the objective function line and the feasible region on a graph. This process can be broken down into 7 simple steps explained below.

  19. How to solve linear programming problems by graphical method

    Using the lpp graphical method, a linear programming problem can be solved by graphing the constraints depicting the boundaries of the feasible solution. The objective function can then be plotted on this graph to find the optimal solution. This is done by finding points on the graph that represent feasible solutions and plotting them in terms ...

  20. burch_ch16

    Chapter 16 : Linear Programming: The Graphical and Simplex Methods. INTRODUCTION. Linear programming (LP) is an application of matrix algebra used to solve a broad class of problems that can be represented by a system of linear equations. A linear equation is an algebraic equation whose variable quantity or quantities are in the first power only and whose graph is a straight line.

  21. Linear Programming Problem (LPP)- Simplex and Graphical method

    Linear programming problem (LPP) Linear Programming Problems (LPP): Linear programming or linear optimization is a process which takes into consideration certain linear relationships to obtain the best possible solution to a mathematical model. It is also denoted as LPP.

  22. Linear Programming (Definition, Methods & Examples)

    Linear Programming In Mathematics, linear programming is a method of optimising operations with some constraints. The main objective of linear programming is to maximize or minimize the numerical value. It consists of linear functions which are subjected to the constraints in the form of linear equations or in the form of inequalities.

  23. Linear Programming Solver

    Linear Programming Solver Added Jul 31, 2018 by vik_31415 in Mathematics Linear programming solver with up to 9 variables. New constraints could be added by using commas to separate them. Send feedback | Visit Wolfram|Alpha Get the free "Linear Programming Solver" widget for your website, blog, Wordpress, Blogger, or iGoogle.

  24. How to Choose the Best Algorithms for LP Problems in OR

    1 Simplex method. The simplex method is the most classical and popular algorithm for solving LP problems. It starts from an initial feasible solution and moves along the edges of the feasible ...