A parametric simplex algorithm for biobjective piecewise linear programming problems
DOI10.3934/JIMO.2016032zbMATH Open1364.90302OpenAlexW2397314756MaRDI QIDQ2628166FDOQ2628166
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
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
piecewise linear functionparametric simplex algorithmbiobjective programming problemdecomposition of parametric space
Convex programming (90C25) Multi-objective and goal programming (90C29) Extreme-point and pivoting methods (90C49)
Cites Work
- Multicriteria Optimization
- Variable Disaggregation in Network Flow Problems with Piecewise Linear Costs
- A Branch-and-Cut Algorithm Without Binary Variables for Nonconvex Piecewise Linear Optimization
- A simplex algorithm for piecewise-linear programming I: Derivation and proof
- A primal-dual simplex algorithm for bi-objective network flow problems
- Primal-dual simplex method for multiobjective linear programming
- A comparison of mixed-integer programming models for nonconvex piecewise linear cost minimization problems
- Nonconvex piecewise linear knapsack problems
- The set of all nondominated solutions in linear cases and a multicriteria simplex method
- Bilinear modeling solution approach for fixed charge network flow problems
- Solving Piecewise-Linear Programs: Experiments with a Simplex Approach
- A conjugate Rosen's gradient projection method with global line search for piecewise linear concave optimization
- Dynamic slope scaling and trust interval techniques for solving concave piecewise linear network flow problems
- A linear programming approach to the chemical equilibrium problem
- Solving stochastic programs with simple recourse
- A simplex algorithm for piecewise-linear programming. II: Finiteness, feasibility and degeneracy
- A simplex algorithm for piecewise-linear programming. III: Computational analysis and applications
- Recent advances in linear programming
- A simplex algorithm for piecewise-linear fractional programming problems
- Multiple objective programming with piecewise linear functions
- A Dual Simplex Algorithm for Piecewise-Linear Programming
- Title not available (Why is that?)
- Piecewise linear programming via interior points
- A probe-based algorithm for piecewise linear optimization in scheduling
- The method for solving a piecewise-linear multicommodity flow problem
Cited In (2)
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)
