Search Results - Nonlinear programming Cutting plane algorithms Sequential linear programming

A linear programming-based optimization algorithm for solving nonlinear programming problems by Still, Claus, Westerlund, Tapio

“…In this paper a linear programming-based optimization algorithm called the Sequential Cutting Plane algorithm is presented…”
Get full text

Solving Convex MINLP Optimization Problems Using a Sequential Cutting Plane Algorithm by Still, Claus, Westerlund, Tapio

“… A Sequential Cutting Plane (SCP) algorithm is used for solving the nonlinear programming problems by solving a sequence of linear programming problems…”
Get full text

A sequential cutting plane algorithm for solving convex NLP problems by Still, Claus, Westerlund, Tapio

“… than Kelley’s cutting plane algorithm and also competitive with existing nonlinear programming algorithms…”
Get full text

An algorithm based on semidefinite programming for finding minimax optimal designs by Duarte, Belmiro P.M., Sagnol, Guillaume, Wong, Weng Kee

“…An algorithm based on a delayed constraint generation method for solving semi-infinite programs for constructing minimax optimal designs for nonlinear models is proposed…”
Get full text

Retrospective on optimization by Biegler, Lorenz T., Grossmann, Ignacio E.

“… in process systems engineering. We then provide a review of solution methods of the major types of optimization problems for continuous and discrete variable optimization, particularly nonlinear and mixed-integer nonlinear programming (MINLP…”
Get full text

Global optimization of general nonconvex problems with intermediate polynomial substructures by Zorn, Keith, Sahinidis, Nikolaos V.

“… These cutting plane strategies simultaneously convexify linear and nonlinear terms from multiple constraints and are highly effective at tightening standard linear programming relaxations generated…”
Get full text

A new Lagrangian decomposition approach applied to the integration of refinery planning and crude-oil scheduling by Mouret, Sylvain, Grossmann, Ignacio E., Pestiaux, Pierre

“…► Novel approach for integrating crude-oil scheduling and refinery planning. ► Hybrid Lagrangian decomposition scheme that combines cutting planes and subgradients…”
Get full text

Integer Programming by Rao, Singiresu S

“… Among the several techniques available for solving the all‐integer and mixed‐integer linear programming problems, the cutting plane algorithm of Gomory and the branch…”
Get full text

Combined bound-grid-factor constraints for enhancing RLT relaxations for polynomial programs by Sherali, Hanif D., Dalkiran, Evrim

“…)-based linear programming (LP) relaxations. We introduce a new class of bound-grid-factor constraints that can be judiciously used to augment the basic RLT relaxations in order to improve the quality of lower bounds and enhance the performance…”
Get full text

Integer Programming by Rao, Singiresu S.

“…This chapter contains sections titled: Introduction Graphical Representation Gomory's Cutting Plane Method Balas' Algorithm for Zero…”
Get full text

Decision Rule Approaches for Pessimistic Bilevel Linear Programs under Moment Ambiguity with Facility Location Applications by Goyal, Akshit, Zhang, Yiling, He, Chuan

“…We study a pessimistic stochastic bilevel program in the context of sequential two-player games, where the leader makes a binary here-and-now decision, and the follower responds a continuous wait…”
Get full text

A simple Newton method for local nonsmooth optimization by Lewis, Adrian, Wylie, Calvin

“… Even in the convex case, the subgradient method is very slow, and while some cutting plane algorithms, including traditional bundle methods, are popular in practice, local convergence is still sluggish…”
Get full text

Algorithms for nonlinear bilevel mathematical programs by Edmunds, T.A., Bard, J.F.

“…The bilevel programming problem (BLPP) is a model of a leader-follower game in which play is sequential and cooperation is not permitted…”
Get full text

An investigation of the linear three level programming problem by Bard, Jonathan F.

“… A cutting plane algorithm employing a vertex search procedure at each iteration is proposed to solve the linear three-level case…”
Get full text

Solving Unconstrained Nonlinear Programs Using ACCPM by Dehghani, Ahad

“…In this thesis, we address three main subjects. We first introduce the relation between linear inequality systems and linear programming problems, and continue by introducing the analytic center of a polyhedron and its calculation…”
Get full text

Necessary conditions for the linear three level programming problem by Bard, Jonathan F., Falk, James E.

“… A cutting plane algorithm employing a vertex search procedure at each iteration is proposed to solve the linear 3-level case…”
Get full text