FAQFAQ   SearchSearch   MemberlistMemberlist   UsergroupsUsergroups 
 ProfileProfile   PreferencesPreferences   Log in to check your private messagesLog in to check your private messages   Log inLog in 
Forum index » Science and Technology » Math » num-analysis
LP problem conversion
Post new topic   Reply to topic Page 1 of 1 [2 Posts] View previous topic :: View next topic
Author Message
pepitosbarzeguti@katamail
science forum beginner


Joined: 22 Sep 2005
Posts: 3

PostPosted: Thu Jul 13, 2006 5:46 pm    Post subject: LP problem conversion Reply with quote

A need help for this LP problem (coming from kinematic theorem
structural analysis)
Ho to convert the problem:
T
minimize(-Fc u)

subject to:
T
Fv u = 1

-A u + N z = 0

z >= 0

Fc,Fv,u,z are vector's A and N are matrix.

to the standard LP format?

minimize( F=c0+c1 xm+1 .....+cn xm+n )

x1=a11 x[m+1] + ..............+ a1n x[m+n]
.......
xm=am1 x[m+1] + ..............+ amn x[m+n]

and bound variable's:

l1 <= x1 <= u1
.....
l(m+n) <= x[m+n] <= u(m+n)

Thank's in advance and sorry for the poor english
Back to top
Peter Spellucci
science forum Guru


Joined: 29 Apr 2005
Posts: 702

PostPosted: Fri Jul 14, 2006 2:10 pm    Post subject: Re: LP problem conversion Reply with quote

In article <1152812789.510709.110330@m73g2000cwd.googlegroups.com>,
"pepitosbarzeguti@katamail.com" <pepitosbarzeguti@katamail.com> writes:
Quote:
A need help for this LP problem (coming from kinematic theorem
structural analysis)
Ho to convert the problem:
T
minimize(-Fc u)

subject to:
T
Fv u = 1

-A u + N z = 0

z >= 0

Fc,Fv,u,z are vector's A and N are matrix.

to the standard LP format?

minimize( F=c0+c1 xm+1 .....+cn xm+n )

x1=a11 x[m+1] + ..............+ a1n x[m+n]
......
xm=am1 x[m+1] + ..............+ amn x[m+n]

and bound variable's:

l1 <= x1 <= u1
....
l(m+n) <= x[m+n] <= u(m+n)

Thank's in advance and sorry for the poor english


there is no need to transform the problem into this form and indeed your
explicit elimination occurs implicitly only in the simplex algorithm
LP software also does not require to have all variables bounded from below
or above.

you simply have
minimize c^T u + o*^T z = (c^T,o^T)*(u;z)
subject to
[ Fv^T o^T ] [ u ] = [1]
[ -A N ] [ z ] [0]

z>=0

unknowns x=[u;z]

only part of the unknowns restricted to be positive
matrix composed from a row Fv^T o^T and the matrix block row -A N
and z not appearing in the objective. this is already a rather standard LP
and could be solved by any reasonable LP solver
hth
peter
Back to top
Google

Back to top
Display posts from previous:   
Post new topic   Reply to topic Page 1 of 1 [2 Posts] View previous topic :: View next topic
The time now is Wed Jun 28, 2017 7:05 pm | All times are GMT
Forum index » Science and Technology » Math » num-analysis
Jump to:  

Similar Topics
Topic Author Forum Replies Last Post
No new posts Base Conversion - Negative Base Tapas Bose num-analysis 0 Tue Aug 03, 2010 8:47 pm
No new posts help on problem brb003 Math 0 Mon Aug 28, 2006 3:31 am
No new posts fraction problem mikerule Research 0 Thu Aug 24, 2006 5:10 am
No new posts Mod computer problem William Elliot Math 4 Fri Jul 21, 2006 12:07 pm
No new posts Divine apparitions in the tethered goat problem? jpalmour@gmail.com Math 6 Thu Jul 20, 2006 8:26 pm

Copyright © 2004-2005 DeniX Solutions SRL
Other DeniX Solutions sites: Electronics forum |  Medicine forum |  Unix/Linux blog |  Unix/Linux documentation |  Unix/Linux forums  |  send newsletters
 


Powered by phpBB © 2001, 2005 phpBB Group
[ Time: 0.0200s ][ Queries: 16 (0.0052s) ][ GZIP on - Debug on ]