Nearness and Bound Relationships Between an Integer-Programming Problem and Its Relaxed Linear-Programming Problem

ISSN： 0022-3239

Source： Journal of Optimization Theory and Applications, Vol.98, Iss.1, 1998-07, pp. : 55-63

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

Distance confined path problem and separable integer programming

By Li D.

Optimization, Vol. 62, Iss. 4, 2013-04 ,pp. : 447-462

Taylor & Francis Ltd

Access to resources Recommend Favorite

Stability radius of an efficient solution of a vector problem of integer linear programming in the Gölder metric

By Emelichev V. Kuzmin K.

Cybernetics and Systems Analysis, Vol. 42, Iss. 4, 2006-07 ,pp. : 609-614

Springer Publishing Company

Access to resources Recommend Favorite

Branch-and-Bound Variant of an Outcome-Based Algorithm for Optimizing over the Efficient Set of a Bicriteria Linear Programming Problem

By Fülöp J. Muu L.D.

Journal of Optimization Theory and Applications, Vol. 105, Iss. 1, 2000-04 ,pp. : 37-54

Springer Publishing Company

Access to resources Recommend Favorite

Fuzzy mathematical programming for multi objective linear fractional programming problem

By Chakraborty M. Gupta S.

Fuzzy Sets and Systems, Vol. 125, Iss. 3, 2002-02 ,pp. : 335-342

Elsevier

Access to resources Recommend Favorite

On the fuzzy multi-objective linear programming problem: Goal programming approach

By Kuwano H.

Fuzzy Sets and Systems, Vol. 82, Iss. 1, 1996-08 ,pp. : 57-64

Elsevier

Access to resources Recommend Favorite