Master's Thesis from the year 2013 in the subject Engineering - Industrial Engineering and Management, grade: Good, LMU Munich (Dr. B R Ambedkar National Institute of Technology, Jalandhar), course: Industrial Engg., language: English, abstract: Since the late 1940s, linear programming models have been used for many different purposes. Airline companies apply these models to optimize their use of planes and staff. NASA has been using them for many years to optimize their use of limited resources. Oil companies use them to optimize their refinery operations. Small and medium-sized businesses use linear programming to solve a huge variety of problems, often involving resource allocation. In my study, a typical product-mix problem in a manufacturing system producing two products (each product consists of two sub-assemblies) is solved for its optimal solution through the use of the latest versions of MATLAB having the command simlp, which is very much like linprog. As analysts, we try to find a good enough solution for the decision maker to make a final decision. Our attempt is to give the mathematical description of the product-mix optimization problem and bring the problem into a form ready to call MATLAB’s simlp command. The objective of this paper is to find the best product mix that maximizes profit. The graph obtained using MATLAB commands, give the shaded area enclosed by the constraints called the feasible region, which is the set of points satisfying all the constraints. To find the optimal solution we look at the lines of equal profit to find the corner of the feasible region which yield the highest profit. This corner can be found out at the farthest line of equal profit which still touches the feasible region. The most critical part is the sensitivity analysis using Excel Solver and Parametric Analysis using computer software which allows us to study the effect on optimal solution due to discrete and continuous change in parameters of the LP model including to identify bottlenecks. We have examined other options like product outsourcing, one-time cost, cross training of one operator, manufacturing of hypothetical third product on under-utilized machines and optimal sequencing of jobs on machines.

Since the late 1940s, linear programming models have been used for many different purposes. Airline companies apply these models to optimize their use of planes and staff. NASA has been using them for many years to optimize their use of limited resources. Oil companies use them to optimize their refinery operations. Small and medium-sized businesses use linear programming to solve a huge variety of problems, often involving resource allocation. In my study, a typical product-mix problem in a manufacturing system producing two products (each product consists of two sub-assemblies) is solved for its optimal solution through the use of the latest versions of MATLAB having the command simlp, which is very much like linprog. As analysts, we try to find a good enough solution for the decision maker to make a final decision. Our attempt is to give the mathematical description of the product-mix optimization problem and bring the problem into a form ready to call MATLAB’s simlp command. The objective of this study is to find the best product mix that maximizes profit. The graph obtained using MATLAB commands, give the shaded area enclosed by the constraints called the feasible region, which is the set of points satisfying all the constraints. To find the optimal solution we look at the lines of equal profit to find the corner of the feasible region which yield the highest profit. This corner can be found out at the farthest line of equal profit, which still touches the feasible region. The most critical part is the sensitivity analysis, using Excel Solver, and Parametric Analysis, using computer software, which allows us to study the effect on optimal solution due to discrete and continuous change in parameters of the LP model including to identify bottlenecks. We have examined other options like product outsourcing, one-time cost, cross training of one operator, manufacturing of hypothetical third product on under-utilized machines and optimal sequencing of jobs on machines.

Since the late 1940s, linear programming models have been used for many different purposes. Airline companies apply these models to optimize their use of planes and staff. NASA has been using them for years to optimize their use of limited resources. Oil companies use them to optimize their refinery operations. Small and medium-sized businesses use linear programming to solve a huge variety of problems, often involving resource allocation. In my study, a typical product-mix problem in a manufacturing system producing two products (each product consists of two sub-assemblies) is solved for ist optimal solution through the use of the latest versions of MATLAB having the command simlp, which is very much like linprog. As analysts, we try to find a good enough solution for the decision maker to make a final decision. Our attempt is to give the mathematical description of the product-mix optimization problem and bring the problem into a form ready to call MATLAB’s simlp command. The objective of this study is to find the best product mix that maximizes profit. The graph obtained using MATLAB commands, give the shaded area enclosed by the constraints called the feasible region, which is the set of points satisfying all the constraints. To find the optimal solution we look at the lines of equal profit to find the corner of the feasible region which yield the highest profit. This corner can be found out at the farthest line of equal profit, which still touches the feasible region. The most critical part is the sensitivity analysis, using Excel Solver, and Parametric Analysis, using computer software, which allows us to study the effect on optimal solution due to discrete and continuous change in parameters of the LP model including to identify bottlenecks. We have examined other options like product outsourcing, one-time cost, cross training of one operator, manufacturing of hypothetical third product on under-utilized machines and optimal sequencing of jobs on machines.

Guides in the application of linear programming to firm decision making, with the goal of giving decision-makers a better understanding of methods at their disposal Useful as a main resource or as a supplement in an economics or management science course, this comprehensive book addresses the deficiencies of other texts when it comes to covering linear programming theory—especially where data envelopment analysis (DEA) is concerned—and provides the foundation for the development of DEA. Linear Programming and Resource Allocation Modeling begins by introducing primal and dual problems via an optimum product mix problem, and reviews the rudiments of vector and matrix operations. It then goes on to cover: the canonical and standard forms of a linear programming problem; the computational aspects of linear programming; variations of the standard simplex theme; duality theory; single- and multiple- process production functions; sensitivity analysis of the optimal solution; structural changes; and parametric programming. The primal and dual problems are then reformulated and re-examined in the context of Lagrangian saddle points, and a host of duality and complementary slackness theorems are offered. The book also covers primal and dual quadratic programs, the complementary pivot method, primal and dual linear fractional functional programs, and (matrix) game theory solutions via linear programming, and data envelopment analysis (DEA). This book: Appeals to those wishing to solve linear optimization problems in areas such as economics, business administration and management, agriculture and energy, strategic planning, public decision making, and health care Fills the need for a linear programming applications component in a management science or economics course Provides a complete treatment of linear programming as applied to activity selection and usage Contains many detailed example problems as well as textual and graphical explanations Linear Programming and Resource Allocation Modeling is an excellent resource for professionals looking to solve linear optimization problems, and advanced undergraduate to beginning graduate level management science or economics students.