A parametric simplex algorithm for biobjective piecewise linear programming problems

DOI10.3934/JIMO.2016032MaRDI QIDQ2628166zbMATH OpenOpenAlexFDO

Authors Rong Hu, Ya Ping Fang

Publication date 12 June 2017

Published in Journal of Industrial and Management Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.3934/jimo.2016032

zbMATH Keywords

piecewise linear functionparametric simplex algorithmbiobjective programming problemdecomposition of parametric space

Mathematics Subject Classification ID

Convex programming (90C25) Multi-objective and goal programming (90C29) Extreme-point and pivoting methods (90C49)

Recommendations

• A parametric simplex method for optimizing a linear function over the efficient set of bicriteria linear problem
• A parametric simplex algorithm for linear vector optimization problems
• An algorithm for solving bicriterial linear programming problems with parametrical coefficients in the objective functions
• An exact algorithm for biobjective mixed integer linear programming problems
• A simplex algorithm for piecewise-linear programming. III: Computational analysis and applications
• An exact algorithm for biobjective integer programming problems
• Objective variation simplex algorithm for continuous piecewise linear programming
• A Dual Simplex Algorithm for Piecewise-Linear Programming
• Solving Piecewise-Linear Programs: Experiments with a Simplex Approach
• An algorithm for global solution to bi-parametric linear complementarity constrained linear programs

Cites work

• scientific article; zbMATH DE number 1195629 (Why is no real title available?)
• A Branch-and-Cut Algorithm Without Binary Variables for Nonconvex Piecewise Linear Optimization
• A Dual Simplex Algorithm for Piecewise-Linear Programming
• A comparison of mixed-integer programming models for nonconvex piecewise linear cost minimization problems
• A conjugate Rosen's gradient projection method with global line search for piecewise linear concave optimization
• A linear programming approach to the chemical equilibrium problem
• A primal-dual simplex algorithm for bi-objective network flow problems
• A probe-based algorithm for piecewise linear optimization in scheduling
• A simplex algorithm for piecewise-linear fractional programming problems
• A simplex algorithm for piecewise-linear programming I: Derivation and proof
• A simplex algorithm for piecewise-linear programming. II: Finiteness, feasibility and degeneracy
• A simplex algorithm for piecewise-linear programming. III: Computational analysis and applications
• Bilinear modeling solution approach for fixed charge network flow problems
• Dynamic slope scaling and trust interval techniques for solving concave piecewise linear network flow problems
• Multicriteria Optimization
• Multiple objective programming with piecewise linear functions
• Nonconvex piecewise linear knapsack problems
• Piecewise linear programming via interior points
• Primal-dual simplex method for multiobjective linear programming
• Recent advances in linear programming
• Solving Piecewise-Linear Programs: Experiments with a Simplex Approach
• Solving stochastic programs with simple recourse
• The method for solving a piecewise-linear multicommodity flow problem
• The set of all nondominated solutions in linear cases and a multicriteria simplex method
• Variable Disaggregation in Network Flow Problems with Piecewise Linear Costs

Cited in

(2)

• An algorithm for solving bicriterial linear programming problems with parametrical coefficients in the objective functions
• A parametric simplex algorithm for linear vector optimization problems

This page was built for publication: A parametric simplex algorithm for biobjective piecewise linear programming problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2628166)