BcaStudy
OPTIMIZATION TECHNIQUES

UNIT-I Linear Programming

linear programming is a technique that helps us to find the optimum solution for a given problem, an optimum solution is a solution that is the best possible outcome of a given particular problem.

In simple terms, it is the method to find out how to do something in the best possible way with given limited resources you need to do the optimum utilization of resources to achieve the best possible result in a particular objective programming problems. A linear programming problem has two basic parts:

  • First Part: It is the objective function that describes the primary purpose of the formation to maximize some return or to minimize some.
  • Second Part: It is a constant set, It is the system of equalities or inequalities which describe the condition or constraints of the restriction under which Optimisation is to be accomplished.

Types of Linear Programming Problems

Basically, there are many different linear programming problems but we will deal with three major linear programming problems in this article.

  1. Manufacturing Problems: Manufacturing problems are a problem that deals with the number of units that should be produced or sold in order to maximize profits when each product requires fixed manpower, machine hours, and raw materials.
  2. Diet Problems: It is used to calculate the number of different kinds of constituents to be included in the diet in order to get the minimizing of cost and subject to the availability of food and their prices.
  3. Transportation Problems: It is used to determine the transportation schedule to find the cheapest way of transporting a product from plants /factories situated at different locations to different markets.

Uploading soon...

Comments

Comments take few seconds to update

Resource to learn

C
C++
java
Html
Css
Javascript
Message
If you want your notes and pdf on website send me google drive link