c


Vp Mónica Montejano A01151450

Vp Alejandra López Tolentino A01150670
Vp îosé Francisco Santos A00289086
Vp ¦arlos Pedroza A01151954

Ô

 February 11, 2011



  



George B. Dantzig is also known as the father of Linear Programming and the creator of a mathematical
model of the general linear programming problem called the simplex method. He proposed that
interrelations between activities of a large organization can be viewed as a LP model and that the
optimal program (solution) can be obtained by minimizing a (single) linear objective function.

The simplex method is based on a fundamental theorem, also known as the ͞Extreme Point Theorem͟,
which follows:

͞Î

 


 
 






 







 






















The simplex method provides an efficient systematic search guaranteed to converge in a finite number
of steps.

There are 4 basic steps to work with the simplex method:

ñ p Begin the search at an extreme point (i.e., a basic feasible solution).

a p Determine if the movement to an adjacent extreme can improve on the optimization of the
objective function. If not, the current solution is optimal. If, however, improvement is possible,
then proceed to the next step.
ü p Move to the adjacent extreme point which offers (or, perhaps,  to offer) the most
improvement in the objective function.
 p ¦ontinue steps 2 and 3 until the optimal solution is found or it can be shown that the problem is
either unbounded or infeasible.

It is important to consider that this method only deals with equalities and it compares constraint
conversions with goal conversions using deviation variables.

There are 2 main limitations of the simplex method:

ñ p Inability to deal with multiple objectives

a p Inability to handle problems with integer variables
 
 

cÔcc c Ô c

Ae observe that the Aircraft Landing Problem involves two decision problems: (1) a sequencing problem
(which determines the sequence of plane landings) and (2) a scheduling decision problem (which
determines the precise landing times for each plane in the sequence, subject to the separation
constraints).
Ae observe that 
we are given the sequence in which planes land, then we can develop an algorithm
for resolving the scheduling decisions. In this section, we show how the simplex algorithm can be
specialized to the problem of finding the optimal landing times of all planes given a partial ordering of
the planes. The algorithm described in this section is used later in a heuristic approach. It is also used to
calculate lower bounds that are then embedded in a branch-and-bound algorithm to find an optimal
solution.






!



 "  # 



  
$
 "
% 

The modified simplex method (MSM) has been applied, to determine compounds by a luminescence
technique. The method was based on the optimization of chemical and instrumental variables affecting
phosphorescence using a geometric simplex in two and three dimensions of space, respectively. As
application, we have determined a novel antihypertensive drug, naftopidil, in urine and serum, by heavy
atom induced room temperature phosphorescence (HAI-RTP); this technique enables us to determine
analytes in complex matrices, biological fluids, without the need for a tedious prior separation process.
Aith the proposed method, the maximum signal of phosphorescence appears instantly once the sample
has been prepared and the intensity was measured at †ex=287 nm and †em=525 nm. Overall least-
squares regression was used to find the straight line that fitted the experimental data. The detection
limit, as well as the repeatability and the standard deviation (S.D.) for replicate sample, were also
determined.

 

Ainston, Aayne L.. 







. 4th. 2005.

Arreola, îesús S. 

 2003, México.

Andreas T. Ernst, Mohan Krishnamoorthy, Robert H. Storer. Heuristic and Exact Algorithms for
Scheduling Aircraft Landings. 1998, Australia.

î. A. Murillo Pulgarín, A. Alañón Molina and M. T. Alañón Pardo. Department of Analytical ¦hemistry and
Foods Technology, University of ¦astilla-La Mancha, 13071, ¦iudad Real, Spain, 2002.