Pages that link to "Item:Q1186273"

The following pages link to On solving a d.c. programming problem by a sequence of linear programs (Q1186273):

Displaying 17 items.

• Exact penalty and error bounds in DC programming (Q427389) (← links)
• Sequential location of two facilities: comparing random to optimal location of the first facility (Q512975) (← links)
• Outer approximation method incorporating a quadratic approximation for a DC programming problem (Q848730) (← links)
• Constructing a DC decomposition for ordered median problems (Q1037351) (← links)
• The maximization of a function over the efficient set via a penalty function approach (Q1278284) (← links)
• The simplex method as a global optimizer: A \(C\)-programming perspective (Q1315444) (← links)
• An algorithm for solving general D. C. programming problems (Q1332952) (← links)
• Branch-and-bound decomposition approach for solving quasiconvex-concave programs (Q1333350) (← links)
• The hill detouring method for minimizing hinging hyperplanes functions (Q1762167) (← links)
• A method for solving d.c. programming problems. Application to fuel mixture nonconvex optimization problem (Q1890947) (← links)
• Decomposition branch and bound method for globally solving linearly constrained indefinite quadratic minimization problems (Q1924614) (← links)
• DC programming: overview. (Q1969457) (← links)
• Variations and extension of the convex-concave procedure (Q2358020) (← links)
• A continuous approch for globally solving linearly constrained quadratic (Q2767579) (← links)
• A generalized karush-kuhn-tucki optimality condition without constraint qualification using tl approximate subdifferential (Q4293262) (← links)
• On a Markov Decision Process problem involving the Maximum of the Difference between two functions: Technical Note (Q4718599) (← links)
• Convex Maximization via Adjustable Robust Optimization (Q5106408) (← links)