In this paper we consider min-max convex semi-infinite programming. To solve these problems we introduce a unified framework concerning Remez-type algorithms and integral methods coupled with penalty ...

In this paper, a modification of the bisection simplex method is made for more general purpose use. Organized in an alternative simpler form, the modified version exploits information of the optimal ...

Traditional programming paradigms force programmers to think one step at a time and combine the actual work done by an application, its program, with the order in which it runs, its logic or flow.

Mixed integer programming modeling for the satellite three-dimensional component assignment and layout optimization problem [J].