Scribd
Upload
16 views

Assignment No.5 Linear Programming

Uploaded by

Thalia Pedrina
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
16 views

Assignment No.5 Linear Programming

Uploaded by

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

Pedrina, Thalia Nicole N.

2BSA-4

Assignment Nos. 5 Linear Programming

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

1. What is linear programming?

Linear programming is an optimization technique for a system of linear constraints and a


linear objective function. An objective function defines the quantity to be optimized, and
the goal of linear programming is to find the values of the variables that maximize or
minimize the objective function.

2. What is the importance of linear programming?

Linear programming is useful for many problems that require an optimization of


resources. It could be applied to manufacturing, to calculate how to assign labor and
machinery to minimize cost of operations. It could be applied in high-level business
operations, to decide which products to sell and in what quantity in order to maximize
profit. It could also be applied in logistics, to decide how to apply resources to get a job
done in the minimum amount of time.

3. What is simplex method?

Simplex method, standard technique in linear programming for solving


an optimization problem, typically one involving a function and several constraints
expressed as inequalities. The inequalities define a polygonal region, and the solution is
typically at one of the vertices. The simplex method is a systematic procedure for testing
the vertices as possible solutions

4. What is the purpose of simplex method?

The simplex method is used to eradicate the issues in linear programming. It examines
the feasible set's adjacent vertices in sequence to ensure that, at every new vertex, the
objective function increases or is unaffected. It also able to evaluate whether no solution
actually exists. It can be observed that the algorithm is greedy as it opts for the best
option at every iteration, with no demand for information from earlier or forthcoming
iterations.

You might also like