Add to ORKGIn this paper a new approach for obtaining an approximation global optimum solution of zero-one nonlinear programming (0-1 NP) problem which we call it Parametric Linearization Approach (P.L.A) is proposed. By using this approach the problem is transformed to a sequence of linear programming problems. The ap-proximately solution of the original 0-1 NP problem is obtained based on the optimum values of the objec-tive functions of this sequence of linear programming problems defined by (P.L.A)
AbstractBy using the theory of parametric semi-infinite programming, we show that the solution of a ...
To formulate a real-world optimization problem, it is sometimes necessary to adopt a set of non-line...
This paper describes a new technique to find the minimum norm solution of a linear program. The main...
In this paper, we present an effective algorithm for globally solving quadratic programs with quadra...
An algorithm is described for determining the optimal solution of parametric linear and quadratic pr...
Necessary and sufficient conditions for minimizing an $l_1 $-norm type of objective function are der...
Lecture Notes in Computer Science book series (LNCS, volume 11653)In a (linear) parametric optimizat...
We consider a linear programming problem, with two parameters in the objective function, and present...
The paper presents a new method for solving the 0–1 linear programming problems (LPs). The general 0...
The paper presents a new method for solving the 0–1 linear programming problems (LPs). The general 0...
The aim of this paper is to study a certain class of nonlinear optimization problems of particular i...
Programming is defined as the planning of activities for the sake of optimization. When linear const...
AbstractA maximization problem with linear inequality constraints and different kinds of nonconcave ...
Many classes of mathematical programming problems can be formulated as a linear program with a param...
Linear programming (LP) is one of the most widely-applied techniques in operations research. Many me...
AbstractBy using the theory of parametric semi-infinite programming, we show that the solution of a ...
To formulate a real-world optimization problem, it is sometimes necessary to adopt a set of non-line...
This paper describes a new technique to find the minimum norm solution of a linear program. The main...
In this paper, we present an effective algorithm for globally solving quadratic programs with quadra...
An algorithm is described for determining the optimal solution of parametric linear and quadratic pr...
Necessary and sufficient conditions for minimizing an $l_1 $-norm type of objective function are der...
Lecture Notes in Computer Science book series (LNCS, volume 11653)In a (linear) parametric optimizat...
We consider a linear programming problem, with two parameters in the objective function, and present...
The paper presents a new method for solving the 0–1 linear programming problems (LPs). The general 0...
The paper presents a new method for solving the 0–1 linear programming problems (LPs). The general 0...
The aim of this paper is to study a certain class of nonlinear optimization problems of particular i...
Programming is defined as the planning of activities for the sake of optimization. When linear const...
AbstractA maximization problem with linear inequality constraints and different kinds of nonconcave ...
Many classes of mathematical programming problems can be formulated as a linear program with a param...
Linear programming (LP) is one of the most widely-applied techniques in operations research. Many me...
AbstractBy using the theory of parametric semi-infinite programming, we show that the solution of a ...
To formulate a real-world optimization problem, it is sometimes necessary to adopt a set of non-line...
This paper describes a new technique to find the minimum norm solution of a linear program. The main...