Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Scribd
Upload
43 views

Assignment No. 5 Linear Programming

This document contains an assignment on linear programming submitted by Patricia Nicole Y. Cruz to Prof. Mario Brillante Wesley C. Cabotage. It includes 4 questions about linear programming and the simplex method. Question 1 defines linear programming as a mathematical method for finding the optimal solution to a linear problem by focusing on variables, objectives, and constraints. Question 2 discusses the importance of linear programming in fields like design, manufacturing, and public policy. Question 3 defines the simplex method as a standard technique for solving linear programming problems involving inequalities that form a polygonal region. Question 4 states that the simplex method investigates the feasible set's surrounding vertices to find where the objective function is optimized.

Uploaded by

Patricia Cruz
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
43 views

Assignment No. 5 Linear Programming

This document contains an assignment on linear programming submitted by Patricia Nicole Y. Cruz to Prof. Mario Brillante Wesley C. Cabotage. It includes 4 questions about linear programming and the simplex method. Question 1 defines linear programming as a mathematical method for finding the optimal solution to a linear problem by focusing on variables, objectives, and constraints. Question 2 discusses the importance of linear programming in fields like design, manufacturing, and public policy. Question 3 defines the simplex method as a standard technique for solving linear programming problems involving inequalities that form a polygonal region. Question 4 states that the simplex method investigates the feasible set's surrounding vertices to find where the objective function is optimized.

Uploaded by

Patricia Cruz
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 4

New Era University.

College of Accountancy
SCHOOL OF MANAGEMENT
No.9 Central Avenue, New Era, Quezon City 1107 Philippines
Tel. Nos. (632) 8981-4227/Fax: (632) 8981-4240
E mail add: accountancy@neu.edu.ph

Title of the Activity:


Assignment Nos. 5 Linear Programming

Submitted by: Submitted to:


Patricia Nicole Y. Cruz Prof. Mario Brillante Wesley C. Cabotage

Date Submitted: September 22, 2021

Section Schedule: 2BSA-4(TF-5:30-7:00 PM)


Please answer the following questions and submit on the deadline date.

1. What is linear programming?


Linear programming is a mathematical method for defining a linear problem's
solution. The aim of linear programming is usually to maximize or decrease a set of
objectives, such as profit or cost. The term "optimization" refers to this technique.
Variables, objectives, and constraints are the three principles that it is focused on.

As an example, a quantity of goods to be manufactured or whether a distribution facility


is open are examples of variables. The ideal value for such variables is determined using
linear programming. Optimization's variables determine an optimization's objectives, such
as the maximum profit. Constrained variables are defined by limiting the values that can
be returned by an optimization by using linear functions of the variables.

2. What is the importance of linear programming?


Because linear programming (LP) technology can consistently solve huge
problems, it was the first widely utilized method for digital computation optimization. It is
still one of the most crucial – seems to be perhaps hardly the most important – techniques
of optimization. Linear programming is widely used in a variety of fields, including design,
manufacturing, personnel planning, investment management, statistics, public health,
and national public policy, and many others.

In many cases, optimization, and in linear system programming, is a practical


technique to analyze and solve engineering problems. Problems that required a quick
solution could not be solved using optimization in the past, so ad hoc solution methods
were established that brought quick but sub-optimal results. Automatic control, for
example, was developed before digital processing and linear programming. Linear
programming, on the other hand, can solve some problems relatively quickly and is
increasingly replacing older methods in real-time applications.
3. What is simplex method?
The simplex method is a standard linear programming strategy for analyzing
optimization problems involving a functional and many restraints stated as inequalities.
The inequalities form a polygonal region, with the solution usually found at one of the
vertices. The simplex method is a method for systematically evaluating vertices as
possible solutions.
Optimization is a natural method to formulate and solve engineering dilemmas, and
linear programming in particularly in many cases. Because optimization could not handle
problems that required a quick solution in the past, ad hoc solution methods were
developed that produced quick but sub-optimal outcomes. Automatic control is an
example of a technology that came before digital computation and linear programming.
However, linear programming is replacing older methods in some real-time applications
because it can solve some problems relatively quickly.

4. What is the purpose of simplex method?


The simplex method is used to solve linear programming problems. It investigates
the feasible set's surrounding vertices in order to confirm that the objective function
develops or remains unchanged at each successive vertex. In general, the simplex
method is extremely powerful, taking just 2m to 3m iterations at most (m specifies the
range of equality constraints), and converges in polynomial time for specified random
input distributions.
Reference/s:
Anapedia. (n.d.). Retrieved from What is linear programming?:
https://help.anaplan.com/4b55d82a-2a50-4f7f-b53d-606dbb65860a-What-
islinear-programming
Marlin, T. (2002-2003). Linear Programming. (pp. 5-6). Hamilton, Ontario, Canada :
McMaster University. Retrieved from
https://learnche.org/wiki_4G3/images/5/54/4G3-Linear-Programming-
NotesThomas-Marlin.pdf
Techopedia. (n.d.). Retrieved from What Does Simplex Method Mean?:
https://www.techopedia.com/definition/22080/simplex-method
Wright, S. J. (2021, August 2). Britannica. Retrieved from simplex method:
https://www.britannica.com/topic/simplex-method

You might also like