Pages that link to "Item:Q2790887"
From MaRDI portal
The following pages link to Primal and dual multi-objective linear programming algorithms for linear multiplicative programmes (Q2790887):
Displaying 14 items.
- A branch-and-bound algorithm for a class of mixed integer linear maximum multiplicative programs: a bi-objective optimization approach (Q1628068) (← links)
- A linear programming based algorithm to solve a class of optimization problems with a multi-linear objective function and affine constraints (Q1652440) (← links)
- A vector linear programming approach for certain global optimization problems (Q1756780) (← links)
- Multi-objective optimization based algorithms for solving mixed integer linear minimum multiplicative programs (Q2027064) (← links)
- Approximating a linear multiplicative objective in watershed management optimization (Q2098027) (← links)
- An objective space cut and bound algorithm for convex multiplicative programmes (Q2250114) (← links)
- Exact solution approaches for integer linear generalized maximum multiplicative programs through the lens of multi-objective optimization (Q2669645) (← links)
- Solving generalized convex multiobjective programming problems by a normal direction method (Q2836102) (← links)
- (Q3538742) (← links)
- A Criterion Space Branch-and-Cut Algorithm for Mixed Integer Bilinear Maximum Multiplicative Programs (Q5087716) (← links)
- A New Exact Algorithm to Optimize a Linear Function over the Set of Efficient Solutions for Biobjective Mixed Integer Linear Programs (Q5139635) (← links)
- Solving multiplicative programs by binary-encoding the multiplication operation (Q6047881) (← links)
- A criterion space search algorithm for mixed integer linear maximum multiplicative programs: a multiobjective optimization approach (Q6071088) (← links)
- Output-space outer approximation branch-and-bound algorithm for a class of linear multiplicative programs (Q6614694) (← links)
