Scribd
Upload
62 views2 pages

Q Simplex Method: Assignment Problem

Linear programming is a mathematical modeling technique for allocating limited resources to competing activities to optimize an objective function subject to constraints. It involves three key principles: proportionality, where each variable's contribution is directly proportional to its value; additivity, where the total objective or constraint value is the sum of individual variable contributions; and certainty, where all coefficients are deterministic. The simplex method is an iterative procedure for solving linear programs by improving the solution at each step until no further improvement is possible. Assignment problems involve allocating jobs to workers or tasks to agents in a way that optimizes an objective like processing time or efficiency. Transportation problems deal with selecting optimal routes for distributing products from suppliers to warehouses or customers while minimizing costs or maximizing

Uploaded by

tej
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
62 views2 pages

Q Simplex Method: Assignment Problem

Linear programming is a mathematical modeling technique for allocating limited resources to competing activities to optimize an objective function subject to constraints. It involves three key principles: proportionality, where each variable's contribution is directly proportional to its value; additivity, where the total objective or constraint value is the sum of individual variable contributions; and certainty, where all coefficients are deterministic. The simplex method is an iterative procedure for solving linear programs by improving the solution at each step until no further improvement is possible. Assignment problems involve allocating jobs to workers or tasks to agents in a way that optimizes an objective like processing time or efficiency. Transportation problems deal with selecting optimal routes for distributing products from suppliers to warehouses or customers while minimizing costs or maximizing

Uploaded by

tej
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

Q simplex method

Simplex method is an iterative procedure that allows to improve the solution at each step.
This procedure is finished when isn't possible to improve the solution.

Simplex method is based on the following property: if objective function, F, doesn't take the
max value in the A vertex, then there is an edge starting at A, along which the value of the
function grows.

Q linear programming
Linear Programming (LP) is a mathematical modelling technique useful for allocation of limited
resources such as material, machines etc to several competing activities such as projects,
services etc. A typical linear programming problem consists of a linear objective function which
is to be maximized or minimized subject to a finite number of linear constraints.

 Proportionality: the contribution of each decision variable is directly proportional to its


value in both the objective function and in the constraints. For example, the contribution of

the first decision variable in the first constraint is . This is directly proportional

to with 6 as the constant of proportionality. Roughly speaking, the rule of three is


followed.

 Additivity: the contribution of all the variables in the objective function and the constraints
to be the sum of the individual contributions of each variable. For example, the total profit
is which is the sum of the individual profits and

 Certainty: all the objective and constraint coefficients are deterministic, that is all the data
about profit, availability and requirements is constant.

Q Assignment Problem:
1) Assignment means allocating various jobs to various people in the organization. Assignment
should be done in such a way that the overall processing time is less, overall efficiency is high,
overall productivity is high, etc.

2) We solve an assignment problem by using two methods.

(a) Completer enumeration method.

(b) Hungarian method

3)In an assignment problem only one allocation can be made in particular row or a column
4)In assignment problem management aims at assignment jobs to various people.

5)When no. of jobs is not equal to no. of workers, it is a unbalanced problem

Q Transportation Problem:
1) A transportation problem is concerned with transportation method or selecting routes in a
product distribution network among the manufacture plant and distribution warehouse
situated in different regions or local outlets.

2)We use three methods for solving a transportation problem1 i.e., to find IBFS :

(a) VAM (b) NWCR (c) LCM

Thereafter we find the optimum solution by using the MODI method and stepping- stone
method.

3)A transportation problem is not subject to any such restrictions. Such restriction are peculiar
to assignment problems only. Many allocations can be done in a particular row or particular
column.

4)In transportation method, management is searching for a distribution route, which can lead
to minimization of cost and maximization of profit.

5)When the total demand is not equal to total supply it is unbalanced problem.

Q or define

O.R. is a scientific approach to problem solving for management.


Control
Better Decision Making
Better Coordination,
Increased Productivity

You might also like