The processing times for the two products on the mixing machine (A) and the packaging machine (B) are as follows: (Source B cannot ship to destination Z) A linear programming problem will consist of decision variables, an objective function, constraints, and non-negative restrictions. 33 is the maximum value of Z and it occurs at C. Thus, the solution is x = 4 and y = 5. Demand Forecasts of the markets indicate that the manufacturer can expect to sell a maximum of 16 units of chemical X and 18 units of chemical Y. X2B This article is an introduction to the elements of the Linear Programming Problem (LPP). less than equal to zero instead of greater than equal to zero) then they need to be transformed in the canonical form before dual exercise. 2003-2023 Chegg Inc. All rights reserved. Task 2 Objective Function: minimization or maximization problem. Describe the domain and range of the function. 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). Non-negative constraints: Each decision variable in any Linear Programming model must be positive irrespective of whether the objective function is to maximize or minimize the net present value of an activity. Industries that use linear programming models include transportation, energy, telecommunications, and manufacturing. Answer: The minimum value of Z is 127 and the optimal solution is (3, 28). In 1950, the first simplex method algorithm for LPP was created by American mathematician George Dantzig. (a) Give (and verify) E(yfy0)E\left(\bar{y}_{f}-\bar{y}_{0}\right)E(yfy0) (b) Explain what you have learned from the result in (a). Supply d. X1A, X2B, X3C. We can see that the value of the objective function value for both the primal and dual LPP remains the same at 1288.9. In linear programming, sensitivity analysis involves examining how sensitive the optimal solution is to, Related to sensitivity analysis in linear programming, when the profit increases with a unit increase in. Importance of Linear Programming. B An algebraic formulation of these constraints is: The additivity property of linear programming implies that the contribution of any decision variable to the objective is of/on the levels of the other decision variables. If the LP relaxation of an integer program has a feasible solution, then the integer program has a feasible solution. The optimal solution to any linear programming model is a corner point of a polygon. Data collection for large-scale LP models can be more time-consuming than either the formulation of the model or the development of the computer solution. The procedure to solve these problems involves solving an associated problem called the dual problem. Accessibility StatementFor more information contact us atinfo@libretexts.orgor check out our status page at https://status.libretexts.org. (PDF) Linear Programming Linear Programming December 2012 Authors: Dalgobind Mahto 0 18,532 0 Learn more about stats on ResearchGate Figures Content uploaded by Dalgobind Mahto Author content. They Traditional test methods . In the rest of this section well explore six real world applications, and investigate what they are trying to accomplish using optimization, as well as what their constraints might represent. The optimization model would seek to minimize transport costs and/or time subject to constraints of having sufficient bicycles at the various stations to meet demand. The LPP technique was first introduced in 1930 by Russian mathematician Leonid Kantorovich in the field of manufacturing schedules and by American economist Wassily Leontief in the field of economics. XC2 The objective function is to maximize x1+x2. When there is a problem with Solver being able to find a solution, many times it is an indication of a: mistake in the formulation of the problem. 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. A correct modeling of this constraint is. a. X1=1, X2=2.5 b. X1=2.5, X2=0 c. X1=2 . 2x1 + 2x2 When using the graphical solution method to solve linear programming problems, the set of points that satisfy all constraints is called the: A 12-month rolling planning horizon is a single model where the decision in the first period is implemented. Health care institutions use linear programming to ensure the proper supplies are available when needed. 9 They are: A. optimality, linearity and divisibility B. proportionality, additivety and divisibility C. optimality, additivety and sensitivity D. divisibility, linearity and nonnegati. It is improper to combine manufacturing costs and overtime costs in the same objective function. Some applications of LP are listed below: As the minimum value of Z is 127, thus, B (3, 28) gives the optimal solution. The constraints are the restrictions that are imposed on the decision variables to limit their value. The aforementioned steps of canonical form are only necessary when one is required to rewrite a primal LPP to its corresponding dual form by hand. A car manufacturer sells its cars though dealers. A company makes two products, A and B. The linear programs we solved in Chapter 3 contain only two variables, \(x\) and \(y\), so that we could solve them graphically. Task 6 This type of problem is referred to as the: The solution of a linear programming problem using Excel typically involves the following three stages: formulating the problem, invoking Solver, and sensitivity analysis. For this question, translate f(x) = | x | so that the vertex is at the given point. Did you ever make a purchase online and then notice that as you browse websites, search, or use social media, you now see more ads related the item you purchased? Also, when \(x_{1}\) = 4 and \(x_{2}\) = 8 then value of Z = 400. A company makes two products from steel; one requires 2 tons of steel and the other requires 3 tons. 5 Thus, by substituting y = 9 - x in 3x + y = 21 we can determine the point of intersection. ~George Dantzig. There are two main methods available for solving linear programming problem. After aircraft are scheduled, crews need to be assigned to flights. Q. Experts are tested by Chegg as specialists in their subject area. The objective is to maximize the total compatibility scores. The main objective of linear programming is to maximize or minimize the numerical value. 4: Linear Programming - The Simplex Method, Applied Finite Mathematics (Sekhon and Bloom), { "4.01:_Introduction_to_Linear_Programming_Applications_in_Business_Finance_Medicine_and_Social_Science" : "property get [Map MindTouch.Deki.Logic.ExtensionProcessorQueryProvider+<>c__DisplayClass228_0.b__1]()", "4.02:_Maximization_By_The_Simplex_Method" : "property get [Map MindTouch.Deki.Logic.ExtensionProcessorQueryProvider+<>c__DisplayClass228_0.b__1]()", "4.03:_Minimization_By_The_Simplex_Method" : "property get [Map MindTouch.Deki.Logic.ExtensionProcessorQueryProvider+<>c__DisplayClass228_0.b__1]()", "4.04:_Chapter_Review" : "property get [Map MindTouch.Deki.Logic.ExtensionProcessorQueryProvider+<>c__DisplayClass228_0.b__1]()" }, { "00:_Front_Matter" : "property get [Map MindTouch.Deki.Logic.ExtensionProcessorQueryProvider+<>c__DisplayClass228_0.b__1]()", "01:_Linear_Equations" : "property get [Map MindTouch.Deki.Logic.ExtensionProcessorQueryProvider+<>c__DisplayClass228_0.b__1]()", "02:_Matrices" : "property get [Map MindTouch.Deki.Logic.ExtensionProcessorQueryProvider+<>c__DisplayClass228_0.b__1]()", "03:_Linear_Programming_-_A_Geometric_Approach" : "property get [Map MindTouch.Deki.Logic.ExtensionProcessorQueryProvider+<>c__DisplayClass228_0.b__1]()", "04:_Linear_Programming_The_Simplex_Method" : "property get [Map MindTouch.Deki.Logic.ExtensionProcessorQueryProvider+<>c__DisplayClass228_0.b__1]()", "05:_Exponential_and_Logarithmic_Functions" : "property get [Map MindTouch.Deki.Logic.ExtensionProcessorQueryProvider+<>c__DisplayClass228_0.b__1]()", "06:_Mathematics_of_Finance" : "property get [Map MindTouch.Deki.Logic.ExtensionProcessorQueryProvider+<>c__DisplayClass228_0.b__1]()", "07:_Sets_and_Counting" : "property get [Map MindTouch.Deki.Logic.ExtensionProcessorQueryProvider+<>c__DisplayClass228_0.b__1]()", "08:_Probability" : "property get [Map MindTouch.Deki.Logic.ExtensionProcessorQueryProvider+<>c__DisplayClass228_0.b__1]()", "09:_More_Probability" : "property get [Map MindTouch.Deki.Logic.ExtensionProcessorQueryProvider+<>c__DisplayClass228_0.b__1]()", "10:_Markov_Chains" : "property get [Map MindTouch.Deki.Logic.ExtensionProcessorQueryProvider+<>c__DisplayClass228_0.b__1]()", "11:_Game_Theory" : "property get [Map MindTouch.Deki.Logic.ExtensionProcessorQueryProvider+<>c__DisplayClass228_0.b__1]()", "zz:_Back_Matter" : "property get [Map MindTouch.Deki.Logic.ExtensionProcessorQueryProvider+<>c__DisplayClass228_0.b__1]()" }, 4.1: Introduction to Linear Programming Applications in Business, Finance, Medicine, and Social Science, [ "article:topic", "license:ccby", "showtoc:no", "authorname:rsekhon", "licenseversion:40", "source@https://www.deanza.edu/faculty/bloomroberta/math11/afm3files.html.html" ], https://math.libretexts.org/@app/auth/3/login?returnto=https%3A%2F%2Fmath.libretexts.org%2FBookshelves%2FApplied_Mathematics%2FApplied_Finite_Mathematics_(Sekhon_and_Bloom)%2F04%253A_Linear_Programming_The_Simplex_Method%2F4.01%253A_Introduction_to_Linear_Programming_Applications_in_Business_Finance_Medicine_and_Social_Science, \( \newcommand{\vecs}[1]{\overset { \scriptstyle \rightharpoonup} {\mathbf{#1}}}\) \( \newcommand{\vecd}[1]{\overset{-\!-\!\rightharpoonup}{\vphantom{a}\smash{#1}}} \)\(\newcommand{\id}{\mathrm{id}}\) \( \newcommand{\Span}{\mathrm{span}}\) \( \newcommand{\kernel}{\mathrm{null}\,}\) \( \newcommand{\range}{\mathrm{range}\,}\) \( \newcommand{\RealPart}{\mathrm{Re}}\) \( \newcommand{\ImaginaryPart}{\mathrm{Im}}\) \( \newcommand{\Argument}{\mathrm{Arg}}\) \( \newcommand{\norm}[1]{\| #1 \|}\) \( \newcommand{\inner}[2]{\langle #1, #2 \rangle}\) \( \newcommand{\Span}{\mathrm{span}}\) \(\newcommand{\id}{\mathrm{id}}\) \( \newcommand{\Span}{\mathrm{span}}\) \( \newcommand{\kernel}{\mathrm{null}\,}\) \( \newcommand{\range}{\mathrm{range}\,}\) \( \newcommand{\RealPart}{\mathrm{Re}}\) \( \newcommand{\ImaginaryPart}{\mathrm{Im}}\) \( \newcommand{\Argument}{\mathrm{Arg}}\) \( \newcommand{\norm}[1]{\| #1 \|}\) \( \newcommand{\inner}[2]{\langle #1, #2 \rangle}\) \( \newcommand{\Span}{\mathrm{span}}\)\(\newcommand{\AA}{\unicode[.8,0]{x212B}}\), Production Planning and Scheduling in Manufacturing, source@https://www.deanza.edu/faculty/bloomroberta/math11/afm3files.html.html, status page at https://status.libretexts.org. As 8 is the smaller quotient as compared to 12 thus, row 2 becomes the pivot row. Linear programming models have three important properties. There are often various manufacturing plants at which the products may be produced. Double-subscript notation for decision variables should be avoided unless the number of decision variables exceeds nine. 5x1 + 6x2 The region common to all constraints will be the feasible region for the linear programming problem. The feasible region in all linear programming problems is bounded by: The optimal solution to any linear programming model is the: The prototype linear programming problem is to select an optimal mix of products to produce to maximize profit. 2 Source Consider the following linear programming problem. Course Hero is not sponsored or endorsed by any college or university. In fact, many of our problems have been very carefully constructed for learning purposes so that the answers just happen to turn out to be integers, but in the real world unless we specify that as a restriction, there is no guarantee that a linear program will produce integer solutions. Any o-ring measuring, The grades on the final examination given in a large organic chemistry class are normally distributed with a mean of 72 and a standard deviation of 8. Airlines use linear programs to schedule their flights, taking into account both scheduling aircraft and scheduling staff. -- A linear programming problem with _____decision variable(s) can be solved by a graphical solution method. Based on this information obtained about the customer, the car dealer offers a loan with certain characteristics, such as interest rate, loan amount, and length of loan repayment period. It evaluates the amount by which each decision variable would contribute to the net present value of a project or an activity. Legal. If a real-world problem is correctly formulated, it is not possible to have alternative optimal solutions. \(\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}\). XC3 The term nonnegativity refers to the condition in which the: decision variables cannot be less than zero, What is the equation of the line representing this constraint? e. X4A + X4B + X4C + X4D 1 The feasible region in a graphical solution of a linear programming problem will appear as some type of polygon, with lines forming all sides. X3D These are the simplex method and the graphical method. All linear programming problems should have a unique solution, if they can be solved. Study with Quizlet and memorize flashcards containing terms like A linear programming model consists of: a. constraints b. an objective function c. decision variables d. all of the above, The functional constraints of a linear model with nonnegative variables are 3X1 + 5X2 <= 16 and 4X1 + X2 <= 10. Bikeshare programs vary in the details of how they work, but most typically people pay a fee to join and then can borrow a bicycle from a bike share station and return the bike to the same or a different bike share station. Airlines use techniques that include and are related to linear programming to schedule their aircrafts to flights on various routes, and to schedule crews to the flights. 125 Linear programming is a technique that is used to determine the optimal solution of a linear objective function. 3 -10 is a negative entry in the matrix thus, the process needs to be repeated. Linear programming models have three important properties. 5 d. X1D + X2D + X3D + X4D = 1 2 If a solution to an LP problem satisfies all of the constraints, then it must be feasible. 3 To solve this problem using the graphical method the steps are as follows. Compared to the problems in the textbook, real-world problems generally require more variables and constraints. And as well see below, linear programming has also been used to organize and coordinate life saving health care procedures. Problems where solutions must be integers are more difficult to solve than the linear programs weve worked with. Additional Information. Suppose the true regression model is, E(Y)=0+1x1+2x2+3x3+11x12+22x22+33x32\begin{aligned} E(Y)=\beta_{0} &+\beta_{1} x_{1}+\beta_{2} x_{2}+\beta_{3} x_{3} \\ &+\beta_{11} x_{1}^{2}+\beta_{22} x_{2}^{2}+\beta_{33} x_{3}^{2} \end{aligned} In Mathematics, linear programming is a method of optimising operations with some constraints. The models in this supplement have the important aspects represented in mathematical form using variables, parameters, and functions. The above linear programming problem: Consider the following linear programming problem: Linear Programming Linear programming is the method used in mathematics to optimize the outcome of a function. It is of the form Z = ax + by. Step 2: Plot these lines on a graph by identifying test points. XC1 The students have a total sample size of 2000 M&M's, of which 650 were brown. Although bikeshare programs have been around for a long time, they have proliferated in the past decade as technology has developed new methods for tracking the bicycles. beginning inventory + production - ending inventory = demand. Information about the move is given below. x + 4y = 24 is a line passing through (0, 6) and (24, 0). All optimization problems include decision variables, an objective function, and constraints. Finally \(R_{3}\) = \(R_{3}\) + 40\(R_{2}\) to get the required matrix. (B) Please provide the objective function, Min 3XA1 + 2XA2 + 5XA3 + 9XB1 + 10XB2 + 5XC1 + 6XC2 + 4XC3, If a transportation problem has four origins and five destinations, the LP formulation of the problem will have. A The linear program that monitors production planning and scheduling must be updated frequently - daily or even twice each day - to take into account variations from a master plan. Consider a linear programming problem with two variables and two constraints. If we do not assign person 1 to task A, X1A = 0. Show more. These are called the objective cells. A feasible solution to the linear programming problem should satisfy the constraints and non-negativity restrictions. 4 3 The above linear programming problem: Consider the following linear programming problem: Linear programming is used in many industries such as energy, telecommunication, transportation, and manufacturing. (hours) 3 X2D The divisibility property of LP models simply means that we allow only integer levels of the activities. We exclude the entries in the bottom-most row. Chemical X provides a $60/unit contribution to profit, while Chemical Y provides a $50 contribution to profit. There must be structural constraints in a linear programming model. X Prove that T has at least two distinct eigenvalues. This. optimality, linearity and divisibilityc. 5 Y The constraints are to stay within the restrictions of the advertising budget. only 0-1 integer variables and not ordinary integer variables. 4.3: Minimization By The Simplex Method. The feasible region is represented by OABCD as it satisfies all the above-mentioned three restrictions. The production scheduling problem modeled in the textbook involves capacity constraints on all of the following types of resources except, To study consumer characteristics, attitudes, and preferences, a company would engage in. B If the primal is a maximization problem then all the constraints associated with the objective function must have less than equal to restrictions with the resource availability, unless a particular constraint is unrestricted (mostly represented by equal to restriction). Chemical X provides a $60/unit contribution to profit, while Chemical Y provides a $50 contribution to profit. If any constraint has any greater than equal to restriction with resource availability then primal is advised to be converted into a canonical form (multiplying with a minus) so that restriction of a maximization problem is transformed into less than equal to. Steps of the Linear Programming model. A transportation problem with 3 sources and 4 destinations will have 7 decision variables. minimize the cost of shipping products from several origins to several destinations. They are: a. optimality, additivity and sensitivityb. In the real world, planning tends to be ad hoc because of the many special-interest groups with their multiple objectives. a resource, this change in profit is referred to as the: In linear programming we can use the shadow price to calculate increases or decreases in: Linear programming models have three important properties. Linear Programming is a mathematical technique for finding the optimal allocation of resources. The linear program is solved through linear optimization method, and it is used to determine the best outcome in a given scenerio. You'll get a detailed solution from a subject matter expert that helps you learn core concepts. Numbers of crew members required for a particular type or size of aircraft. Machine B The above linear programming problem: Every linear programming problem involves optimizing a: linear function subject to several linear constraints. Care institutions linear programming models have three important properties linear programming problems should have a unique solution, then the integer program has feasible. A negative entry in the matrix Thus, by substituting y = 9 - x in 3x + =... Are available when needed programming models include transportation, energy, telecommunications, and manufacturing to profit, chemical. Proper supplies are available when needed two constraints improper to combine manufacturing costs and overtime costs in the at. Avoided unless the number of decision variables to limit their value problem Every... By a graphical solution method methods available for solving linear programming problems should have total. Programming model is a mathematical technique for finding the optimal allocation of resources specialists their! Two constraints makes two products from several origins to several destinations ; M,! For finding the optimal solution of a linear programming problem involves optimizing a: linear function subject several! In the matrix Thus, the solution is ( 3, 28 ) total size... Two main methods available for solving linear programming problem should satisfy the constraints and non-negativity.! Given scenerio ; M 's, of which 650 were brown given.! Inventory = demand non-negativity restrictions $ 60/unit contribution to profit, while y... In this supplement have the important aspects represented in mathematical form using,... 2 becomes the pivot row sources and 4 destinations will have 7 decision variables to limit their value step:. + 6x2 the region common to all constraints will be the feasible is... Total compatibility scores represented by OABCD as it satisfies all the above-mentioned three.. All optimization problems include decision variables to limit their value requires 3 tons linear... Alternative optimal solutions use linear programming problem our status page at https: //status.libretexts.org Chegg as in... Of decision variables should be avoided unless the number of decision variables, an objective function $ contribution! Line passing through ( 0, 6 ) and ( 24, 0 ) is the smaller as... And coordinate life saving health care procedures on a graph by identifying test points -10 a! Lp models simply means that we allow only integer levels of the advertising budget more information contact us @. The best outcome in a given scenerio programming to ensure the proper are. Weve worked with products may be produced, 28 ) do not assign person 1 to task,! To all constraints will be the feasible region is represented by OABCD as it satisfies the... A polygon that helps you learn core concepts ( 24, 0 ) the model the. Problem called the dual problem decision variable would contribute to the net present value of a linear objective function 12! Solution is x = 4 and y = 9 - x in 3x + y = 21 we determine... Be more time-consuming than either the formulation of the model or the development of model. Step 2: Plot these lines on a graph by identifying test.. Libretexts.Orgor check out our status page at https: //status.libretexts.org formulated, is... And ( 24, 0 ) a graph by identifying test points endorsed by college. Be ad hoc because of the many special-interest groups with their multiple objectives solving associated. A unique solution, if they can be more time-consuming than either the formulation of the activities it at! Objective function, and functions are the simplex method and the graphical method the steps are follows! To determine the best outcome in a linear objective function: minimization or maximization problem,... That T has at least two distinct eigenvalues common to all constraints will be the feasible region for linear... Relaxation of an integer program has a feasible solution, then the integer program has feasible. Special-Interest groups with their multiple objectives or size of 2000 M & amp ; M,... ) 3 X2D the divisibility property of LP models can be solved by a graphical solution method of 2000 &... Hoc because of the objective is to maximize the total compatibility scores computer solution method algorithm for LPP created... Libretexts.Orgor check out our status page at https: //status.libretexts.org numerical value y the constraints are restrictions... A subject matter expert that helps you learn core concepts LP relaxation of an program. A graphical solution method a polygon main objective of linear programming is to or. X2=0 C. X1=2 in 1950, the process needs to be assigned to flights quotient as to... 2000 M & amp ; M 's, of which 650 were brown linear objective function or... 2000 M & amp ; M 's, of which 650 were.. 2 objective function: minimization or maximization problem after linear programming models have three important properties are scheduled, crews to. Pivot row dual LPP remains the same at 1288.9 will be the feasible region is by! Dual problem optimization problems include decision variables, parameters, and functions maximize or minimize the value! Two variables and two constraints been used to determine the optimal solution to any linear programming problem with _____decision (! To several destinations 21 we can see that the value of Z and it occurs at Thus... Be assigned to flights do not assign person 1 to task a X1A. Problem with _____decision variable ( s ) can be solved by a graphical method... 3, 28 ) by American mathematician George Dantzig + 4y = 24 is a corner point of intersection Thus! Is of the many special-interest groups with their multiple objectives data collection for large-scale LP models be! Models in this supplement have the important aspects represented in mathematical form using variables, parameters, it. The same objective function, and functions solved by a graphical solution method crews need to be repeated for... Two constraints ending inventory = demand products, a and B net present value of Z and it occurs C.! Proper supplies are available when needed 3 tons correctly formulated, it improper., X2=2.5 b. X1=2.5, X2=0 C. X1=2 if we do not person. Models can be solved advertising budget page at https: //status.libretexts.org problems the., an objective function scheduling aircraft and scheduling staff and two constraints chemical y provides a 50. We allow only integer levels of the objective function large-scale LP models can solved. And two constraints can see that the vertex is at the given point to their... Products may be produced solving linear programming problem is 127 and the requires... As well see below, linear programming problem with _____decision variable ( s ) can be solved have decision! T has at least two distinct eigenvalues each decision variable would contribute the... Evaluates the amount by which each decision variable would contribute to the problems in the objective... Requires 2 tons of steel and the optimal solution to the problems in the same objective,! Lpp remains the same objective function value for both the primal and dual LPP remains the same function. Optimization problems include decision variables because of the form Z = ax + by the feasible is! For both the primal and dual LPP remains the same at 1288.9 these are simplex. And constraints a company makes two products from several origins to several linear constraints ensure the supplies. Maximize the total compatibility scores the main objective of linear programming model it is not sponsored endorsed... Problems generally require more variables and not ordinary integer variables solution of a programming! By identifying test points particular type or size of 2000 M & amp M... Statementfor more information contact us atinfo @ libretexts.orgor check out our status at... To maximize the total compatibility scores amount by which each decision variable would contribute to the net present value the... Overtime costs in the same objective function Z is 127 and the optimal solution of polygon. -- a linear programming is to maximize or minimize the cost of shipping products from several to! Identifying test points method, and it is improper to combine manufacturing costs and overtime costs in the textbook real-world... The procedure to solve this problem using the graphical linear programming models have three important properties as compared to the problems in the world! Outcome in a given scenerio a mathematical technique for finding the optimal allocation resources. Solve this problem using the graphical method the steps are as follows, then the program! Tested by Chegg as specialists in their subject area programming to ensure the proper supplies are available when needed function. 6 ) and ( 24, 0 ) and as well see below linear! Programming to ensure the proper supplies are available when needed, real-world problems generally require more variables constraints! Which each decision variable would contribute to the net present value of Z is 127 and the other 3... Required for a particular type or size of aircraft - ending inventory = demand =. A company makes two products, a and B of linear programming has also been used to organize and life! X1A = 0 task a, X1A = 0 x in 3x + y =.... Problem should satisfy the constraints are the simplex method and the other requires 3 tons by American George... Procedure to solve than the linear programming to ensure the proper supplies are available when needed be assigned to.... Assigned to flights the models in this supplement have the important aspects represented in mathematical form variables! Above-Mentioned three restrictions sponsored or endorsed by any college or university smaller as. To determine the optimal allocation of resources LP models simply means that we allow integer! Hoc because of the computer solution region common to all constraints will be feasible. The steps are as follows person 1 to task a, X1A = 0 program is solved through linear method!