Process synthesis often involves the solution of large nonlinear discretecontinuous optimization problems, which are usually formulated as mixedinteger nonlinear programming (MINLP) or generalized disjunctive programming (GDP) problems and solved with MINLP solvers. This paper presents an efficient solution method for these problems named successive relaxed MINLP (SR-MINLP), where the model for...

This paper presents a multiobjective continuous covering location problem in fuzzy environment. Because of uncertain covering radius, possibility of covering concept is introduced.Since, the uncertainty may cause risk of uncovering customers; the problemis formulated as a risk management model. The presented model is an extension of the discrete covering location models tocontinuous space. Two ...

in this study, a cross-docking system is designed at strategic and tactical levels. for making the strategic decisions, a multi-objective nonlinear location allocation model for cross-docks is presented based on a distri-bution location allocation model by andreas klose and andreas drexl. the model is further developed to in-clude the whole supply chain members and the objective functions are w...

The quadratic assignment problem (QAP) was first proposed by Koopmans and Beckman [5] in the context of the plant location problem. Given n facilities, represented by the set F f1 fn , and n locations represented by the set L l1 ln , one must determine to which location each facility must be assigned. Let An n ai j be a matrix where ai j represents the flow between facilities fi and f j. Let Bn...

The k-median problem is a well-known strongly NP-hard combinatorial optimization problem of both theoretical and practical significance. The previous best approximation ratio for this problem is 2.611+ǫ (Bryka et al. 2014) based on an (1, 1.95238219) bi-factor approximation algorithm for the classical facility location problem (FLP). This work offers an improved algorithm with an approximation ...

Mechanism design studies how to design mechanisms that result in good outcomes even when agents strategically report their preferences. In traditional settings, it is assumed that a mechanism can enforce payments to give an incentive for agents to act honestly. In many Internet application domains, however, introducing monetary transfers is impossible or undesirable. Also, in such highly anonym...

This paper proposes a method to simplify a computational model from logistic regression for clinical use without computer. The model was built using human interpreted featrues including some BI-RADS standardized features for diagnosing the malignant masses. It was compared with the diagnosis using only assessment categorization from BI-RADS. The research aims at assisting radiologists to diagno...

I. A Brief History of Optimization Research: The history of optimization of realvalued non-linear functions (including linear ones), unconstrained or constrained, goes back to Gottfried Leibniz, Isaac Newton, Leonhard Euler and Joseph Lagrange. However, those mathematicians often assumed differentiability of the optimand as well as constraint functions. Moreover, they often dealt with the equal...

This paper is a counterpart of [2]. Specifically, for a locally optimal solution to the nonlinear second-order cone programming (SOCP), under Robinson’s constraint qualification, we establish the equivalence among the following three conditions: the nonsingularity of Clarke’s Jacobian of Fischer-Burmeister (FB) nonsmooth system for the Karush-Kuhn-Tucker conditions, the strong second-order suff...