Hi,
If you have access to JMP 19.1 you can access some new functionality in a JSL function that allows you to generate random samples (candidate sets) that can be subject to linear constraints, variable bound constraints, and cardinality constraints on specified component group variables. The function is called Random Linearly Constrained Uniform. It is an extension of the function, Polytope Uniform Random, that has existed in JMP for a long time. (You can find the details of how to use it and some examples in the JMP object scripting index.) For your example, I can call the function with the following JSL:
Names Default To Here( 1 );
A = [1 1 1 1 1 1];
b = [1];
L = [.92 0 0 0 0 0 ];
U = [1 .04 .04 .04 .04 .01];
nwarm = 100;
nstride = 100;
tol = 1e-8;
// Index the constrained subgroups. Index = 0 is not in a constrained subgroup.
G = [0 1 1 1 1 1];
// Lower cardinality constraints for the constrained subgroups
LC = [1];
// Upper cardinality constraints for the constrained subgroups
UC = [2];
points = Random Linearly Constrained Uniform(
100,
A,
b,
L,
U,
1,
0,
0,
nwarm,
nstride,
tol,
G,
LC,
UC
);
dt = As Table( points );
This produces a candidate set of 100 runs that is saved to a table that looks like the following:

The Bayesian Optimization platform that is in JMP Pro 19 is really ideal for these types of problems. Check out the presentation that I gave with Kasia and Chris at Discovery to learn more: Bayesian Optimization for Formulations Involving Complex Constraints with JMP 19... - JMP User Commu....
I hope this helps.
Kind regards,
Laura