Pages that link to "Item:Q951120"

The following pages link to Nonconvex, lower semicontinuous piecewise linear optimization (Q951120):

Displaying 20 items.

• A branch-cut-and-price algorithm for the piecewise linear transportation problem (Q319653) (← links)
• The piecewise linear optimization polytope: new inequalities and intersection with semi-continuous constraints (Q378090) (← links)
• Fitting piecewise linear continuous functions (Q439615) (← links)
• On linear programs with linear complementarity constraints (Q452341) (← links)
• Modeling disjunctive constraints with a logarithmic number of binary variables and constraints (Q543399) (← links)
• A special ordered set approach for optimizing a discontinuous separable piecewise linear function (Q935235) (← links)
• A PLMF-based decomposition-coordination algorithm for fuzzy linear programming in industrial applications (Q1637770) (← links)
• On modelling non-linear quantity discounts in a supplier selection problem by mixed linear integer optimization (Q1686496) (← links)
• Exact penalty and optimality condition for nonseparable continuous piecewise linear programming (Q1934641) (← links)
• Local smooth representations of parametric semiclosed polyhedra with applications to sensitivity in piecewise linear programs (Q1935266) (← links)
• Three methods for robust grading (Q1991142) (← links)
• Multiple criteria decision making for linguistic judgments with importance quantifier guided ordered weighted averaging operator (Q2200714) (← links)
• Models and solution techniques for production planning problems with increasing byproducts (Q2250099) (← links)
• A computational analysis of multidimensional piecewise-linear models with applications to oil production optimization (Q2255987) (← links)
• Global optimization of non-convex piecewise linear regression splines (Q2399484) (← links)
• Incremental and encoding formulations for mixed integer programming (Q2450751) (← links)
• On piecewise linear approximations of bilinear terms: structural comparison of univariate and bivariate mixed-integer programming formulations (Q2694515) (← links)
• Mixed Integer Linear Programming Formulation Techniques (Q2808240) (← links)
• Modeling Disjunctive Constraints with a Logarithmic Number of Binary Variables and Constraints (Q3503848) (← links)
• A Combinatorial Approach for Small and Strong Formulations of Disjunctive Constraints (Q5108220) (← links)