An efficient simplex type algorithm for sparse and dense linear programs

Author： Paparrizos K. Samaras N. Stephanides G.

Publisher： Elsevier

ISSN： 0377-2217

Source： European Journal of Operational Research, Vol.148, Iss.2, 2003-07, pp. : 323-334

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

Development of an efficient algorithm for global optimization by simplex elimination

By Oh Seung Hwan Lee Byung Chai

Engineering Optimization, Vol. 35, Iss. 6, 2003-12 ,pp. : 607-625

Taylor & Francis Ltd

Access to resources Recommend Favorite

A reduction algorithm for integer multiple objective linear programs

By Schweigert D. Neumayer P.

European Journal of Operational Research, Vol. 99, Iss. 2, 1997-06 ,pp. : 459-462

Elsevier

Access to resources Recommend Favorite

An efficient Sequential Linear Programming algorithm for engineering optimization

By Lamberti L. Pappalettere C.

Journal of Engineering Design, Vol. 16, Iss. 3, 2005-06 ,pp. : 353-371

Taylor & Francis Ltd

Access to resources Recommend Favorite

An efficient linear programming algorithm for combined heat and power production

By Lahdelma R. Hakonen H.

European Journal of Operational Research, Vol. 148, Iss. 1, 2003-07 ,pp. : 141-151

Elsevier

Access to resources Recommend Favorite

A combined constraint-space, objective-space approach for determining high-dimensional maximal efficient faces of multiple objective linear programs

By Dauer J.P. Gallagher R.J.

European Journal of Operational Research, Vol. 88, Iss. 2, 1996-01 ,pp. : 368-381

Elsevier

Access to resources Recommend Favorite