Linear Decomposition Approach for a Class of Nonconvex Programming Problems

Journal of Inequalities and Applications- United Kingdom

doi 10.1186/s13660-017-1342-y

Full Text

Abstract

Available in

Categories

Applied Mathematics

Discrete Mathematics

Date

April 13, 2017

Authors

Publisher

Springer Science and Business Media LLC

Related search

A Comparison of Mixed-Integer Programming Models for Nonconvex Piecewise Linear Cost Minimization Problems

Management Science

Management Science

Operations Research

English

A Fuzzy Approach for Multiobjective Stochastic Linear Programming Problems

Journal of Japan Society for Fuzzy Theory and Intelligent Informatics

English

A Dynamic Programming Approach for a Class of Robust Optimization Problems

SIAM Journal on Optimization

Theoretical Computer Science

English

A Scenario Decomposition Algorithm for Stochastic Programming Problems With a Class of Downside Risk Measures

INFORMS Journal on Computing

Management Science

Computer Science Applications

Information Systems

Operations Research

English

An Approximation Method for Solving Nonconvex Quadratic Programming Problems

Journal of Applied Sciences

English

An Alternating Linearization Bundle Method for a Class of Nonconvex Nonsmooth Optimization Problems

Journal of Inequalities and Applications

Applied Mathematics

Discrete Mathematics

English

Preconditioned ADMM for a Class of Bilinear Programming Problems

Mathematical Problems in Engineering

English

Efficiency of a Decomposition Method for Large-Scale Multiobjective Fuzzy Linear Programming Problems With Block Angular Structure

Journal of Japan Society for Fuzzy Theory and Systems

English

A Trust-Region Based Sequential Linear Programming Approach for AC Optimal Power Flow Problems

Electric Power Systems Research

Electronic Engineering

Power Technology

Energy Engineering

English