Asymptotic sign-solvability, multiple objective linear programming, and the nonsubstitution theorem

ISSN： 1432-2994

Source： Mathematical Methods of Operations Research, Vol.64, Iss.3, 2006-12, pp. : 541-555

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

On a fuzzy set approach to solving multiple objective linear fractional programming problem

By Stancu-Minasian I.M. Pop B.

Fuzzy Sets and Systems, Vol. 134, Iss. 3, 2003-03 ,pp. : 397-405

Elsevier

Access to resources Recommend Favorite

Further Analysis of an Outcome Set-Based Algorithm for Multiple-Objective Linear Programming

By Benson H.P.

Journal of Optimization Theory and Applications, Vol. 97, Iss. 1, 1998-04 ,pp. : 1-10

Springer Publishing Company

Access to resources Recommend Favorite

Sign consistent linear programming problems

By Garcia-Esnaola M. Pena J. M.

Optimization, Vol. 58, Iss. 8, 2009-11 ,pp. : 935-946

Taylor & Francis Ltd

Access to resources Recommend Favorite

The fundamental theorem of linear programming: extensions and applications

By Tardella F.

Optimization, Vol. 60, Iss. 1-2, 2011-01 ,pp. : 283-301

Taylor & Francis Ltd

Access to resources Recommend Favorite

The duality theorem of linear programming: an intuitive approach

By Zaverdinos C.

International Journal of Mathematical Education in Science and Technology, Vol. 31, Iss. 3, 2000-05 ,pp. : 473-475

Taylor & Francis Ltd

Access to resources Recommend Favorite