Knapsack feasibility as an absolute value equation solvable by successive linear programming

ISSN： 1862-4472

Source： Optimization Letters, Vol.3, Iss.2, 2009-03, pp. : 161-170

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

Linear complementarity as absolute value equation solution

By Mangasarian Olvi

Optimization Letters, Vol. 8, Iss. 4, 2014-04 ,pp. : 1529-1534

Springer Publishing Company

Access to resources Recommend Favorite

Absolute value programming

By Mangasarian O.

Computational Optimization and Applications, Vol. 36, Iss. 1, 2007-01 ,pp. : 43-53

Springer Publishing Company

Access to resources Recommend Favorite

On fractional programming problems with absolute-value functions

By Soleimani-damaneh M.

International Journal of Computer Mathematics, Vol. 88, Iss. 4, 2011-03 ,pp. : 661-664

Taylor & Francis Ltd

Access to resources Recommend Favorite

A successive linear programming algorithm for nonsmooth monotone variational inequalities

By Bigi Giancarlo Panicucci Barbara

Optimization Methods and Software, Vol. 25, Iss. 1, 2010-02 ,pp. : 29-35

Taylor & Francis Ltd

Access to resources Recommend Favorite

Probabilistic analysis of a differential equation for linear programming

By Ben-Hur A. Feinberg J. Fishman S. Siegelmann H.T.

Journal of Complexity, Vol. 19, Iss. 4, 2003-08 ,pp. : 474-510

Elsevier

Access to resources Recommend Favorite