17] E. Morreale. Recursive operators for prime implicant and irredundant normal form determination. A calculus and an algorithm for the multiple-output 2-level minimization problem. A new method for solving large Satissability problems. A new algorithm for generating prime implicants. 7] J.F. Gimpel. A method of producing a boolean function having an arbitrarily prescribed prime implicant table...

The problem of linear programming (LP) is one of the earliest formulated problems in mathematical programming where a linear function has to be maximized (minimized) over a convex constraint polyhedron X. The simplex algorithm was early suggested for solving this problem by moving toward a solution on the exterior of the constraint polyhedron X. In 1984, the area of linear programming underwent...

Recently Karmarkar proposed a potential reduction algorithm for binary feasibility problems. In this paper we point out a practical drawback of his potential function and we propose a modi ed potential function that is computationally more attractive. As the main result of the paper, we will consider a special class of binary feasibility problems, and show how problems of this class can be refo...

Yun-Chian Cheng, David J. Houck, JunMin L1u, Marc S. Meketon, Lev Slutsman, and Pyng Wang are in the Advanced Decision Support Systems Department at AT&T Bell Laboratories in Holmdel, New Jersey. Robert J. Vanderbei is a member of technical staff in the Mathematics of Networks and Systems Department at A'T&T Bell Laboratories in Murray Hill, New Jersey. Mr. Cheng joined the company in 1985 and ...

We obtain solutions of the time-dependent Einstein Field Equations which satisfy Karmarkar condition via method Lie symmetries. Spherically symmetric spacetime metrics are used with metric functions set to impose conformal flatness, Weyl-free collapse and shear-free collapse. In particular, a solution was found satisfies heat-flux boundary Santos, radiating stellar model then obtained investiga...