Rank: 381172 based on 0 downloads (last 30 days) and 0 file submitted
photo

Deepanshu Vasal

E-mail

Personal Profile:
Professional Interests:

 

Watch this Author's files

 

Comments and Ratings by Deepanshu View all
Updated File Comments Rating
09 Apr 2012 Representing Polyhedral Convex Hulls by Vertices or (In)Equalities Express bounded polyhedron via equalities/inequalities or vertices. Author: Matt J

15 Feb 2012 Representing Polyhedral Convex Hulls by Vertices or (In)Equalities Express bounded polyhedron via equalities/inequalities or vertices. Author: Matt J

Matt, Thanks for your reply. Having equality constraint was not the problem. If I take
A = - [
0 0 0 0 0 1 -2 1 ;
0 0 1 -2 1 0 0 0 ;
eye(8);
-eye(8)];
and
b = - [zeros(2,1); -10*ones(16,1)];

it does not work but if I reduce redundant dimensions and put

A = - [
0 0 0 1 -2 1 ;
1 -2 1 0 0 0 ;
eye(6);
-eye(6)];
and
b = - [zeros(2,1); -10*ones(12,1)];

it works.

but I used lrs package at http://cgm.cs.mcgill.ca/~avis/C/lrs.html

and I got vertices for my problem.

Anyway I appreciate your effort and your such timely response. good luck

Deepanshu

13 Feb 2012 Representing Polyhedral Convex Hulls by Vertices or (In)Equalities Express bounded polyhedron via equalities/inequalities or vertices. Author: Matt J

Hi Matt,

I am trying to use your code with my dataset, but I am getting singular matrix warning with the vertices generated are out of bounds (Nan, inf).
My data set is as follows :-

A = - [

0 1 0 -2 0 1 0 0 ;
0 0 0 0 0 1 -2 1 ;
0 0 1 -2 1 0 0 0 ;

-1 1 1 -1 0 0 0 0 ;
0 0 0 -1 1 1 -1 0 ;


0 0 0 1 -1 0 -1 1 ;
1 -1 0 -1 1 0 0 0 ;
0 0 1 -1 0 -1 1 0 ;
eye(8);
-eye(8)];

b = - [zeros(8,1); -10*ones(16,1)];

is there something that cannot be handled by this code? I see that the initial point taken is fine (satisfies the constraints.) but cannot figure out where is the problem in the code.
If you come across any problem, please let me know. Also do you know the reference for the algorithm used in this code?

Thanks so much.
Deepanshu
Thanks so much
Deepanshu

13 Feb 2012 CON2VERT - constraints to vertices Convert convex constraint inequalities into a set of vertices; i.e., polygon "vertex enumeration." Author: Michael Kleder

Can you give the reference for the algorithm used

Thanks

Contact us