Continuous Reformulations for Zero–One Programming Problems
نویسندگان
چکیده
منابع مشابه
Continuous Reformulations for Zero-one Programming Problems
In this work, we study continuous reformulations of zero–one programming problems. We prove that, under suitable conditions, the optimal solutions of a zero–one programming problem can be obtained by solving a specific continuous problem.
متن کاملContinuous Reformulations of Discrete-Continuous Optimization Problems
This paper treats the solution of nonlinear optimization problems involving discrete decision variables, also known as generalized disjunctive programming (GDP) or mixed-integer nonlinear programming (MINLP) problems, that arise in process engineering. The key idea is to eliminate the discrete decision variables by adding a set of continuous variables and constraints that represent the discrete...
متن کاملReformulations in Mathematical Programming: Definitions
The mathematical programming formulation language is a very powerful tool used to formalize optimization problems by means of parameters, decision variables, objective functions and constraints. Such diverse settings as combinatorial, integer, continuous, linear and nonlinear optimization problems can be defined precisely by their corresponding mathematical programming formulations. Its power i...
متن کاملNew reformulations for stochastic nonlinear complementarity problems
We consider the stochastic nonlinear complementarity problem (SNCP). We first formulate the problem as a stochastic mathematical program with equilibrium constraints and then, in order to develop efficient algorithms, we give some reformulations of the problem. Furthermore, based on the reformulations, we propose a smoothed penalty method for solving SNCP. A rigorous convergence analysis is als...
متن کاملA goal programming approach for fuzzy flexible linear programming problems
We are concerned with solving Fuzzy Flexible Linear Programming (FFLP) problems. Even though, this model is very practical and is useful for many applications, but there are only a few methods for its situation. In most approaches proposed in the literature, the solution process needs at least, two phases where each phase needs to solve a linear programming problem. Here, we propose a method t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Optimization Theory and Applications
سال: 2011
ISSN: 0022-3239,1573-2878
DOI: 10.1007/s10957-011-9935-y