Pages that link to "Item:Q1652440"

What links here

⧼whatlinkshere-whatlinkshere-target⧽

Page:

⧼whatlinkshere-whatlinkshere-ns⧽

Namespace:

Invert selection

⧼whatlinkshere-whatlinkshere-filter⧽

Hide transclusions

Hide links

Hide redirects

The following pages link to A linear programming based algorithm to solve a class of optimization problems with a multi-linear objective function and affine constraints (Q1652440):

Displaying 15 items.

A branch-and-bound algorithm for a class of mixed integer linear maximum multiplicative programs: a bi-objective optimization approach (Q1628068) (← links)
Multi-objective optimization based algorithms for solving mixed integer linear minimum multiplicative programs (Q2027064) (← links)
An objective penalty function method for biconvex programming (Q2052381) (← links)
A novel convex relaxation-strategy-based algorithm for solving linear multiplicative problems (Q2075981) (← links)
Exact solution approaches for integer linear generalized maximum multiplicative programs through the lens of multi-objective optimization (Q2669645) (← links)
Nonlinear 0–1 programming: I. Linearization techniques (Q3216430) (← links)
(Q3486369) (← links)
THE MAGIC OF NASH SOCIAL WELFARE IN OPTIMIZATION: DO NOT SUM, JUST MULTIPLY! (Q5038207) (← 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 robust biobjective optimization approach for operating a shared energy storage under price uncertainty (Q6071087) (← links)
A criterion space search algorithm for mixed integer linear maximum multiplicative programs: a multiobjective optimization approach (Q6071088) (← links)
An exact criterion space search algorithm for a bi-objective blood collection problem (Q6168602) (← links)
An efficient branch-and-bound algorithm using an adaptive branching rule with quadratic convex relaxation for globally solving general linear multiplicative programs (Q6581973) (← links)