What is the optimal way to cut a convex bounded domain K in Euclidean space (R-n, vertical bar . vertical bar) into two halves of equal volume, so that the interface between the two halves has least surface area? A conjecture of Kannan, Lovasz and Simonovits asserts that, if one does not mind gaining a universal numerical factor (independent of n) in the surface area, one might as well dissect K using a hyperplane. This conjectured essential equivalence between the former nonlinear isoperimetric inequality and its latter linear relaxation, has been shown over the last two decades to be of fundamental importance to the understanding of volume-concentration and spectral properties of convex domains. In this work, we address the conjecture for the subclass of generalized Orlicz balls K = {x is an element of R-n; Sigma(n)(i=1) V-i(xi) <= E}, confirming its validity for certain levels E is an element of R under a mild technical assumption on the growth of the convex functions V-i at infinity [without which we confirm the conjecture up to a log(1 + n) factor]. In sharp contrast to previous approaches for tackling the KLS conjecture, we emphasize that no symmetry is required from K. This significantly enlarges the subclass of convex bodies for which the conjecture is confirmed.