The Ill-post problem on a VLSI Design namely area-time optimal VLSI Integer multiplier with minimum computation time can be regarded as a weber problem. The elementary results with extension leading to the classical problem on VLSI integer multiplier can be posed and settled in affirmative.