Skip to Main Content
2 new and efficient methods of solution for the general non-linear programming problem: minimize F(x)=F(x1, x2,...xn) in the domain S:ai<;xi<;bi such that g(x)>;0, h(x)=0, have been implemented in the C.A.D. program ASTEC-3. As an illustration, we present the results we obtained in the D.C. operation optimization of a CMOS/SOS differential amplifier.
Date of Conference: 22-25 Sept. 1980