Polynomial algorithms for projecting a point onto a region defined by a linear constraint and box constraints in .

Stefanov, Stefan M.

Displaying similar documents to “Polynomial algorithms for projecting a point onto a region defined by a linear constraint and box constraints in $ℝ^{n}$ .”

Convex separable minimization problems with a linear constraint and bounded variables.

Stefanov, Stefan M. (2005)

International Journal of Mathematics and Mathematical Sciences

Similarity:

An efficient method for minimizing a convex separable logarithmic function subject to a convex inequality constraint or linear equality constraint.

Stefanov, Stefan M. (2006)

Journal of Applied Mathematics and Decision Sciences

Similarity:

A service points location problem with Min-Max distance optimality criterion

Oto Hudec, Karel Zimmermann (1993)

Acta Universitatis Carolinae. Mathematica et Physica

Similarity:

The Benders method and parametrization of the right-hand sides in the mixed integer linear programming problem

Jaroslav Hrouda (1976)

Aplikace matematiky

Similarity:

A Modified Step-Length Algorithm in Nonlinear Programming

Nada I. Žuranović-Miličić (2000)

The Yugoslav Journal of Operations Research

Similarity:

A new global optimization algorithm for solving generalized geometric programming.

Liu, San-Yang, Wang, Chun-Feng, Liu, Li-Xia (2010)

Mathematical Problems in Engineering

Similarity:

A Projection Method for Linearly Constrained Problems Which Only Uses Function Values

Nada I. Đuranović-Miličić (1991)

The Yugoslav Journal of Operations Research

Similarity:

Heuristic Algorithm for Single Resource Constrained Project Scheduling Problem Based on the Dynamic Programming

Ivan Stanimirović, Marko Petković, Predrag Stanimirović, Miroslav Ćirić (2009)

The Yugoslav Journal of Operations Research

Similarity:

An algorithm for multiparametric min max 0-1-integer programming problems relative to the objective function

José Luis Quintero, Alejandro Crema (2005)

RAIRO - Operations Research - Recherche Opérationnelle

Similarity:

The multiparametric min max 0-1-Integer Programming (0-1-IP) problem relative to the objective function is a family of min max 0-1-IP problems which are related by having identical constraint matrix and right-hand-side vector. In this paper we present an algorithm to perform a complete multiparametric analysis relative to the objective function.

Managing cost uncertainties in transportation and assignment problems.

Adlakha, V., Arsham, H. (1998)

Journal of Applied Mathematics and Decision Sciences

Similarity:

Displaying similar documents to “Polynomial algorithms for projecting a point onto a region defined by a linear constraint and box constraints in ℝ n .”

Displaying similar documents to “Polynomial algorithms for projecting a point onto a region defined by a linear constraint and box constraints in $ℝ^{n}$ .”