Learn how to solve problems using linear programming. A linear programming problem involves finding the maximum or minimum value of an equation, called the objective functions, subject to a system of ...

Integer programming, a cornerstone of combinatorial optimisation, focuses on the selection of discrete decision variables to solve complex real‐world problems such as scheduling, network design and ...

This work proposes a multiperiod mixed-integer nonlinear programming (MINLP) model to optimize the complex operations of CO 2 buffering in tanks, transport through pipe networks, and storage in ...

Department of Chemical Engineering, Indian Institute of Technology, Bombay, Mumbai 400076, India Article Views are the COUNTER-compliant sum of full text article downloads since November 2008 (both ...

ABSTRACT: In this paper a new approach for obtaining an approximation global optimum solution of zero-one nonlinear programming (0-1 NP) problem which we call it Parametric Linearization Approach (P.L ...

ABSTRACT: We propose an exact penalty approach for solving mixed integer nonlinear programming (MINLP) problems by converting a general MINLP problem to a finite sequence of nonlinear programming (NLP ...

Abstract: The minimal consistent subset selection is a solution of high computational demands problem of the nearest neighbor decision system. This paper presents a new approach that aims to make the ...

Abstract: In this paper, we propose a genetic algorithm for nonlinear integer programming problems as an extension of genetic algorithms with double strings proposed for linear integer programming ...