A branch and cut algorithm is developed for solving 0-1 MINLP problems. The algorithm integrates Branch and Bound, Outer Approximation and Gomory Cutting Planes. Only the initial Mixed Integer Linear Programming (MILP) master problem is considered. At integer solutions Nonlinear Programming (NLP) problems are solved, using a primal-dual interior point algorithm. The objective and constraints ar...

After occurrence of some disturbances in power system that causes the sever imbalance between generation power and electrical load, the power system frequency begins to decrease. To prevent power system frequency instability and stop the frequency decay below the power system allowable frequency limitation, load shedding schemes should be utilized by applying under frequency load shedding relay...

The technical equipment developed and used in both installation and operation processes in refineries, oil and gas pipelines, and gas booster stations has always been expensive. Hence, managers at different organizational levels are keen to find methods to control and reduce these costs. Generally speaking, the operators in a gas booster station choose the operating devices without considering ...

In a number of situations the derivative of the objective function of an optimization problem is not available. This thesis presents a novel algorithm for solving mixed integer programs when this is the case. The algorithm is the first developed for problems of this type which uses a trust region methodology. Three implementations of the algorithm are developed and deterministic proofs of conve...

In this paper, we review recent advances in the distributional analysis of mixed integer linear programs with random objective coefficients. Suppose that the probability distribution of the objective coefficients is incompletely specified and characterized through partial moment information. Conic programming methods have been recently used to find distributionally robust bounds for the expecte...