A linear approximation method for solving a special class of the chance constrained programming problem

Publisher： Elsevier

ISSN： 0377-2217

Source： European Journal of Operational Research, Vol.80, Iss.1, 1995-01, pp. : 213-225

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

Solving the multiobjective possibilistic linear programming problem

By Arenas Parra M. Bilbao Terol A. Rodrguez Ura M.V.

European Journal of Operational Research, Vol. 117, Iss. 1, 1999-08 ,pp. : 175-182

Elsevier

Access to resources Recommend Favorite

Application of chance-constrained programming based on multi-objective simulated annealing to solve a mineral blending problem

By Kumral Mustafa

Engineering Optimization, Vol. 35, Iss. 6, 2003-12 ,pp. : 661-673

Taylor & Francis Ltd

Access to resources Recommend Favorite

The balanced linear programming problem

By Ahuja R.K.

European Journal of Operational Research, Vol. 101, Iss. 1, 1997-08 ,pp. : 29-38

Elsevier

Access to resources Recommend Favorite

An objective hyperplane search procedure for solving the general all-integer linear programming (ILP) problem

By Joseph A. Gass S.I. Bryson N.

European Journal of Operational Research, Vol. 104, Iss. 3, 1998-02 ,pp. : 601-614

Elsevier

Access to resources Recommend Favorite

A tractable approximation of non-convex chance constrained optimization with non-Gaussian uncertainties

Engineering Optimization, Vol. 47, Iss. 4, 2015-04 ,pp. : 495-520

Taylor & Francis Ltd

Access to resources Recommend Favorite