On the public citation graph

Penalty method-based equilibrium point approach for solving the linear bilevel multiobjective programming problem

https://doi.org/10.3934/dcdss.2020102

0 signed · 21 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.

Claim with ORCID

Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.

See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/978-1-4757-2836-1openalex-snapshot

Practical Bilevel Optimization: Algorithms and Applications

inferredcites →https://doi.org/10.1007/bf00935007openalex-snapshot

Multiobjective programming and penalty functions

inferredcites →https://doi.org/10.1007/bf01096458openalex-snapshot

Bilevel and multilevel programming: A bibliography review

inferredcites →https://doi.org/10.1007/s10107-008-0259-0openalex-snapshot

Multiobjective bilevel optimization

inferredcites →https://doi.org/10.1007/s10107-010-0342-1openalex-snapshot

Is bilevel programming a special case of a mathematical program with complementarity constraints?

inferredcites →https://doi.org/10.1007/s10107-010-0395-1openalex-snapshot

Three modeling paradigms in mathematical programming

inferredcites →https://doi.org/10.1007/s10479-007-0176-2openalex-snapshot

An overview of bilevel optimization

inferredcites →https://doi.org/10.1007/s10957-004-1711-9openalex-snapshot

A Study of Local Solutions in Linear Bilevel Programming

inferredcites →https://doi.org/10.1007/s10957-012-0161-zopenalex-snapshot

New Optimality Conditions for the Semivectorial Bilevel Optimization Problem

inferredcites →https://doi.org/10.1016/j.cam.2008.12.010openalex-snapshot

Linear bilevel programs with multiple objectives at the upper level

inferredcites →https://doi.org/10.1016/j.ejor.2008.06.026openalex-snapshot

An exact penalty on bilevel programs with linear vector optimization lower level

inferredcites →https://doi.org/10.1023/a:1021729618112openalex-snapshot

Stackelberg Solutions to Multiobjective Two-Level Linear Programming Problems

inferredcites →https://doi.org/10.1186/s13660-015-0780-7openalex-snapshot

Solving linear bilevel multiobjective programming problem via exact penalty function approach

inferredcites →https://doi.org/10.1287/moor.1100.0480openalex-snapshot

Necessary Optimality Conditions for Multiobjective Bilevel Programs

inferredcites →https://doi.org/10.2298/fil1504773lopenalex-snapshot

An exact penalty function approach for solving the linear bilevel multiobjective programming problem

inferredcites →https://doi.org/10.3934/jimo.2015.11.1111openalex-snapshot

Second order sufficient conditions for aclass of bilevel programs with lower level second-order coneprogramming problem

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.2139/ssrn.4857579openalex-extracted

Multitask Optimization Via Feature Clustering of Particle Swarm for Bi-Level Optimization

inferred← citeshttps://doi.org/10.1016/j.asoc.2026.115589openalex-snapshot

Image reconstruction method inspired by a multi-objective bilevel optimization framework for imaging in electrical capacitance tomography

inferred← citeshttps://doi.org/10.1109/tevc.2024.3469156openalex-snapshot

An Efficient Data-Driven Framework for Detecting Infeasible Solutions in Multiobjective Evolutionary Bilevel Optimization

inferred← citeshttps://doi.org/10.1109/tsmc.2023.3271125openalex-snapshot

Multiobjective Bilevel Optimization: A Survey of the State-of-the-Art

inferred← citeshttps://doi.org/10.14569/ijacsa.2022.0131295openalex-snapshot

Research on the Optimization Problem of Agricultural Product Logistics based on Genetic Algorithm

Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.