The present paper describes new algorithm for the optimization problem under the condition of constraint. The algorithms on the following concept are referred collectively to as constructive algorithms (CAs). Two types of chromosomes are introduced in these algorithms. One is called the main chromosome and the other the subchromosome. The condition of constraint is always satisfied with the genome on the main chromosome. The subchromosome controls the transformation of the genes on the main chromosome in the surrounding environment. The genetic algorithms (GAs) are applied only to the subchromosomes. Finally, the main chromosome acquires the required functions for optimization. To demonstrate the effectiveness of the proposed new algorithm, the algorithm is applied to the design problem of the strongest column.